제출 #67800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
67800		tempytemptemp	Easter Eggs (info1cup17_eastereggs)	C++14	0 / 100	4 ms	768 KiB

eastereggs

/*
  We found Despacito 5 during contest (not clickbait)
*/
#include	"grader.h"
#include	<vector>
#include 	<set>
#include	<cassert>
using namespace std;

#define cl(a,b)	    memset(a,b,sizeof(a))
#define all(x)      x.begin(),x.end()
#define vec         vector
#define vi          vec<int>
#define pb          push_back
#define f(x,y,z)    for(int x=(y); x<(z); x++)
#define fd(x,y,z)   for(int x=(y); x>=(z); x--)
#define fit(x,y)    for(auto x: y)
#define pii         pair<int,int>
#define ppi         pair<pii,int>
#define f1          first
#define s2          second
#define spc			' '
#define endl		'\n'
bool checkbit(int x,int y){return (x&(1<<y));}
int setbit(int x,int y){return (x^(1<<y));}
const int dirs[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int mod=1e9+7;
const int p1=805306457;
const int p2=1610612741;
const int INF=1e9;
int n;
vi e[16+7];
bool possible[16+7];

vi chosen;
int chosenCnt;
bool chosens[16+7];
int rem;

void dfs(int root, int parent){
	chosen.pb(root);
	if(possible[root])
		chosenCnt++;
	chosens[root]=1;
	if(abs(rem-chosenCnt)<=1){
		return;
	}
	fit(child,e[root]){
		if(child==parent)	continue;
		dfs(child,root);
		if(abs(rem-chosenCnt)<=1){
			return;
		}
	}
}

int findEgg(int N, vector<pii>bridges){
	n=N;
	assert(n<=16);
	fit(x,bridges){
		e[x.f1].pb(x.s2);
		e[x.s2].pb(x.f1);
	}
	rem=n;
	while(rem>1){
		chosen.clear();
		cl(chosens,0);
		chosenCnt=0;
		for(int i=1; i<=n; i++){
			if(possible[i]){
				dfs(i,0);
				break;
			}
		}
		if(query(chosen)){
			rem=chosenCnt;
			for(int i=1; i<=n; i++)
				if(possible[i] && chosens[i]==0)
					possible[i]=0;
		}
		else{
			rem-=chosen.size();
			for(int i=0; i<chosen.size(); i++)
				possible[chosen[i]]=0;
		}
	}
	for(int i=1; i<=n; i++)
		if(possible[i])
			return i;
}

컴파일 시 표준 에러 (stderr) 메시지

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:83:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i=0; i<chosen.size(); i++)
                 ~^~~~~~~~~~~~~~
eastereggs.cpp:90:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

• Subtask 1: 0 / 40
• Subtask 2: 0 / 40
• Subtask 3: 0 / 20