# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
400674 |
2021-05-08T13:39:53 Z |
ioi |
Traffic (IOI10_traffic) |
C++14 |
|
1 ms |
308 KB |
#include "traffic.h"
#include<bits/stdc++.h>
using namespace std ;
int LocateCentre(int N, int pp[], int S[], int D[]) {
long long sum = 0 ;
for(int i = 0 ;i < N ; i ++)
sum += pp[i];
long long mn = sum , ans = 0 ;
long long sum2 = 0 ;
for(int i = 1 ; i < N ; i ++){
sum2 += pp[i - 1];
sum -= pp[i - 1] ;
if(max(sum , sum2) < mn)
mn = max(sum , sum2) , ans = i ;
}
return ans ;
return N/2;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
308 KB |
Output is correct |
4 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
308 KB |
Output is correct |
4 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
308 KB |
Output is correct |
4 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
308 KB |
Output is correct |
4 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |