Submission #908532

#	Time	Username	Problem	Language	Result	Execution time	Memory
908532		amirhoseinfar1385	Chameleon's Love (JOI20_chameleon)	C++17	40 / 100	15 ms	596 KiB

chameleon

#include "chameleon.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000+10;
int n;
vector<int>adj[maxn];
map<pair<int,int>,int>mp;

void Solve(int N) {
  n=N;
  for(int i=1;i<=2*n;i++){
  	for(int j=i+1;j<=2*n;j++){
  		int res=Query({i,j});
  		if(res==1){
  			adj[i].push_back(j);
  			adj[j].push_back(i);
  			mp[make_pair(i,j)]=1;
  		}
  	}
  }
  for(int i=1;i<=2*n;i++){
  	if(adj[i].size()==3){
  		int res=Query({i,adj[i][0],adj[i][1]});
  		if(res==1){
  			mp[make_pair(min(i,adj[i][2]),max(i,adj[i][2]))]=0;
  		}
  		res=Query({i,adj[i][0],adj[i][2]});
  		if(res==1){
  			mp[make_pair(min(i,adj[i][1]),max(i,adj[i][1]))]=0;
  		}
  		res=Query({i,adj[i][2],adj[i][1]});
  		if(res==1){
  			mp[make_pair(min(i,adj[i][0]),max(i,adj[i][0]))]=0;
  		}
  	}
  }
  for(auto x:mp){
  	if(x.second==1){
  		Answer(x.first.first,x.first.second);
  	}
  }
}

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