oj.uz

답안 #970361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970361 2024-04-26T12:18:14 Z emptypringlescan Park (JOI17_park) C++17
20 / 100
 164 ms 684 KB 
#include <bits/stdc++.h>
using namespace std;
#include "park.h"
int n;
unordered_set<long long> done;
void dnc(int a, int b){
	if(a>b) swap(a,b);
	if(done.find(a*2000+b)!=done.end()) return;
	done.insert(a*2000+b);
	assert(a!=b);
	assert(a>=0&&b>=0);
	int lo=0,hi=n,mid;
	while(lo<hi){
		mid=(lo+hi)/2;
		int place[n];
		for(int i=0; i<mid; i++) place[i]=1;
		for(int i=mid; i<n; i++) place[i]=0;
		place[a]=1; place[b]=1;
		int x=Ask(a,b,place);
		if(x) hi=mid;
		else lo=mid+1;
	}
	if(lo==0) Answer(a,b);
	else{
		dnc(a,lo-1);
		dnc(lo-1,b);
	}
}
void Detect(int t, int N){
	n=N;
	if(t==1){
		int place[n];
		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]=1;
				place[j]=1;
				int x=Ask(i,j,place);
				if(x) Answer(i,j);
				place[i]=0;
				place[j]=0;
			}
		}
	}
	else if(t==2){
		dnc(0,n-1);
	}
	else{
		for(int i=1; i<n; i++) dnc(0,i);
	}
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 6 ms 348 KB Output is correct
4 Correct 6 ms 456 KB Output is correct
5 Correct 6 ms 504 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 684 KB Output is correct
2 Correct 90 ms 600 KB Output is correct
3 Correct 75 ms 616 KB Output is correct
4 Correct 34 ms 676 KB Output is correct
5 Correct 35 ms 600 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 113 ms 596 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 84 ms 592 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 164 ms 684 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -