# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
782834 | 2023-07-14T10:11:14 Z | vjudge1 | Cyberland (APIO23_cyberland) | C++17 | 747 ms | 14340 KB |
#include <bits/stdc++.h> using namespace std; //#define int long long //#define mid (start+end)/2 //#define OYY 10000 //#define faster ios_base::sync_with_stdio(false);cin.tie(NULL); const long double OYY=100000000000000000000; double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int>y, std::vector<int> c, std::vector<int> arr){ int n=N; int m=M; int k=K; vector <pair<int,int>> v[n]; k=min(k,70); for(int i=0;i<m;i++){ int a=x[i]; int b=y[i]; int co=c[i]; v[a].push_back({b,co}); v[b].push_back({a,co}); } vector <long double> uza(n,OYY); uza[0]=0; for(int ip=0;ip<=k+2;ip++){ set <pair<long double,int>> st; for(int i=0;i<n;i++){ st.insert({uza[i],i}); } while(!st.empty()){ int node=st.begin()->second; st.erase(st.begin()); if(node==H)continue; for(int i=0;i<v[node].size();i++){ int go=v[node][i].first; int cost=v[node][i].second; if(uza[go]>uza[node]+cost){ st.erase({uza[go],go}); uza[go]=uza[node]+cost; st.insert({uza[go],go}); } } } auto ne=uza; for(int j=0;j<n;j++){ if(uza[j]<OYY/10){ if(arr[j]==0)ne[j]=0; } else if(arr[j]==2 && ip>1 && ip!=k+2){ for(int i=0;i<v[j].size();i++){ int go=v[j][i].first; int cost=v[j][i].second; ne[go]=min(ne[go],uza[j]/2+(long double)cost); } } } uza=ne; } if(uza[H]>=OYY/10){ return -1; } return uza[H]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 53 ms | 460 KB | Wrong Answer. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 256 ms | 472 KB | Correct. |
2 | Correct | 311 ms | 468 KB | Correct. |
3 | Correct | 300 ms | 504 KB | Correct. |
4 | Correct | 324 ms | 512 KB | Correct. |
5 | Correct | 310 ms | 656 KB | Correct. |
6 | Correct | 333 ms | 2104 KB | Correct. |
7 | Correct | 448 ms | 2064 KB | Correct. |
8 | Correct | 214 ms | 3936 KB | Correct. |
9 | Correct | 176 ms | 392 KB | Correct. |
10 | Correct | 172 ms | 384 KB | Correct. |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 294 ms | 480 KB | Correct. |
2 | Correct | 286 ms | 492 KB | Correct. |
3 | Correct | 269 ms | 620 KB | Correct. |
4 | Correct | 187 ms | 364 KB | Correct. |
5 | Correct | 194 ms | 392 KB | Correct. |
6 | Correct | 63 ms | 1792 KB | Correct. |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 675 ms | 10904 KB | Wrong Answer. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 254 ms | 588 KB | Correct. |
2 | Correct | 252 ms | 448 KB | Correct. |
3 | Correct | 257 ms | 488 KB | Correct. |
4 | Correct | 266 ms | 2048 KB | Correct. |
5 | Correct | 188 ms | 404 KB | Correct. |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 273 ms | 504 KB | Correct. |
2 | Correct | 214 ms | 524 KB | Correct. |
3 | Correct | 747 ms | 14340 KB | Correct. |
4 | Correct | 222 ms | 1484 KB | Correct. |
5 | Correct | 176 ms | 404 KB | Correct. |
6 | Correct | 254 ms | 508 KB | Correct. |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 251 ms | 496 KB | Wrong Answer. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 509 ms | 616 KB | Wrong Answer. |
2 | Halted | 0 ms | 0 KB | - |