제출 #73198

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73198		TuGSGeReL	동굴 (IOI13_cave)	C++14	12 / 100	1277 ms	528 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
#define ll int
#define mp make_pair
#define pub push_back
#define pob pop_back
#define ss second
#define ff first
#define ext exit(0)
using namespace std;
ll i,j,ans[5001],pos[5001],ask[5001],k,l,r,lol,lel;
deque<ll>v;
void exploreCave(int n){
	for(i=0;i<n;i++){
		v.clear();
		for(j=0;j<i;j++)ask[j]=ans[j];
		for(j=i;j<n;j++){
			ask[j]=0,v.pub(j);
		}
		k=tryCombination(ask);
		if(k==-1 || k>i) lel=0;
		else lel=1;
		l=0,r=v.size()-1;
		lol=v.size()-1;
		while(l<=r){
			ll mid=(l+r)/2;
			for(j=0;j<v.size();j++){
				if(j<=mid){
					ask[v[j]]=lel;
				}
				else{
					ask[v[j]]=1-lel;
				}
			}
			k=tryCombination(ask);
			if(k==-1 || k>=i){
				lol=mid;
				r=mid-1;
			}
			else l=mid+1;
		}
		pos[v[lol]]=i;
		ans[v[lol]]=lel;
	}
	answer(ans,pos);
}

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:27:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(j=0;j<v.size();j++){
            ~^~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24