Submission #881236

#TimeUsernameProblemLanguageResultExecution timeMemory
881236fragadmscCluedo (IOI10_cluedo)C++14
100 / 100
6 ms596 KiB
#include "grader.h" #include "cluedo.h" #include <bits/stdc++.h> using namespace std; typedef pair<long long, long long> pii; typedef pair<long long, pii> ppi; typedef long long ll; typedef long double ld; const long long MAXLOG = 29; const long long MAXN = 1e0+7; // Use com cuidado const long long MOD = 1e9 + 7; const long long inf = 1e18 + 10; #define pb push_back #define mp make_pair #define h first #define w second #define KAMEKAMEHA ios_base::sync_with_stdio(0); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define sz(x) (int)x.size() void Solve(){ vector<ll> M(8, 1), L(15, 1), W(8, 1); for(ll i=1;i<=6;i++) { for(ll j=1;j<=10;j++) { for(ll k=1;k<=6;k++) { if(M[i]==0 || L[j]==0 || W[k]==0) { continue; } ll r=Theory(i, j, k); if(r==0) { return; } else { if(r==1) { M[i]=0; } else if(r==2) { L[j]=0; } else { W[k]=0; } } } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...