# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73257 | 2018-08-28T06:03:25 Z | 노영훈(#2269) | Circus (Balkan15_CIRCUS) | C++11 | 4000 ms | 380348 KB |
#include "circus.h" #include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; const int MX=100010, inf=2e9; int D[MX], X[MX], n, m; void init(int N, int M, int P[]){ n=N, m=M; for(int i=0; i<n; i++) X[i]=P[i]; sort(X, X+n); X[n]=m; for(int i=0; i<=n; i++) D[i]=inf; D[n]=0; vector<pii> G[MX]; for(int i=0; i<=n; i++) for(int j=i+1; j<=n; j++){ G[i].push_back({X[j]-X[i], j}); G[j].push_back({X[j]-X[i], i}); } priority_queue<pii, vector<pii>, greater<pii>> Q; Q.push({D[n], n}); while(!Q.empty()){ int v,d; tie(d,v)=Q.top(); Q.pop(); for(pii e:G[v]){ int x,c; tie(c,x)=e; if(c<d || D[x]<=c) continue; D[x]=c, Q.push({c,x}); } } // for(int i=0; i<n; i++) cout<<D[i]<<' '; // cout<<'\n'; } int minLength(int pos) { int res=inf; for(int i=0; i<=n; i++) if(abs(pos-X[i])>=D[i]) res=min(res, abs(pos-X[i])); return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 4050 ms | 380348 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 380348 KB | Output is correct |
2 | Correct | 5 ms | 380348 KB | Output is correct |
3 | Correct | 4 ms | 380348 KB | Output is correct |
4 | Correct | 6 ms | 380348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 380348 KB | Output is correct |
2 | Correct | 5 ms | 380348 KB | Output is correct |
3 | Correct | 4 ms | 380348 KB | Output is correct |
4 | Correct | 6 ms | 380348 KB | Output is correct |
5 | Correct | 769 ms | 380348 KB | Output is correct |
6 | Correct | 958 ms | 380348 KB | Output is correct |
7 | Correct | 831 ms | 380348 KB | Output is correct |
8 | Correct | 719 ms | 380348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 380348 KB | Output is correct |
2 | Correct | 5 ms | 380348 KB | Output is correct |
3 | Correct | 4 ms | 380348 KB | Output is correct |
4 | Correct | 6 ms | 380348 KB | Output is correct |
5 | Correct | 769 ms | 380348 KB | Output is correct |
6 | Correct | 958 ms | 380348 KB | Output is correct |
7 | Correct | 831 ms | 380348 KB | Output is correct |
8 | Correct | 719 ms | 380348 KB | Output is correct |
9 | Execution timed out | 4035 ms | 380348 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 4050 ms | 380348 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 4050 ms | 380348 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |