Submission #328415

#	Time	Username	Problem	Language	Result	Execution time	Memory
328415		egas	Lightning Rod (NOI18_lightningrod)	C++14	11 / 100	1920 ms	262148 KiB

Main

#include <bits/stdc++.h>

using namespace std;

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

    if(l>=r) {

        return 0;

    }

    if(l==r) {

        return 1;

    }

    int res=INT_MAX;

    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[i].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[i].first-v[j].first)) {

                left=j;

            } else {

                break;

            }

        }

        res=min(res,1+solve(l,left-1,v)+solve(right+1,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 {

            cout << solve(0,n-1,v) << '\n';

        }

    }

    return 0;

}

• Subtask 1: 4 / 4
• Subtask 2: 7 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 21
• Subtask 5: 0 / 26
• Subtask 6: 0 / 10
• Subtask 7: 0 / 20