oj.uz

Submission #692842

# Submission time Handle Problem Language Result Execution time Memory
692842 2023-02-02T06:26:50 Z saayan007 Lightning Rod (NOI18_lightningrod) C++17
19 / 100
 2000 ms 175688 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;

#define fur(i, a, b) for(ll i = a; i <= (ll) b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll) b; --i)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define nl "\n"

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n;
    cin >> n;

    ll x[n + 1], y[n + 1];
    fur(i, 1, n) {
        cin >> x[i] >> y[i];
    }

    ll ans = n;
    fur(i, 0, (1 << n) - 1) {
        bool rod[n + 1] = {};
        bool prot[n + 1] = {};
        fur(j, 0, n - 1) {
            if(i & (1 << j))
                rod[j + 1] = 1;
        }

        fur(j, 1, n) {
            if(!rod[j])
                continue;
            fur(k, 1, n) {
                if(abs(x[k] - x[j]) <= y[j] - y[k])
                    prot[k] = 1;
            }
        }

        bool all = 1;
        fur(j, 1, n)
            all &= prot[j];
        if(all) {
            ans = min(ans, (ll)__builtin_popcountll(i));
        }
    }
    cout << ans << nl;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2075 ms 170988 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 208 ms 300 KB Output is correct
9 Correct 518 ms 308 KB Output is correct
10 Correct 509 ms 300 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 208 ms 300 KB Output is correct
9 Correct 518 ms 308 KB Output is correct
10 Correct 509 ms 300 KB Output is correct
11 Execution timed out 2072 ms 340 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 208 ms 300 KB Output is correct
9 Correct 518 ms 308 KB Output is correct
10 Correct 509 ms 300 KB Output is correct
11 Execution timed out 2072 ms 340 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2093 ms 175688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2075 ms 170988 KB Time limit exceeded
2 Halted 0 ms 0 KB -