oj.uz

Submission #125349

# Submission time Handle Problem Language Result Execution time Memory
125349 2019-07-05T06:30:35 Z 송준혁(#3062) Park (JOI17_park) C++14
10 / 100
 214 ms 504 KB 
#include <bits/stdc++.h>
#include "park.h"
using namespace std;

static int N;
static int A[2020];
static int Q[2020];

void Detect(int T, int n) {
    N = n;
    for (int i=0; i<N; i++) A[i] = i, Q[i] = 1;
    sort(A+1, A+N-1, [&](int x, int y){
        Q[x] = 0;
        bool ret = !Ask(0, y, Q);
        Q[x] = 1;
        return ret;
    });
    for (int i=0; i<N-1; i++) {
        if (A[i] < A[i+1]) Answer(A[i], A[i+1]);
        else Answer(A[i+1], A[i]);
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 504 KB Output is correct
2 Correct 103 ms 504 KB Output is correct
3 Correct 136 ms 496 KB Output is correct
4 Correct 163 ms 504 KB Output is correct
5 Correct 166 ms 504 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 124 ms 376 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 444 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 214 ms 476 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -