oj.uz

Submission #877561

# Submission time Handle Problem Language Result Execution time Memory
877561 2023-11-23T10:28:08 Z vjudge1 Stranded Far From Home (BOI22_island) C++17
0 / 100
 1000 ms 16464 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int32_t main() {
    setIO();

    int n, m;
    cin >> n >> m;
    vector<int> val(n+1);
    for(int i=1; i<=n; i++) cin >> val[i];

    vector<vector<int> > graph(n+1);
    for(int i=0; i<m; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    for(int i=1; i<=n; i++) {
        sort(all(graph[i]), [&](int a, int b) {
            return val[a] < val[b];
        });
    }

    auto bfs = [&](int a) {
        int cnt = 1;
        ll total = val[a];
        vector<bool> vis(n+1);
        queue<int> q;
        vis[a] = 1; q.push(a);

        while(!q.empty()) {
            int u = q.front();
            q.pop();

            for(int &v : graph[u]) {
                if(vis[v] || total < val[v]) continue;
                total += val[v];
                cnt++;
                vis[v] = 1;
                q.push(v);
            }
        }

        return (cnt == n);
    };

    for(int i=1; i<=n; i++)
        cout << bfs(i);
    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Execution timed out 1024 ms 16464 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 Execution timed out 1080 ms 16444 KB Time limit exceeded
3 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 Execution timed out 1012 ms 16448 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

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