Submission #446885

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
446885	2021-07-23T16:55:57 Z	JerryLiu06	Cluedo (IOI10_cluedo)	C++17	100 / 100	15 ms	200 KB

cluedo

#include <bits/stdc++.h>

#include "grader.h"
#include "cluedo.h"
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 110;
const ll INF = 1e18;

void Solve() {
    int A = 1, B = 1, C = 1; 

    while (true) {
        int cur = Theory(A, B, C); if (cur == 0) break;

        if (cur == 1) A++; else if (cur == 2) B++; else C++;
    }
}

Subtask #1

50.0 / 50.0

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

Subtask #2

50.0 / 50.0

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