# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830409 | PoonYaPat | Abracadabra (CEOI22_abracadabra) | C++14 | 3052 ms | 29052 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef tuple<int,int,int> tu;
int cnt,n,q,ans[1000005];
vector<int> v;
bool same=false;
vector<tu> qq; //time, order of array, idx of answer
void shuffle() {
vector<int> temp;
int hlf=n/2;
int l=0, r=hlf;
while (l<hlf && r<n) {
if (v[l]<v[r]) temp.push_back(v[l++]);
else temp.push_back(v[r++]);
}
while (l<hlf) temp.push_back(v[l++]);
while (r<n) temp.push_back(v[r++]);
same=true;
for (int i=0; i<n; ++i) if (temp[i]!=v[i]) same=false;
swap(temp,v);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n>>q;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |