Submission #1070015

#TimeUsernameProblemLanguageResultExecution timeMemory
1070015NeroZeinA Light Inconvenience (CEOI23_light)C++17
5 / 100
609 ms1048576 KiB
#include "light.h" #include <bits/stdc++.h> using namespace std; const int LOG = 63; int sz; int cnt; bool flag; vector<long long> indices; void prepare(){ cnt = 0; sz = 1; indices.push_back(1); } pair<long long, vector<long long>> join(long long p){ cnt++; sz += p; vector<long long> nindices; for (int i = 1; i < sz; i += 5) { nindices.push_back(i); } nindices.push_back(sz); indices = nindices; return {5 * p, indices}; } pair<long long, vector<long long>> leave(long long p){// I just need to make sure after one leave I'm able to keep the rightmost lit cnt++; sz -= p; vector<long long> nindices; for (int i = 1; i < sz; i += 5) { nindices.push_back(i); } nindices.push_back(sz); indices = nindices; return {5 * p, indices}; }
#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...