Submission #382091

#TimeUsernameProblemLanguageResultExecution timeMemory
382091vishesh312Cluedo (IOI10_cluedo)C++17
100 / 100
15 ms384 KiB
#include "bits/stdc++.h"
#include "grader.h"
#include "cluedo.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;

void Solve() {
    array<int, 3> a = {1, 1, 1};
    while (true) {
        int x = Theory(a[0], a[1], a[2]);
        if (x == 0) return;
        a[x-1]++;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...