# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
763712 |
2023-06-22T16:50:51 Z |
Ahmed57 |
Rail (IOI14_rail) |
C++17 |
|
44 ms |
468 KB |
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
void findLocation(int n,int first,int location[],int stype[]){
vector<pair<int,int>> v;
for(int i = 1;i<n;i++){
v.push_back({getDistance(0,i),i});
}
sort(v.begin(),v.end());
int x = v[0].second;
stype[0] = 1;
location[0]= first;
stype[x] = 2;
location[x] = v[0].first+first;
for(int i = 1;i<n;i++){
if(i==x)continue;
int dis1 = getDistance(0,i);
int dis2 = getDistance(x,i);
if(dis2<dis1){
stype[i] = 1;
location[i] = first-(dis2-v[0].first);
}else{
stype[i] = 2;
location[i] = first+dis1;
}
}
}
/*
int main(){
int S[] = {10,2,20,30,1};
cout<<findMaxAttraction(5,2,7,S);
}*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
0 ms |
340 KB |
Output is correct |
10 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
44 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
44 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |