# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
590903 |
2022-07-06T13:53:44 Z |
Dan4Life |
Rail (IOI14_rail) |
C++17 |
|
380 ms |
98476 KB |
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
int dis[5010][5010];
void findLocation(int n, int first, int loc[], int type[])
{
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
dis[i][j] = getDistance(i,j);
loc[0]=first, type[0]=1;
int num = 0, mn = 1000000;
for(int i = 1; i < n; i++)
if(dis[0][i]<mn) mn=dis[0][i],num=i;
loc[num] = loc[0]+mn, type[num]=2;
for(int i = 1; i < n; i++)
if(i!=num) type[i]=(dis[0][i]==dis[0][num]+dis[num][i])?1:2;
for(int i = 1; i < n; i++)
if(type[i]==2) loc[i] = loc[0]+dis[0][i];
for(int i = 1; i < n; i++)
if(type[i]==1) loc[i] = loc[0]-(dis[0][i]-dis[0][num]*2);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
724 KB |
Output is correct |
2 |
Correct |
1 ms |
724 KB |
Output is correct |
3 |
Correct |
1 ms |
724 KB |
Output is correct |
4 |
Correct |
1 ms |
724 KB |
Output is correct |
5 |
Correct |
1 ms |
724 KB |
Output is correct |
6 |
Correct |
1 ms |
724 KB |
Output is correct |
7 |
Correct |
1 ms |
724 KB |
Output is correct |
8 |
Correct |
1 ms |
724 KB |
Output is correct |
9 |
Correct |
1 ms |
724 KB |
Output is correct |
10 |
Correct |
1 ms |
724 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
724 KB |
Output is correct |
2 |
Correct |
1 ms |
772 KB |
Output is correct |
3 |
Correct |
1 ms |
772 KB |
Output is correct |
4 |
Correct |
1 ms |
724 KB |
Output is correct |
5 |
Correct |
1 ms |
724 KB |
Output is correct |
6 |
Correct |
1 ms |
828 KB |
Output is correct |
7 |
Correct |
1 ms |
724 KB |
Output is correct |
8 |
Correct |
1 ms |
724 KB |
Output is correct |
9 |
Correct |
1 ms |
724 KB |
Output is correct |
10 |
Correct |
1 ms |
772 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
380 ms |
98476 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
376 ms |
98436 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |