# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
755667 | 2023-06-10T13:40:27 Z | VadimK | Stranded Far From Home (BOI22_island) | C++17 | 1000 ms | 25408 KB |
#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n>>m; string ans=""; int s[n+1]; vector <int> 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<int,int> > q; for (int i=1; i<=n; i++) { int total=s[i]; int v,num; bool vis[n+1]={0},can=1; q.push(make_pair(0,i)); while (!q.empty()) { tie (num,v)=q.top(); q.pop(); num*=-1; if (total<num) break; vis[v]=1; 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])); } for (int x=1; x<=n; x++) if (!vis[x]) {ans+='0'; can=0; break;} if (can==1) ans+='1'; } cout<<ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 300 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 5 ms | 724 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Execution timed out | 1068 ms | 21016 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 1076 ms | 18816 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 1060 ms | 25408 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 300 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 5 ms | 724 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |