oj.uz

Submission #125381

# Submission time Handle Problem Language Result Execution time Memory
125381 2019-07-05T07:16:11 Z 이온조(#3059) Park (JOI17_park) C++14
0 / 100
 2 ms 380 KB 
#include "park.h"

static int Place[1400];
void Detect(int T, int N) {
	int i;
	for(i = 0 ; i < 2 ; i++) Place[i] = 0;
	for(i = 2 ; i < N ; i++) Place[i] = 1;
	if(Ask(3, 5, Place) != 1) return;
	Answer(2, 4);
	Answer(2, 5);
	Answer(3, 4);
	Place[0] = 1;
	Place[3] = 0;
	Place[5] = 0;
	if(Ask(0, 4, Place) != 0) return;
	Answer(0, 1);
	Answer(0, 3);
	Answer(1, 4);
	Answer(1, 2);
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #5
0 / 23.0

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