Submission #1309493

#	Time	Username	Problem	Language	Result	Execution time	Memory
1309493		tnt	Lightning Rod (NOI18_lightningrod)	C++20	19 / 100	1016 ms	78396 KiB

Main

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#define pb push_back                    
#define ll long long  
#define f first
#define s second
//#define sz(v) int(v.size())
#define all(v) v.begin(),v.end()

int mod =  1e9 + 7;
const int N = 2e5,k = 317 + 1;
const int inf = 2e9;
void solve(){
    int n;
    cin >> n;
    vector <pair<int,int>> v;
    int cnt = 0,cnt1 = 0;
    int x[n + 1],y[n + 1];
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> y[i];
        if(x[i] == i) cnt1++;
        if(y[i] == i) cnt++;
    }
    if(cnt == n){
        cout << n;
        return;
    }
    if(cnt1 == n){
        int ans = 0;
        for(int i = 1; i <= n; i++){
            if(y[i] == 1){
                ans++;
                if(i - 1 > 0 && y[i - 1] == 0){
                    y[i - 1] = -1;   
                }
                if(i + 1 <= n && y[i + 1] == 0){
                    y[i + 1] = -1;   
                }
                y[i] = -1;
            }
        }
        for(int i = 1; i <= n; i++) if(y[i] != -1) ans++;
        cout << ans << '\n';
        return;
    }
    if(n <= 20){
        for(int i = 1; i <= n; i++) v.pb({x[i],y[i]});
        int ans = inf;
        for(int mask = 0; mask < (1 << n); mask++){
            vector <int> v1;
            for(int i = 0; i < n; i++){
                if((mask >> i & 1) == 1){
                    v1.pb(i);
                }
            }
            bool f1 = 1;
            for(int i = 0; i < n; i++){
                int x1,y1;
                bool f = 0;
                for(auto to : v1){
                    x1 = v[to].f,y1 = v[to].s;
                    if(abs(x1 - v[i].f) <= y1 - v[i].s){
                        f = 1;
                        break;
                    }
                }
                if(f == 0){
                    f1 = 0;
                }
            }
            if(f1 == 1){
                ans = min(ans,__builtin_popcount(mask));
            }
        }
        cout << ans;
    }
}
signed main(){
    //freopen("time.in", "r", stdin);
    //freopen("time.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    while(t--){
        solve();
    }
}                          	

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