oj.uz

Submission #232674

# Submission time Handle Problem Language Result Execution time Memory
232674 2020-05-17T19:35:46 Z anubhavdhar Cluedo (IOI10_cluedo) C++14
100 / 100
 17 ms 384 KB 
#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;
	while(true)
	{
		tmp = Theory(x, y, z);
		if(tmp < 2) {if(tmp == 0) return; else ++x;} else {if(tmp == 2) ++y; else ++z;}
	}
}
/*
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;
}*/

Compilation message

cluedo.cpp: In function 'void Solve()':
cluedo.cpp:50:26: warning: unused variable 'i' [-Wunused-variable]
  int x = 1, y = 1, z = 1,i, tmp;
                          ^

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 256 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 16 ms 256 KB Output is correct
4 Correct 16 ms 256 KB Output is correct
5 Correct 16 ms 256 KB Output is correct
6 Correct 14 ms 384 KB Output is correct
7 Correct 12 ms 256 KB Output is correct
8 Correct 16 ms 128 KB Output is correct
9 Correct 14 ms 384 KB Output is correct
10 Correct 10 ms 256 KB Output is correct
11 Correct 10 ms 256 KB Output is correct
12 Correct 13 ms 256 KB Output is correct
13 Correct 11 ms 384 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 16 ms 256 KB Output is correct
16 Correct 15 ms 256 KB Output is correct
17 Correct 14 ms 256 KB Output is correct
18 Correct 12 ms 384 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 256 KB Output is correct
2 Correct 17 ms 384 KB Output is correct
3 Correct 9 ms 256 KB Output is correct
4 Correct 12 ms 384 KB Output is correct
5 Correct 13 ms 384 KB Output is correct
6 Correct 12 ms 256 KB Output is correct
7 Correct 13 ms 256 KB Output is correct
8 Correct 11 ms 256 KB Output is correct
9 Correct 15 ms 256 KB Output is correct
10 Correct 12 ms 256 KB Output is correct
11 Correct 12 ms 256 KB Output is correct
12 Correct 16 ms 256 KB Output is correct
13 Correct 17 ms 256 KB Output is correct
14 Correct 12 ms 256 KB Output is correct
15 Correct 12 ms 256 KB Output is correct
16 Correct 17 ms 256 KB Output is correct
17 Correct 10 ms 256 KB Output is correct
18 Correct 16 ms 256 KB Output is correct