oj.uz

Submission #648055

# Submission time Handle Problem Language Result Execution time Memory
648055 2022-10-05T08:20:16 Z ghostwriter Cluedo (IOI10_cluedo) C++14
100 / 100
 16 ms 276 KB 
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
void Solve(){
    int m = 1, l = 1, w = 1, cur = 0;
    WHILE(1) {
        cur = Theory(m, l, w);
        if (cur == 0) return;
        if (cur == 1) ++m;
        else if (cur == 2) ++l;
        else ++w;
    }
}
/*
2 3 4
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Subtask #1
50.0 / 50.0

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

Subtask #2
50.0 / 50.0

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