Submission #522458

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
5224582022-02-05 04:18:07amunduzbaevMouse (info1cup19_mouse)C++17
100 / 100
71 ms200 KiB
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#define ar array
int n, tot;
vector<int> todo, a, B;
//~ int query(vector<int> a){
//~ assert((int)a.size() == n);
//~ int res = 0;
//~ for(int i=0;i<n;i++){
//~ res += (a[i] == B[i]);
//~ } tot++;
//~ if(tot > 2400){
//~ assert(false);
//~ }
//~ if(res == n){
//~ cout<<"YES\n";
//~ exit(0);
//~ }
//~ return res;
//~ }
int check(int x){
assert(2 * x <= (int)todo.size());
for(int i=0;i<x;i++){
swap(a[todo[i<<1]], a[todo[i<<1|1]]);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...