Submission #1172194

#TimeUsernameProblemLanguageResultExecution timeMemory
1172194nicolo_010A + B (IOI24_aplusb)C++20
100 / 100
0 ms328 KiB
#pragma GCC optimize("Ofast") #include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; #define rep(i, k, n) for (int i = k; i < n; i++) #define print(vec) for (auto x : vec) cout << x << " "; cout << "\n" #define input(vec) for (int i = 0; i < vec.size(); i++) cin >> vec[i] template<typename T> using v = vector<T>; template<typename T> using pq = priority_queue<T, vector<T>, greater<T>>; const int MOD = 1e9+7; int sum(int a, int b) { return a+b; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...