# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755677 | 2023-06-10T14:23:29 Z | VadimK | Stranded Far From Home (BOI22_island) | C++17 | 1000 ms | 14692 KB |
#include <bits/stdc++.h> #define ll long long using namespace std; int main() { int n,m; cin>>n>>m; string ans=""; ll s[n+1]; vector <ll> g[n+1]; for (int i=1; i<=n; i++) cin>>s[i]; for (int i=1; i<=m; i++) { int a,b; cin>>a>>b; g[a].push_back(b); g[b].push_back(a); } priority_queue <pair<ll,ll> > q; for (int i=1; i<=n; i++) { ll total=s[i]; ll v,num; bool vis[n+1]= {0},can=1; vis[i]=1; q.push(make_pair(0,i)); while (!q.empty()) { tie (num,v)=q.top(); q.pop(); num*=-1; if (total<num) break; total+=num; for (int j=0; j<g[v].size(); j++) if (!vis[g[v][j]]) {q.push(make_pair(-1*s[g[v][j]],g[v][j])); vis[g[v][j]]=1;} } for (int x=1; x<=n; x++) if (!vis[x]) { ans+='0'; can=0; break; } if (can==1) ans+='1'; } cout<<ans; }
Compilation message
# | 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 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 165 ms | 412 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 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 | 1081 ms | 14692 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Execution timed out | 1079 ms | 12892 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Execution timed out | 1076 ms | 14292 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 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 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 165 ms | 412 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |