oj.uz

Submission #979225

# Submission time Handle Problem Language Result Execution time Memory
979225 2024-05-10T11:58:05 Z ArthuroWich Stranded Far From Home (BOI22_island) C++17
10 / 100
 1000 ms 32000 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long int
void solve() {
    int n, m, po = 0;
    cin >> n >> m;
    vector<int> s(n+1), ans(n+1), vis(n+1, 0), proc(n+1, 0);
    vector<vector<int>> adj(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
        po += s[i];
    }
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    queue<int> q;
    q.push(1);
    while(!q.empty()) {
        int ind = q.front();
        q.pop();
        if (proc[ind]) {
            continue;
        }
        proc[ind] = 1;
        int inh = s[ind]; 
        priority_queue<pair<int, int>> pq;
        pq.push({0, ind});
        while(!pq.empty()) {
            auto [w, a] = pq.top();
            pq.pop();
            if (vis[a] == ind) {
                continue;
            }
            w = abs(w);
            if (inh < w) {
                break;
            }
            inh += w;
            if (ans[a]) {
                ans[ind] = 1;
                break;
            }
            vis[a] = ind;
            for (int b : adj[a]) {
                if (vis[b] == ind) {
                    continue;
                }
                pq.push({-s[b], b});
            }
        }
        if (po == inh) {
            ans[ind] = 1;
        }
        for (int j : adj[ind]) {
            if (proc[j]) {
                continue;
            }
            q.push(j);
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << ans[i];
    }
    cout << endl;
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while(t--) {
        solve();
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 214 ms 680 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 80 ms 628 KB Output is correct
14 Correct 69 ms 600 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 1085 ms 24340 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 156 ms 22196 KB Output is correct
3 Correct 169 ms 22296 KB Output is correct
4 Execution timed out 1065 ms 21900 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 489 ms 23220 KB Output is correct
3 Correct 490 ms 23124 KB Output is correct
4 Correct 397 ms 23376 KB Output is correct
5 Correct 418 ms 23260 KB Output is correct
6 Correct 454 ms 23004 KB Output is correct
7 Correct 160 ms 32000 KB Output is correct
8 Execution timed out 1041 ms 26448 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 214 ms 680 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 80 ms 628 KB Output is correct
14 Correct 69 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Execution timed out 1085 ms 24340 KB Time limit exceeded
18 Halted 0 ms 0 KB -