# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29487 | 2017-07-19T13:19:53 Z | samir_droubi | Sightseeing (NOI14_sightseeing) | C++14 | 1239 ms | 79352 KB |
#include <bits/stdc++.h> using namespace std; int n,m,q; vector<pair<int,pair<int,int> > >e; const int mxn=(1e5)+5; int p[mxn]; int sz[mxn]; vector<int>com[mxn]; int ans[mxn]; int mn=(1e9); int find(int v) { if(v==p[v])return v; return p[v]=find(p[v]); } void merge(int x,int y) { x=find(x); y=find(y); if(x==y)return; if(find(1)==x && ans[y]==-1) { for(int i=0;i<sz[y];++i) ans[com[y][i]]=mn; } if(find(1)==y && ans[x]==-1) { for(int i=0;i<sz[x];++i) ans[com[x][i]]=mn; } if(sz[x]>sz[y])swap(x,y); sz[y]+=sz[x]; p[x]=y; for(int i=0;i<sz[x];++i) com[y].push_back(com[x][i]); com[x].clear(); sz[x]=0; } int main() { scanf("%d%d%d",&n,&m,&q); memset(ans,-1,sizeof ans); for(int i=1;i<=m;++i) { int x,y,w; scanf("%d%d%d",&x,&y,&w); e.push_back({w,{x,y}}); } for(int i=1;i<=n;++i) { sz[i]=1; p[i]=i; com[i].push_back(i); } sort(e.begin(),e.end()); for(int i=m-1;i>=0;--i) { int w=e[i].first; int x=e[i].second.first; int y=e[i].second.second; mn=w; merge(x,y); } while(q--) { int x; scanf("%d",&x); printf("%d\n",ans[x]); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5540 KB | Output is correct |
2 | Correct | 0 ms | 5540 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 5712 KB | Output is correct |
2 | Correct | 0 ms | 5540 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 8132 KB | Output is correct |
2 | Correct | 29 ms | 8056 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1239 ms | 79352 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |