Submission #737066

#TimeUsernameProblemLanguageResultExecution timeMemory
737066sandry24Cluedo (IOI10_cluedo)C++17
100 / 100
13 ms292 KiB
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
 
void Solve(){
    int ask[3] = {1, 1, 1};
    while(true){
        int ans = Theory(ask[0], ask[1], ask[2]);
        if(ans == 0)
            break;
        ask[ans-1]++;
    }
    return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...