# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
400673 | 2021-05-08T13:37:16 Z | ioi | Traffic (IOI10_traffic) | C++14 | 1 ms | 204 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 = 1e18 , ans ; long long sum2 = 0 ; for(int i = 0 ; i < N ; i ++){ sum2 += pp[i]; sum -= pp[i] ; if(max(sum , sum2) < mn) mn = max(sum , sum2) , ans = i ; } return ans ; return N/2; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |