oj.uz

답안 #423924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
423924 2021-06-11T14:11:02 Z errorgorn 카멜레온의 사랑 (JOI20_chameleon) C++17
40 / 100
 21 ms 336 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;
	
	rep(x,1,2*n+1){
		rep(y,x+1,2*n+1) if (Query({x,y})==1){
			same[x].pub(y);
			same[y].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 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Incorrect 21 ms 336 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 2 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Correct 2 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 2 ms 328 KB Output is correct
17 Correct 2 ms 328 KB Output is correct
18 Correct 2 ms 328 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 36.0

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