oj.uz

Submission #601170

# Submission time Handle Problem Language Result Execution time Memory
601170 2022-07-21T12:21:19 Z TimDee Stranded Far From Home (BOI22_island) C++17
20 / 100
 432 ms 72356 KB 
    #include <bits/stdc++.h>
    using namespace std;
     
    #define paiu return
    #define moment 0;
     
    #define int long long
    #define double long double
    #define ll long long
     
    #define forr(i,x) for (int i=0; i<x; i++)
    #define forn(i,x) for (int i=0; i<x; i++)
     
    #define vi(a,n) vector<int> a(n,0)
     
    //cringe define
    #define vii(a,n) vi(a,n); forr(i,n) cin>>a[i];
    vector<int> ___makeprefsum(vector<int>&a) {
        int n=a.size();
        vi(pr,n+1);
        forn(i,n) pr[i+1]=pr[i]+a[i];
        return pr;
    }
    #define prefsum(pr,a) vector<int> pr=___makeprefsum(a);
     
    #define all(v) v.begin(),v.end()
    #define rall(v) v.rbegin(),v.rend()
     
    #define pb(x) push_back(x)
    #define pf pop_front();
    #define last(c) c[c.size()-1]
     
    #define f first
    #define s second
     
    #define pi pair<int, int>
    #define mp(x,y) make_pair(x, y)
     
    const ll mod = 1000000007;
    const double ppi = acos(0) * 2;
         
    const int maxn = 1e5+1;
    const int inf = INT_MAX;
    const ll linf = LLONG_MAX;
    const ll mmod = 998244353;
     
    vector<int> a;
    vector<vector<int>> adj(2e5);
    auto cmp = [](int i, int j) { return a[i]<=a[j]; };
     
    void subtask1(int n, int m) {
     
        string ans(n,'1');
     
        forn(i,n) {
            set<int,decltype(cmp)> s(cmp);
            int cnt=a[i];
            bitset<2000> vis; vis.set(i,1); //cout<<i+1<<"->";
            for (auto v:adj[i]) { s.insert(v); vis.set(v,1); }
            while (!s.empty()) {
                auto it=s.begin();
                int u=*it;
                //cout<<u+1<<"->";
                if (a[u]>cnt) {ans[i]='0'; break;}
                cnt+=a[u]; 
                vis.set(u,1);
                s.erase(it);
                for (auto v:adj[u]) if (!vis[v]) { s.insert(v); vis.set(v,1); }
            }
            //cout<<'\n';
        }
        cout<<ans<<'\n';
    }
     
    void dfs(vector<vector<int>>&adj, vector<int>&vis, vector<int>&d, int v) {
        if (vis[v]) return;
        vis[v]=1;
        d[v]+=a[v]; //cout<<v<<' '<<d[v]<<' '<<a[v]<<'\n';
        for (auto u:adj[v]) {
            dfs(adj,vis,d,u);
            if (u>v) d[v]+=d[u];
        }
    }
     
    void ver(vector<vector<int>>&adj, vector<int>&vis, vector<int>&d, vector<int>&up, int v) {
        if (vis[v]) return;
        vis[v]=1;
        for (auto u:adj[v]) {
            if (u<v) continue;
            if (d[u]>=a[v]) {
                up[u]=1;
                ver(adj,vis,d,up,u);
            }
        }
    }
     
    void subtask2(int n, int m) {
        vector<int> up(n,0);
        vector<int> d(n,0), vis(n,0);
        dfs(adj,vis,d,0);
        //forn(i,n) cout<<d[i]<<' '; cout<<'\n';
        up[0]=1;
        vis.assign(n,0);
        ver(adj,vis,d,up,0);
        forn(i,n) cout<<up[i]; cout<<'\n';
    }
     
    struct indextree {
     
        vector<int> tree;
        int size;
        vector<int> a;
        int n;
     
        void put(int i, int v) {
     
            tree[i]=v;
     
        }
     
        int combine(int i, int j) {
            // for min
            if (a[i]<a[j]) return i;
            else return j;
     
            // for max
            //if (a[i]>a[j]) return i;
            //else return j;
        }
     
        void update(int v, int l, int r) {
     
            if (r-l==1) return;
     
            int mid=(l+r)/2;
     
            update(2*v+1,l,mid);
            update(2*v+2,mid,r);
     
            tree[v]=combine(tree[2*v+1],tree[2*v+2]);
     
        }
     
        void update(int v, int l, int r, int i) {
     
            if (r-l==1) return;
            if (r<=i || l>i) return;
     
            int mid=(l+r)/2;
     
            update(2*v+1,l,mid);
            update(2*v+2,mid,r);
     
            tree[v]=combine(tree[2*v+1],tree[2*v+2]);
     
        }
     
        indextree(vector<int>&arr) {
            a=arr;
     
            //for min
            a.pb(linf);
            //for max
            //a.pb(-linf);
     
            n=a.size()-1;
     
            size=1;
            while (size<n+1) size*=2;
     
            tree.assign(2*size-1, n);
     
            forn(i,n) put(size-1+i,i);
     
            update(0,0,size);
     
        }
     
        indextree(int N) {
     
            n=N;
     
            //for min
            a.assign(n+1,linf);
            //for max
            //a.assign(n+1,-linf);
     
            size=1;
            while (size<n+1) size*=2;
     
            tree.assign(2*size-1, n);
            forn(i,N) put(size-1+i,i);
            update(0,0,size);
     
        }
     
        int query(int v, int lx, int rx, int l, int r) {
     
            if (lx>=r || rx<=l) return n;
            if (lx>=l && rx<=r) return tree[v];
     
            int mid=(lx+rx)/2;
     
            int L = query(2*v+1,lx,mid,l,r);
            int R = query(2*v+2,mid,rx,l,r);
     
            return combine(L,R);
     
        }
     
        int query(int l, int r) {
            return query(0,0,size,l,r);
        }
     
        void set(int i, int v) {
     
            a[i]=v;
            update(0,0,size,i);
     
        }
     
        //MY
        void print() {
     
            int z=0;
            while (z<2*size-1) {
                for (int i=z; i<2*z+1; i++) cout<<"("<<tree[i]<<","<<a[tree[i]]<<") "; cout<<'\n';
                z=2*z+1;
            }
     
        }
     
    };
    void subtask3(int n, int m) {
        string ans(n,'1');
        set<int> left;
        forn(i,n) left.insert(i);
        indextree st(a);
        int unvis=n;
        vector<int> d(n,0), vis(n,0);
        forn(i,n) d[i]=a[i];
        while (unvis) {
            int u=st.tree[0]; --unvis;
            left.erase(left.find(u));
            vector<int> path = {u};
            set<int,decltype(cmp)> s(cmp);
            auto it1=left.upper_bound(u), it2=left.upper_bound(u);
            d.push_back(linf);
            int l=n,r=n;
            if (it1!=left.begin()) {--it1; 
                l=*it1; 
            }
            if (it2!=left.end()) {
                r=*it2;
            }
     
            while (l!=n && r!=n) {
                int v;
                if (d[l]<=d[r]) v=l;
                else v=r;
                if (d[u]>=d[v]) {
                    left.erase(left.find(v));
                    if (v<u) {
                        auto it1=left.upper_bound(u);
                        if (it1!=left.begin()) {
                            --it1; 
                            l=*it1; 
                        }
                    } else {
                        auto it2=left.upper_bound(u);
                        if (it2!=left.end()) {
                            r=*it2;
                        }
                    }
                    u=v;
                    --unvis;
                } else {
                    for (auto x:path) { ans[x]='0'; st.set(x,n); }
                    break;
                }
                d[v]+=d[u];
                path.pb(v);
            }
     
        }
        cout<<ans;
    }
     
    void solve() {
        
        int n,m; cin>>n>>m;
        vii(b,n); a=b;
        int _p3=1, _p2=1;
        vector<int> lesscnt(n,0);
     
        forn(i,m) {
            int u,v; cin>>u>>v;
            --u, --v;
            if (u>v) swap(u,v);
            adj[u].pb(v);
            adj[v].pb(u);
            _p3&=(abs(u-v)==1);
            lesscnt[max(u,v)]++;
        }
     
        forn(i,n) _p2&=(i==0 || (lesscnt[i]==1));
     
        if (n<=2000 && m<=2000) {
            subtask1(n,m);
            return;
        } 
        forn(i,n-1) _p2&=(a[i]>=a[i+1]);
        if (_p2) {
            subtask2(n,m);
            return;
        }
        if (_p3) {
            subtask3(n,m);
            return;
        }
    }
     
    int32_t main() {
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        
        int t=1;
        //cin>>t;
        while(t--) solve();
        
        paiu moment
    }

Compilation message

island.cpp: In function 'void subtask2(long long int, long long int)':
island.cpp:12:23: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   12 |     #define forn(i,x) for (int i=0; i<x; i++)
      |                       ^~~
island.cpp:105:9: note: in expansion of macro 'forn'
  105 |         forn(i,n) cout<<up[i]; cout<<'\n';
      |         ^~~~
island.cpp:105:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  105 |         forn(i,n) cout<<up[i]; cout<<'\n';
      |                                ^~~~
island.cpp: In member function 'void indextree::print()':
island.cpp:227:17: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  227 |                 for (int i=z; i<2*z+1; i++) cout<<"("<<tree[i]<<","<<a[tree[i]]<<") "; cout<<'\n';
      |                 ^~~
island.cpp:227:88: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  227 |                 for (int i=z; i<2*z+1; i++) cout<<"("<<tree[i]<<","<<a[tree[i]]<<") "; cout<<'\n';
      |                                                                                        ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 226 ms 5152 KB Output is correct
5 Correct 217 ms 5132 KB Output is correct
6 Correct 289 ms 5132 KB Output is correct
7 Correct 219 ms 5076 KB Output is correct
8 Correct 150 ms 5124 KB Output is correct
9 Correct 432 ms 5184 KB Output is correct
10 Correct 103 ms 5120 KB Output is correct
11 Correct 99 ms 5132 KB Output is correct
12 Correct 122 ms 5144 KB Output is correct
13 Correct 182 ms 5120 KB Output is correct
14 Correct 129 ms 5076 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 155 ms 28180 KB Output is correct
4 Correct 145 ms 28112 KB Output is correct
5 Correct 201 ms 21388 KB Output is correct
6 Correct 192 ms 21812 KB Output is correct
7 Correct 178 ms 21936 KB Output is correct
8 Correct 205 ms 21952 KB Output is correct
9 Correct 176 ms 23104 KB Output is correct
10 Correct 119 ms 22372 KB Output is correct
11 Correct 109 ms 22324 KB Output is correct
12 Correct 175 ms 21880 KB Output is correct
13 Correct 166 ms 36404 KB Output is correct
14 Correct 149 ms 36500 KB Output is correct
15 Correct 164 ms 36420 KB Output is correct
16 Correct 108 ms 36172 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Runtime error 283 ms 72356 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Incorrect 114 ms 16948 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 226 ms 5152 KB Output is correct
5 Correct 217 ms 5132 KB Output is correct
6 Correct 289 ms 5132 KB Output is correct
7 Correct 219 ms 5076 KB Output is correct
8 Correct 150 ms 5124 KB Output is correct
9 Correct 432 ms 5184 KB Output is correct
10 Correct 103 ms 5120 KB Output is correct
11 Correct 99 ms 5132 KB Output is correct
12 Correct 122 ms 5144 KB Output is correct
13 Correct 182 ms 5120 KB Output is correct
14 Correct 129 ms 5076 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 155 ms 28180 KB Output is correct
18 Correct 145 ms 28112 KB Output is correct
19 Correct 201 ms 21388 KB Output is correct
20 Correct 192 ms 21812 KB Output is correct
21 Correct 178 ms 21936 KB Output is correct
22 Correct 205 ms 21952 KB Output is correct
23 Correct 176 ms 23104 KB Output is correct
24 Correct 119 ms 22372 KB Output is correct
25 Correct 109 ms 22324 KB Output is correct
26 Correct 175 ms 21880 KB Output is correct
27 Correct 166 ms 36404 KB Output is correct
28 Correct 149 ms 36500 KB Output is correct
29 Correct 164 ms 36420 KB Output is correct
30 Correct 108 ms 36172 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Runtime error 283 ms 72356 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -