oj.uz

Submission #592027

# Submission time Handle Problem Language Result Execution time Memory
592027 2022-07-08T11:52:57 Z 1zaid1 Stranded Far From Home (BOI22_island) C++17
0 / 100
 1000 ms 22924 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int M = 4e5+1;
#define int long long
vector<int> node[M];
bitset<200005> vis;
int p[M], n, d[M];

template <class T> struct better : binary_function <T,T,bool> {
  bool operator() (const T& x, const T& y) const {return p[x]>p[y];}
};
 
bool bfs(int s) {
    for (int i = 1; i <= n; i++) d[i] = vis[i] = 0;
    int sum = p[s];
    priority_queue<int, vector<int>, better<int>> q;
    vis[s] = 1;
    q.push(s);
    while (!q.empty()) {
        int t = q.top(); q.pop();
        for (int i:node[t]) {
            if (!vis[i]) {
                if (p[i] > sum) return 0;
                sum += p[i];
                vis[i] = 1;
                q.push(i);
            }
        }
    }
 
    return true;
}
 
signed main() {
    cin.tie(0)->sync_with_stdio(0);
 
    int m;
    cin >> n >> m;
 
    for (int i = 1; i <= n; i++) cin >> p[i];
    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
 
        node[a].push_back(b);
        node[b].push_back(a);
    }
 
    for (int i = 1; i <= n; i++) sort(node[i].begin(), node[i].end(),[](int a, int b) {return p[a] < p[b];});
    for (int i = 1; i <= n; i++) cout << bfs(i); cout << endl;
 
    return 0;
}
/*
4 4
2 2 4 3
1 2
1 3
2 3
3 4
 
4 3
4 2 2 1
1 2
3 2
4 1
*/

Compilation message

island.cpp: In function 'int main()':
island.cpp:51:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   51 |     for (int i = 1; i <= n; i++) cout << bfs(i); cout << endl;
      |     ^~~
island.cpp:51:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   51 |     for (int i = 1; i <= n; i++) cout << bfs(i); cout << endl;
      |                                                  ^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9680 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 5 ms 9720 KB Output is correct
4 Incorrect 136 ms 9804 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Execution timed out 1056 ms 22392 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9624 KB Output is correct
2 Execution timed out 1033 ms 22160 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9680 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 5 ms 9720 KB Output is correct
4 Incorrect 136 ms 9804 KB Output isn't correct
5 Halted 0 ms 0 KB -