oj.uz

Submission #29021

# Submission time Handle Problem Language Result Execution time Memory
29021 2017-07-18T06:26:19 Z 윤교준(#1173) Park (JOI17_park) C++11
10 / 100
 9 ms 2112 KB 
#include "park.h"
#include <bits/stdc++.h>
#define MAXN (1405)
using namespace std;

static int P[MAXN];
static int N;

static void fuck1() {
	for(int i = 0; i < N; i++) for(int j = i+1; j < N; j++) {
		P[i] = P[j] = 1;
		if(Ask(i, j, P)) Answer(i, j);
		P[i] = P[j] = 0;
	}
}
void Detect(int T, int _N) {
	N = _N;
	if(1 == T) fuck1();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2112 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 2112 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 2112 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 2112 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -