oj.uz

답안 #423943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
423943 2021-06-11T14:22:31 Z errorgorn 카멜레온의 사랑 (JOI20_chameleon) C++17
20 / 100
 181 ms 360 KB 
#include "chameleon.h"

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'

#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back

#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);s<e?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n;

vector<int> same[1005];
int nxt[1005];

void Solve(int N) {
	n=N;
	
	//ok we just need to find stuff in the same arrays quickly
	//since we know where the males are, we can bsta the females
	
	rep(x,1,n+1){
		while (true){
			vector<int> v;
			rep(y,n+1,2*n+1){
				bool can=true;
				for (auto &it:same[x]) if (y==it) can=false;
				if (can) v.pub(y);
			}
			
			v.pub(x);
			if (Query(v)==sz(v)) break;
			v.pob();
			
			while (sz(v)!=1){
				vector<int> l,r;
				
				rep(x,0,sz(v)/2) l.pub(v[x]);
				rep(x,sz(v)/2,sz(v)) r.pub(v[x]);
				
				l.pub(x);
				if (Query(l)==sz(l)) v=r;
				else{
					l.pob();
					v=l;
				}
			}
			
			same[x].pub(v[0]);
			same[v[0]].pub(x);
		}
	}
	
	memset(nxt,-1,sizeof(nxt));
	
	rep(x,1,2*n+1) if (sz(same[x])==3){
		if (Query({x,same[x][0],same[x][1]})==1){
			nxt[x]=same[x][2];
		}
		if (Query({x,same[x][0],same[x][2]})==1){
			nxt[x]=same[x][1];
		}
		if (Query({x,same[x][1],same[x][2]})==1){
			nxt[x]=same[x][0];
		}
	}
	
	rep(x,1,2*n+1){
		if (sz(same[x])==1){
			//cout<<x<<" "<<same[x][0]<<endl;
			if (x<same[x][0]) Answer(x,same[x][0]);
		}
		else{
			for (auto &it:same[x]) if (nxt[it]!=x && nxt[x]!=it){
				//cout<<x<<" "<<it<<endl;
				if (x<it) Answer(x,it);
			}
		}
	}
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Incorrect 181 ms 352 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Incorrect 0 ms 328 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Incorrect 0 ms 328 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 61 ms 352 KB Output is correct
4 Correct 54 ms 352 KB Output is correct
5 Correct 52 ms 328 KB Output is correct
6 Correct 53 ms 352 KB Output is correct
7 Correct 54 ms 360 KB Output is correct
8 Correct 56 ms 328 KB Output is correct
9 Correct 54 ms 356 KB Output is correct

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Incorrect 181 ms 352 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -