oj.uz

Submission #328412

# Submission time Handle Problem Language Result Execution time Memory
328412 2020-11-16T12:52:17 Z egas Lightning Rod (NOI18_lightningrod) C++14
11 / 100
 1787 ms 132092 KB 
#include <bits/stdc++.h>

using namespace std;

int solve(int l,int r,vector<pair<int,int> > &v) {

    if(l==r) {

        return 1;

    }

    int res=1e9;

    for(int i=l; i<=r; i++) {

        int left=i;

        int right=i;

        for(int j=i; j<=r; j++) {

            if(abs(v[i].second-v[j].second)>=abs(v[j].first-v[j].first)) {

                right=j;

            } else {

                break;

            }

        }

        for(int j=i; j>=l; j--) {

            if(abs(v[i].second-v[j].second)>=abs(v[j].first-v[j].first)) {

                left=j;

            } else {

                break;

            }

        }

        res=min(res,1+solve(l,left,v)+solve(right,r,v));

    }

    return res;

}

int32_t main() {

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    int n;

    cin >> n;

    vector<pair<int,int> > v;

    bool isSub1=true;

    for(int i = 0 ; i < n ; i++) {

        int x;

        cin >> x;

        int y;

        cin >> y;

        if(y!=1)isSub1=false;

        v.push_back({x,y});

    }

    if(isSub1) {

        cout << n << '\n';

    } else {

        if(n==2) {

            if(abs(v[1].second-v[0].second)>=abs(v[1].first-v[0].first)) {

                cout << 1 << '\n';

            } else {

                cout << 2 << '\n';

            }

        } else {

        }

    }

    return 0;

}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1779 ms 132016 KB Output is correct
2 Correct 1787 ms 131892 KB Output is correct
3 Correct 1724 ms 131996 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Incorrect 0 ms 364 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Incorrect 0 ms 364 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Incorrect 0 ms 364 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1755 ms 132092 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1779 ms 132016 KB Output is correct
2 Correct 1787 ms 131892 KB Output is correct
3 Correct 1724 ms 131996 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Incorrect 0 ms 364 KB Output isn't correct
12 Halted 0 ms 0 KB -