# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432093 | 2021-06-17T20:40:49 Z | REALITYNB | Rail (IOI14_rail) | C++17 | 86 ms | 504 KB |
#include <bits/stdc++.h> #include "rail.h" using namespace std; void findLocation(int n ,int first , int* loc , int* stype){ loc[0]=first ; stype[0]=1; if(n==1) return ; vector<int> a(n) ; for(int i=0;i<n;i++) a[i]=getDistance(i,0) ; int mn = 1e9; for(int i=1;i<n;i++) mn=min(mn,a[i]) ; int second ; for(int i=1;i<n;i++) if(mn==a[i]) second=i; vector<int> b(n) ; stype[second]=2,loc[second]=first+mn; for(int i=0;i<n;i++) b[i]=getDistance(i,second); for(int i=0;i<n;i++){ if(i==second||i==0) continue ; if(a[i]>b[i]){ stype[i]=1; loc[i]=loc[second]-b[i] ; } else{ stype[i]=2; loc[i]=loc[0]+a[i]; } } return ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 376 KB | Output is correct |
4 | Correct | 1 ms | 332 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 332 KB | Output is correct |
7 | Correct | 1 ms | 332 KB | Output is correct |
8 | Correct | 1 ms | 332 KB | Output is correct |
9 | Correct | 1 ms | 332 KB | Output is correct |
10 | Correct | 1 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 376 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 332 KB | Output is correct |
7 | Correct | 1 ms | 332 KB | Output is correct |
8 | Correct | 1 ms | 332 KB | Output is correct |
9 | Correct | 1 ms | 332 KB | Output is correct |
10 | Correct | 1 ms | 352 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 86 ms | 504 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 85 ms | 496 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |