Submission #750190

#TimeUsernameProblemLanguageResultExecution timeMemory
750190ammar124Zalmoxis (BOI18_zalmoxis)C++14
0 / 100
1 ms260 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define endl '\n' #define ll long long #define fbo find_by_order #define ofk order_of_key using namespace std; using namespace __gnu_pbds; template<class T> using indexed_set = tree<T,null_type,less<T>,rb_tree_tag, tree_order_statistics_node_update>; ll power(ll a, ll b) { ll ans = 1; while (b) { if (b % 2) ans *= a; a *= a; b /= 2; } return ans; } int const maxin = 1e5+6; ll const mod = 1e9+7; int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...