oj.uz

Submission #125326

# Submission time Handle Problem Language Result Execution time Memory
125326 2019-07-05T05:45:40 Z 임유진(#3061) Park (JOI17_park) C++14
10 / 100
 8 ms 380 KB 
#include "park.h"

static int place[1400];
int N;
void Detect(int T, int N) {
	if(T != 1) return;
	for(int i = 0; i < N; i++) place[i] = 0;
	for(int i = 0; i < N; i++) for(int j = i + 1; j < N; j++) {
		place[i] = place[j] = 1;
		if(Ask(i, j, place) == 1) Answer(i, j);
		place[i] = place[j] = 0;
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 8 ms 372 KB Output is correct
3 Correct 8 ms 380 KB Output is correct
4 Correct 8 ms 376 KB Output is correct
5 Correct 8 ms 376 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 23.0

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