# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522458 | amunduzbaev | Mouse (info1cup19_mouse) | C++17 | 71 ms | 200 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 "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]]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |