제출 #138833

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138833		claudy	동굴 (IOI13_cave)	C++14	0 / 100	204 ms	640 KiB

cave

# include "cave.h"
//# pragma GCC optimize("Ofast,no-stack-protector")
//# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
/*
# include <ext/pb_ds/tree_policy.hpp>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/rope>
*/
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
//# define int ll
using namespace std;


// 2 : 45

int d[5005],ans[5005],used[5005];

int ask(vector<int>vec)
{
	int s[sz(vec)];
	for(int i = 0;i < sz(vec);i++) s[i] = vec[i];
	int x = tryCombination(s);
	if(x == -1) return sz(vec);
	else return x;
}

void exploreCave(int n)
{
	vector<int>lst(n,0);
	for(int i = 0;i < n;i++)
	{
		int op;
		int init = ask(lst);
		if(init == i + 1) op = 0;
		else op = 1;
		d[i] = op;
		vector<int>gg = lst;
		vector<int>pot;
		for(int j = 0;j < n;j++)
		{
			if(!used[j]) pot.pb(j);
		}
		int l = 0;
		int r = sz(pot) - 1;
		while(l < r)
		{
			int mid = l + r >> 1;
			for(int i = l;i <= mid;i++)
			{
				gg[pot[i]] = 1;
			}
			int x = ask(gg);
			for(int i = l;i <= mid;i++)
			{
				gg[pot[i]] = 0;
			}
			if(x != init) r = mid;
			else l = mid + 1;
		}
		used[pot[l]] = 1;
		lst[pot[l]] = op;
		ans[pot[l]] = i;
	}
	answer(d,ans);
}

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

cave.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 # pragma GCC optimization ("unroll-loops")
 
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:60:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int mid = l + r >> 1;
              ~~^~~

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