oj.uz

Submission #714663

# Submission time Handle Problem Language Result Execution time Memory
714663 2023-03-25T07:30:42 Z Toxtaq Stranded Far From Home (BOI22_island) C++17
0 / 100
 1000 ms 36948 KB 
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>g;
vector<int>num;
vector<bool>vis, chosen;
bool cmp(int a, int b){
    return num[a] < num[b];
}
long long cnt = 0;
set<int>tmp;
void dfs(int u){
    vis[u] = 1;
    vector<int>tempo;
    for(int v : g[u]){
        if(!chosen[v] && cnt >= num[v]){
            cnt += num[v];
            chosen[v] = 1;
            tempo.push_back(v);
        }
        else if(cnt < num[v]){
            tmp.insert(v);
        }
    }
    for(int v : tempo){
        if(!vis[v]){
            dfs(v);
        }
    }
}
int main()
{
    int n, m;
    cin >> n >> m;
    g.resize(n + 1);
    num.resize(n + 1);
    vis.resize(n + 1);
    chosen.resize(n + 1);
    for(int i = 1;i <= n;++i)cin >> num[i];
    for(int i = 0;i < m;++i){
        int u, v;
        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(), cmp);
    }
//    for(int i = 1;i <= n;++i){
//        cout << i << ": ";
//        for(int j : g[i]){
//            cout << j << " ";
//        }
//        cout << '\n';
//    }
    string s = "";
    for(int i = 1;i <= n;++i){
        cnt = num[i];
        chosen[i] = 1;
        dfs(i);
        for(int j : tmp){
            if(!chosen[j] && cnt >= num[j]){
                cnt += num[j];
                chosen[j] = 1;
                dfs(j);
            }
        }
        bool ok = 1;
        for(int j = 1;j <= n && ok;++j){
            if(!vis[j]){
                ok = 0;
            }
        }
        for(int j = 1;j <= n;++j){
            vis[j] = 0;
            chosen[j] = 0;
        }
        if(ok)s += '1';
        else s += '0';
        tmp.clear();
    }
    cout << s;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 115 ms 456 KB Output is correct
5 Incorrect 133 ms 440 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Execution timed out 1084 ms 22088 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 300 KB Output is correct
2 Execution timed out 1076 ms 36948 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

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

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 115 ms 456 KB Output is correct
5 Incorrect 133 ms 440 KB Output isn't correct
6 Halted 0 ms 0 KB -