oj.uz

Submission #54736

# Submission time Handle Problem Language Result Execution time Memory
54736 2018-07-04T22:56:26 Z ksun48 Park (JOI17_park) C++14
10 / 100
 908 ms 1252 KB 
#include <bits/stdc++.h>
#include "park.h"
using namespace std;

int P[1400];
int ask(int a, int b){
	if(P[a] == 0 || P[b] == 0) return 0;
	if(a == b) return 1;
	return Ask(min(a,b), max(a,b), P);
}
void solve1(int n){
	for(int i = 0; i < n; i++){
		for(int j = i+1; j < n; j++){
			P[i] = P[j] = 1;
			if(ask(i,j)){
				Answer(i, j);
			}
			P[i] = P[j] = 0;
		}
	}
}
void solvetree(vector<int> v, int n){
	if(v.size() <= 1) return;
	while(1){
		int a = v[rand() % v.size()];
		int b = v[rand() % v.size()];
		if(a >= b) continue;
		for(int i = 0; i < n; i++){
			P[i] = 0;
		}
		P[a] = P[b] = 1;
		if(ask(a,b)){
			Answer(a,b);
		}
		vector<int> v1;
		vector<int> v2;
		for(int i = 0; i < n; i++){
			P[i] = 0;
		}
		for(int x : v){
			P[x] = 1;
		}
		P[b] = 0;
		for(int x : v){
			if(ask(a, x)){
				v1.push_back(x);
			} else {
				v2.push_back(x);
			}
		}
		solvetree(v1, n);
		solvetree(v2, n);
		return;
	}
}
void solve2(int n){
	vector<int> v;
	for(int i = 0; i < n; i++){
		v.push_back(i);
	}
	solvetree(v, n);
}
void Detect(int T, int N) {
	srand(48);
	for(int i = 0; i < N; i++){
		P[i] = 0;
	}
	if(T == 1){
		solve1(N);
	} else if(T >= 2){
		solve2(N);
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 8 ms 428 KB Output is correct
4 Correct 8 ms 480 KB Output is correct
5 Correct 8 ms 484 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 23.0

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