oj.uz

답안 #423839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
423839 2021-06-11T13:13:58 Z oolimry 카멜레온의 사랑 (JOI20_chameleon) C++17
24 / 100
 53 ms 544 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define tern(cond, a, b) (cond ? a : b)
typedef long long lint;
typedef pair<lint,lint> ii;

vector<int> adj[1005];
int likes[1005];
int answered[1005];

void addedge(int u, int v){
	//show2(u,v);
	adj[u].push_back(v);
	adj[v].push_back(u);
}

void answer(int u, int v){
	//show3("ANS", u, v);
	if(answered[u] or answered[v]) return;
	answered[u] = 1;
	answered[v] = 1;
	Answer(u,v);
}

///claim: if A is an independent set, then A+v is independent iff query(A) < query(A+v)

vector<int> stuff[4];

vector<int> copy(vector<int> b){
	vector<int> res(sz(b));
	for(int i = 0;i < sz(b);i++) res[i] = b[i];
	return res;
}

inline bool independent(vector<int> v, int u){
	v.push_back(u);
	return (sz(v)-1 < Query(v));
}

void Solve(int n){
	for(int u = 1;u <= 2*n;u++){
		int insertplace = -1;
		int found = 0;
		for(int j = 0;j < 4;j++){
			if(stuff[j].empty()){
				if(insertplace == -1) insertplace = j;
				continue;
			}
			
			vector<int> v = copy(stuff[j]);
			
			if(found == 3 or independent(v, u)){ ///is independent set
				if(insertplace == -1) insertplace = j;
				break;
			}
						
			while(true){
				if(v.empty()) break;
				if(independent(v, u)) break;
				
				int low = -1, high = sz(v)-1;
				
				while(low != high-1){
					int mid = (low+high)/2;
					vector<int> nv;
					for(int i = 0;i <= mid;i++) nv.push_back(v[i]);
					
					if(independent(nv, u)) low = mid;
					else high = mid;
				}
				
				found++;
				addedge(u, v[high]);
				vector<int> ov;
				for(int i = high+1;i < sz(v);i++) ov.push_back(v[i]);
				swap(v,ov);
				ov.clear();
			}
		}
		
		//show2(u, insertplace);
		stuff[insertplace].push_back(u);
	}
		
	///the last stuff;
	for(int i = 1;i <= 2*n;i++){
		//if(answered[i]) continue;
		if(sz(adj[i]) == 1){
			answer(i, adj[i][0]);
			//show2(i, adj[i][0]);
		}
		else if(sz(adj[i]) == 3){
			vector<int> &v = adj[i];
			if(Query({i,v[0],v[1]}) == 1) likes[i] = v[2];
			if(Query({i,v[2],v[1]}) == 1) likes[i] = v[0];
			if(Query({i,v[0],v[2]}) == 1) likes[i] = v[1];
			//show2(i, likes[i]);
		}
		else assert(false);
	}
	
	for(int i = 1;i <= 2*n;i++){
		if(answered[i]) continue;
		for(int x : adj[i]){
			if(likes[x] != i and likes[i] != x) answer(i,x);
		}
	}
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 35 ms 424 KB Output is correct
4 Correct 29 ms 440 KB Output is correct
5 Correct 29 ms 328 KB Output is correct
6 Correct 29 ms 328 KB Output is correct
7 Correct 30 ms 328 KB Output is correct
8 Correct 32 ms 436 KB Output is correct
9 Correct 30 ms 328 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Runtime error 1 ms 456 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Runtime error 1 ms 456 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 51 ms 424 KB Output is correct
4 Correct 51 ms 428 KB Output is correct
5 Correct 52 ms 544 KB Output is correct
6 Correct 51 ms 328 KB Output is correct
7 Correct 53 ms 416 KB Output is correct
8 Correct 51 ms 328 KB Output is correct
9 Correct 50 ms 428 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 Correct 35 ms 424 KB Output is correct
4 Correct 29 ms 440 KB Output is correct
5 Correct 29 ms 328 KB Output is correct
6 Correct 29 ms 328 KB Output is correct
7 Correct 30 ms 328 KB Output is correct
8 Correct 32 ms 436 KB Output is correct
9 Correct 30 ms 328 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Runtime error 1 ms 456 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -