oj.uz

Submission #400645

# Submission time Handle Problem Language Result Execution time Memory
400645 2021-05-08T12:46:44 Z ioi Traffic (IOI10_traffic) C++14
0 / 100
 2 ms 204 KB 
#include "traffic.h"
#include<bits/stdc++.h>
using namespace std ;

int LocateCentre(int N, int pp[], int S[], int D[]) {
    int mx = 1e9 + 9 ;
    mx = 0 ;
    for(int i = 0 ; i < N ; i ++)
        mx = max(mx , pp[i]);

    for(int i = 0 ; i < N ; i ++)
        if(mx == pp[i])return i ;
   return N/2;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 2 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 2 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 2 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 2 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -