oj.uz

Submission #714676

# Submission time Handle Problem Language Result Execution time Memory
714676 2023-03-25T07:43:54 Z TheSahib Stranded Far From Home (BOI22_island) C++14
20 / 100
 1000 ms 402920 KB 
#include <bits/stdc++.h>


#define ll long long
#define pii pair<int, int>

using namespace std;

const int MAX = 2e5 + 5;


int n, m;
int arr[MAX];
vector<int> g[MAX];


bool visited[MAX];
bool bfs(int start){
    fill(visited, visited + n + 1, 0);
    
    ll cnt = 0;
    
    set<pii> q;
    q.insert({arr[start], start});
    while(!q.empty()){
        int node = q.begin()->second;
        int c = q.begin()->first;
        q.erase(q.begin());
        visited[node] = true;
        if(cnt >= c || node == start){
            cnt += c;
            for(int to:g[node]){
                if(visited[to]) continue;
                q.insert({arr[to], to});
            }
        }
        else{
            return false;
        }
    }
    return true;
}

ll subTree[MAX];
bool possible[MAX];
void dfs1(int node, int p){
    ll ans = arr[node];
    for(int to:g[node]){
        if(to == p) continue;
        dfs1(to, node);
        ans += subTree[to];
    }
    subTree[node] = ans;
}

void dfs2(int node, int p){
    if(node == 1){
        possible[node] = 1;
    }
    else{
        possible[node] = (subTree[node] >= arr[p]);
    }
    if(!possible[node]) return;
    for(int to:g[node]){
        if(to == p) continue;
        dfs2(to, node);
    }
}

int main(){
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> arr[i];
    }
    for (int i = 0; i < m; i++)
    {
        int a, b; cin >> a >> b;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }
    if(n > 2000 || m > 2000){
        dfs1(1, 1);
        dfs2(1, 1);
        for (int i = 1; i <= n; i++)
        {
            cout << possible[i];
        }
        return 0;
    }
    for (int i = 1; i <= n; i++)
    {
        cout << bfs(i);
    }
    
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 227 ms 5080 KB Output is correct
5 Correct 219 ms 5092 KB Output is correct
6 Correct 361 ms 5080 KB Output is correct
7 Correct 221 ms 5076 KB Output is correct
8 Correct 167 ms 5076 KB Output is correct
9 Correct 298 ms 5116 KB Output is correct
10 Correct 103 ms 5076 KB Output is correct
11 Correct 114 ms 5076 KB Output is correct
12 Correct 114 ms 5076 KB Output is correct
13 Correct 192 ms 5076 KB Output is correct
14 Correct 110 ms 5196 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 294 ms 20200 KB Output is correct
4 Correct 213 ms 20176 KB Output is correct
5 Correct 325 ms 13868 KB Output is correct
6 Correct 306 ms 14152 KB Output is correct
7 Correct 289 ms 14156 KB Output is correct
8 Correct 291 ms 14200 KB Output is correct
9 Correct 309 ms 14084 KB Output is correct
10 Correct 210 ms 14808 KB Output is correct
11 Correct 209 ms 14908 KB Output is correct
12 Correct 245 ms 14276 KB Output is correct
13 Correct 237 ms 29504 KB Output is correct
14 Correct 234 ms 29600 KB Output is correct
15 Correct 305 ms 29884 KB Output is correct
16 Correct 275 ms 29476 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Incorrect 274 ms 29404 KB Output isn't correct
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 Execution timed out 1087 ms 402920 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 227 ms 5080 KB Output is correct
5 Correct 219 ms 5092 KB Output is correct
6 Correct 361 ms 5080 KB Output is correct
7 Correct 221 ms 5076 KB Output is correct
8 Correct 167 ms 5076 KB Output is correct
9 Correct 298 ms 5116 KB Output is correct
10 Correct 103 ms 5076 KB Output is correct
11 Correct 114 ms 5076 KB Output is correct
12 Correct 114 ms 5076 KB Output is correct
13 Correct 192 ms 5076 KB Output is correct
14 Correct 110 ms 5196 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 294 ms 20200 KB Output is correct
18 Correct 213 ms 20176 KB Output is correct
19 Correct 325 ms 13868 KB Output is correct
20 Correct 306 ms 14152 KB Output is correct
21 Correct 289 ms 14156 KB Output is correct
22 Correct 291 ms 14200 KB Output is correct
23 Correct 309 ms 14084 KB Output is correct
24 Correct 210 ms 14808 KB Output is correct
25 Correct 209 ms 14908 KB Output is correct
26 Correct 245 ms 14276 KB Output is correct
27 Correct 237 ms 29504 KB Output is correct
28 Correct 234 ms 29600 KB Output is correct
29 Correct 305 ms 29884 KB Output is correct
30 Correct 275 ms 29476 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Incorrect 274 ms 29404 KB Output isn't correct
33 Halted 0 ms 0 KB -