oj.uz

Submission #722949

# Submission time Handle Problem Language Result Execution time Memory
722949 2023-04-13T06:11:18 Z rshohruh Stranded Far From Home (BOI22_island) C++17
0 / 100
 1000 ms 20512 KB 
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
vector<int> s;
vector<bool> used;
class Compare{
public:
    bool operator () (int a, int b){
        return s[a] > s[b];
    }
};
priority_queue<int, vector<int>, Compare> b;
int n;
char bfs(int u){
    used.assign(n+1, false);
    int cnt = s[u];
    used[u] = true;
    for(int v: g[u]){
        b.push(v);
        used[u] = true;
    }
    while(!b.empty()){
        u = b.top();
        // cout << s[u] << ' ';
        b.pop();
        if(s[u] > cnt) return '0';
        cnt += s[u];
        for(int v: g[u]){
            if(!used[v]){
                b.push(v);
                used[v] = true;
            }
        }
    }
    return '1';
}

int main(){
    int m;
    cin >> n >> m;
    s.resize(n+1);
    g.resize(n+1);
    for(int i = 1; i <= n; ++i) cin >> s[i];
    for(int i = 0, u, v; i < m; ++i){
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    // for(int i = 1; i <= n; ++i){
    //     sort(g[i].begin(), g[i].end(), [&](int a, int b){
    //         return s[a] < s[b];
    //     });
    // }
    for(int i = 1; i <= n; ++i) cout << bfs(i);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 5 ms 600 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 558 ms 14264 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 917 ms 20512 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 5 ms 600 KB Output isn't correct
5 Halted 0 ms 0 KB -