oj.uz

답안 #573268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
573268 2022-06-06T10:23:45 Z MohamedFaresNebili Stranded Far From Home (BOI22_island) C++14
20 / 100
 1000 ms 30028 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

        using namespace std;
        using namespace __gnu_pbds;

        using ll = long long;
        using ii = pair<int, int>;
        using vi = vector<int>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define lb lower_bound
        #define int ll

        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;

        int N, M, S[200001], tin[200001];
        int timer, out[200001], st[800001];
        bool reach[200001];
        vector<int> adj[200001];
        string res;

        void update(int v, int l, int r, int p, int val) {
            if(l == r) {
                st[v] = val;
                return;
            }
            int md = (l + r) / 2;
            if(p <= md)
                update(v * 2, l, md, p, val);
            else update(v * 2 + 1, md + 1, r, p, val);
            st[v] = st[v * 2] + st[v * 2 + 1];
        }
        int query(int v, int l, int r, int lo, int hi) {
            if(l > hi || r < lo) return 0;
            if(l >= lo && r <= hi) return st[v];
            return query(v * 2, l, (l + r) / 2, lo, hi)
            + query(v * 2 + 1, (l + r) / 2 + 1, r, lo, hi);
        }
        void dfs(int v, int p) {
            tin[v] = timer;
            update(1, 0, N - 1, timer++, S[v]);
            for(auto u : adj[v]) {
                if(u == p) continue;
                dfs(u, v);
            }
            out[v] = timer - 1;
        }
        void solve(int v, int p) {
            int calc = query(1, 0, N - 1, tin[v], out[v]);
            if(calc < S[p]) return;
            reach[v] = reach[p]; res[v - 1] = '1';
            for(auto u : adj[v]) {
                if(u == p) continue;
                solve(u, v);
            }
        }
        void subtask2() {
            dfs(1, 1); reach[1] = 1; solve(1, 1);
            cout << res << "\n";
        }

        int32_t main() {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> N >> M; int R = 0; res.assign(N, '0');
            for(int l = 1; l <= N; l++)
                cin >> S[l], R += S[l];
            for(int l = 0; l < M; l++) {
                int U, V; cin >> U >> V;
                adj[U].pb(V); adj[V].pb(U);
            }
            bool ok = 1;
            for(int l = 2; l <= N; l++) {
              	int v = 0;
                for(auto U : adj[l])
                  v += (U < l);
                ok &= (v == 1); ok &= (S[l] <= S[l - 1]);
            }
            if(ok) {
                subtask2();
                return 0;
            }
            for(int l = 1; l <= N; l++) {
                int curr = 0;
                priority_queue<ii, vector<ii>, greater<ii>> pq;
                pq.push({0, l}); vector<bool> vis(N + 1, 0);
                while(!pq.empty()) {
                    int A = pq.top().second, B = pq.top().first; pq.pop();
                    if(vis[A] || (S[A] > curr && A != l)) continue;
                    vis[A] = 1; curr += S[A];
                    for(auto E : adj[A]) {
                        if(vis[E]) continue;
                        pq.push({S[E], E});
                    }
                }
                if(curr == R) res[l - 1] = '1';
            }
            cout << res << "\n";
        }

Compilation message

island.cpp: In function 'int32_t main()':
island.cpp:92:46: warning: unused variable 'B' [-Wunused-variable]
   92 |                     int A = pq.top().second, B = pq.top().first; pq.pop();
      |                                              ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 194 ms 5072 KB Output is correct
5 Correct 145 ms 5124 KB Output is correct
6 Correct 251 ms 5076 KB Output is correct
7 Correct 196 ms 5076 KB Output is correct
8 Correct 157 ms 5112 KB Output is correct
9 Correct 231 ms 5128 KB Output is correct
10 Correct 63 ms 5076 KB Output is correct
11 Correct 59 ms 5100 KB Output is correct
12 Correct 4 ms 5204 KB Output is correct
13 Correct 106 ms 5076 KB Output is correct
14 Correct 88 ms 5076 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 187 ms 25420 KB Output is correct
4 Correct 169 ms 25152 KB Output is correct
5 Correct 261 ms 21292 KB Output is correct
6 Correct 230 ms 21668 KB Output is correct
7 Correct 223 ms 21640 KB Output is correct
8 Correct 263 ms 21836 KB Output is correct
9 Correct 176 ms 22836 KB Output is correct
10 Correct 133 ms 21992 KB Output is correct
11 Correct 160 ms 22136 KB Output is correct
12 Correct 178 ms 21532 KB Output is correct
13 Correct 134 ms 29772 KB Output is correct
14 Correct 149 ms 29768 KB Output is correct
15 Correct 187 ms 30028 KB Output is correct
16 Correct 111 ms 29848 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Execution timed out 1081 ms 13008 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Execution timed out 1091 ms 14200 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 194 ms 5072 KB Output is correct
5 Correct 145 ms 5124 KB Output is correct
6 Correct 251 ms 5076 KB Output is correct
7 Correct 196 ms 5076 KB Output is correct
8 Correct 157 ms 5112 KB Output is correct
9 Correct 231 ms 5128 KB Output is correct
10 Correct 63 ms 5076 KB Output is correct
11 Correct 59 ms 5100 KB Output is correct
12 Correct 4 ms 5204 KB Output is correct
13 Correct 106 ms 5076 KB Output is correct
14 Correct 88 ms 5076 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 187 ms 25420 KB Output is correct
18 Correct 169 ms 25152 KB Output is correct
19 Correct 261 ms 21292 KB Output is correct
20 Correct 230 ms 21668 KB Output is correct
21 Correct 223 ms 21640 KB Output is correct
22 Correct 263 ms 21836 KB Output is correct
23 Correct 176 ms 22836 KB Output is correct
24 Correct 133 ms 21992 KB Output is correct
25 Correct 160 ms 22136 KB Output is correct
26 Correct 178 ms 21532 KB Output is correct
27 Correct 134 ms 29772 KB Output is correct
28 Correct 149 ms 29768 KB Output is correct
29 Correct 187 ms 30028 KB Output is correct
30 Correct 111 ms 29848 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Execution timed out 1081 ms 13008 KB Time limit exceeded
33 Halted 0 ms 0 KB -