Submission #1139238

#TimeUsernameProblemLanguageResultExecution timeMemory
1139238daveleCombo (IOI18_combo)C++20
0 / 100
0 ms408 KiB
#ifndef davele #include "combo.h" #endif // davele #include <bits/stdc++.h> #define pq priority_queue // #define int long long #define ll long long #define pii pair<int, int> #define fi first #define se second #define pb push_back #define MASK(i) (1ll<<(i)) #define next __next #define pos __pos using namespace std; const double PI = acos(-1); /*const int mod = ; void sub (int&a, const int&b){ a-=b; if (a<0) a+=mod; } void mul (int&a, const int&b){ a = (1ll*a*b)%mod; } void add (int&a, const int&b){ a+=b; if (a>=mod) a-=mod; }*/ bool minimize (ll&a, const ll&b){ if (a<=b) return false; a=b; return true; } bool maximize (ll&a, const ll&b){ if (a>=b) return false; a=b; return true; } //////////////////////////////////////////////////////////////////////////////////////////// #ifndef davele string guess_sequence(int N) { string p = ""; for (int i = 0; i < 4 * N; ++i) { p += 'A'; } int coins = press(p); string S = ""; for (int i = 0; i < N; ++i) { S += 'A'; } return S; } #endif // davele #ifdef davele signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); freopen(".inp", "r", stdin); freopen(".out", "w", stdout); } #endif // davele
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...