Submission #142488

#TimeUsernameProblemLanguageResultExecution timeMemory
142488ahmetCave (IOI13_cave)C++14
12 / 100
38 ms640 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; #define ll long long #define rep(i,n) for(long long (i)=0;(i)<(n);++(i)) #define ref(i,a,b) for (long long (i)=(a); (i)<=(b); ++(i)) #define INF 0xFFFFFF #define endl '\n' #define pb push_back #define mp make_pair const unsigned int mod = 1e9+7; const int mx=5005; int s[mx],d[mx]; void exploreCave(int n){ for(int i=0;i<n;++i){ d[i]=i; int cur=tryCombination(s); if(cur==i)s[i]=1-s[i]; } answer(s,d); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...