제출 #232672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
232672		anubhavdhar	Cluedo (IOI10_cluedo)	C++14	0 / 100	5 ms	384 KiB

cluedo

#include<bits/stdc++.h>
 
#include "cluedo.h"
#include "grader.h"
 
#define ll long long int
#define pb push_back
#define mp make_pair
#define FOR(i,n) for(i=0;i<(n);++i)
#define FORe(i,n) for(i=1;i<=(n);++i)
#define FORr(i,a,b) for(i=(a);i<(b);++i)
#define FORrev(i,n) for(i=(n);i>=0;--i)
#define ii pair<ll,ll>
#define vi vector<ll>
#define vii vector<ii>
#define ff first 
#define ss second
#define cd complex<double>
#define vcd vector<cd>
#define ldd long double
#define dbgLine cout<<"Line : "<<__LINE__<<'\n'
#define all(x) (x).begin(),(x).end()
 
using namespace std;
/*
const short int __PRECISION = 10;
 
const ll MOD = 1e9+7;
const ll INF = 1e17 + 1101;
const ll LOGN = 17;
const ll MAXN = 2e5+5;
const ll ROOTN = 320;
 
const ldd PI = acos(-1);
const ldd EPS = 1e-7;
 
int aa,bb,cc;
 
int THEORY(int a, int b, int c)
{
	if(a != aa)	return 1;
	if(b != bb) return 2;
	if(c != cc) return 3;
	cout<<"done\n";
	return 0;
}*/
 
void Solve()
{
	int x = 1, y = 1, z = 1,i, tmp;
	FORe(i,6)
	{
		tmp = Theory(x, y, i);
		if(tmp == 0)	return;
		if(tmp < 2)	{z = i; break;}	
	}
	FORe(i,10)
	{
		tmp = Theory(x, i, z);
		if(tmp == 0)	return;
		if(tmp < 1)	{y = i; break;}	
	}
 
	FORe(i,6)
		if(Theory(i, y, z) == 0)
			return;
 
}
/*
inline void test_case()
{
 
}
 
int main()
{
	
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	
	ll t;
	cin>>t;
	while(t--)
	{
		cin>>aa>>bb>>cc;
		Solve();
	}
	return 0;
}*/

• Subtask 1: 0 / 50
• Subtask 2: 0 / 50