Submission #944195

#	Time	Username	Problem	Language	Result	Execution time	Memory
944195		MilosMilutinovic	Chameleon's Love (JOI20_chameleon)	C++14	0 / 100	0 ms	344 KiB

chameleon

#include "chameleon.h"
#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;

template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}

ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

namespace {
	int c[105][105];
	vector<int> g[105];
}  // namespace

void Solve(int n){
	for(int i=1;i<=2*n;i++){
		for(int j=i+1;j<=2*n;j++){
			c[i][j]=c[j][i]=Query({i,j});
		}
	}
	for(int i=1;i<=2*n;i++){
		for(int j=i+1;j<=2*n;j++){
			if(c[i][j]==1){
				g[i].pb(j);
				g[j].pb(i);
			}
		}
	}
	vector<pii> res;
	for(int i=1;i<=2*n;i++){
		assert((int)g[i].size()>=1&&(int)g[i].size()<=3);
		sort(g[i].begin(),g[i].end());
		g[i].erase(unique(g[i].begin(),g[i].end()),g[i].end());
		int sz=(int)g[i].size();
		if(sz==3){
			for(int x=0;x<3;x++){
				vector<int> qv={i};
				for(int y=0;y<3;y++) if(y!=x) qv.pb(g[i][y]);
				if(Query(qv)!=1){
					res.pb(mp(min(i,g[i][x]),max(i,g[i][x])));
					break;
				}
			}
		}else if(sz==2){
			int p=-1;
			for(int x:g[i]){
				for(int y:g[x]){
					if(y==i) continue;
					if(Query({i,x,y})==1){
						p=x;
					}
				}
			}
			res.pb(mp(min(i,p),max(i,p)));
			assert(p!=-1);
		}else{
			cout<<i<<endl;
			res.pb(mp(min(i,g[i][0]),max(i,g[i][0])));
		}
	}
	sort(res.begin(),res.end());
	res.erase(unique(res.begin(),res.end()),res.end());
	for(auto&p:res) cout<<p.fi<<" "<<p.se<<endl;
	for(auto&p:res) Answer(p.fi,p.se);
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36