Submission #1205168

#TimeUsernameProblemLanguageResultExecution timeMemory
1205168dostsA Light Inconvenience (CEOI23_light)C++20
0 / 100
0 ms408 KiB
#include <bits/stdc++.h> #include "light.h" #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") #define int long long #define pii pair<int,int> #define vi vector<int> #define ff first #define ss second #define sp << " " << #define all(x) x.begin(),x.end() using namespace std; const int MOD = 1e9+7; int cnt = 1; int lst = 1; void prepare(){ cnt = 1; } std::pair<int, std::vector<int>> join(int p){ cnt+=p; return {cnt-1,{1,cnt}}; } std::pair<int, std::vector<int>> leave(int p){ cnt-=p; return {cnt-1,{1,cnt}}; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...