Submission #1029855

#	Time	Username	Problem	Language	Result	Execution time	Memory
1029855		Tob	Cluedo (IOI10_cluedo)	C++14	100 / 100	9 ms	344 KiB

cluedo

#include <bits/stdc++.h>
#include "grader.h"
#include "cluedo.h"
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pii;

/*
static int M,L,W,gotit,cnt,maxcnt;

int Theory(int m, int l, int w) {
   ++cnt;
   if (m < 1 || m > 6 || l < 1 || l > 10 || w < 1 || w > 6) exit(92);
   if (rand()%2 && m != M) return 1;
   else if (rand()%2 && l != L) return 2;
   else if (rand()%2 && w != W) return 3;
   else if (m != M) return 1;
   else if (l != L) return 2;
   else if (w != W) return 3;
   gotit = 1;
   return 0;
}*/

void Solve(){
	vector <int> cur(3, 1);
	while (1) {
		int d = Theory(cur[0], cur[1], cur[2]);
		if (!d) return;
		cur[d-1]++;
	}
}
/*
int main(){
   while (3 == scanf("%d%d%d",&M,&L,&W)) {
      cnt = gotit = 0;
      Solve();
      if (cnt > maxcnt) maxcnt = cnt;
      if (!gotit) {
         printf("NO\n");
         return 91;
      }
   }
   printf("OK %d\n",maxcnt);
   return 0;
}*/

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