oj.uz

Submission #26951

# Submission time Handle Problem Language Result Execution time Memory
26951 2017-07-07T12:06:26 Z wangyenjen Park (JOI17_park) C++14
10 / 100
 9 ms 2108 KB 
// Author: Wang, Yen-Jen
#include "park.h"
#include <bits/stdc++.h>

using namespace std;

inline void subtask1(int N) {
    static int place[250];
    memset(place , 0 , sizeof(place));
    for(int i = 0; i < N; i++) {
        for(int j = i + 1; j < N; j++) {
            place[i] = 1;
            place[j] = 1;
            if(Ask(i , j , place)) Answer(i , j);
            place[i] = 0;
            place[j] = 0;
        }
    }
}

void Detect(int T , int N) {
    if(T == 1) subtask1(N);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2108 KB Output is correct
2 Correct 9 ms 2108 KB Output is correct
3 Correct 6 ms 2108 KB Output is correct
4 Correct 9 ms 2108 KB Output is correct
5 Correct 6 ms 2108 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 23.0

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