# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1152340 | arkanefury | Mouse (info1cup19_mouse) | C++20 | 52 ms | 424 KiB |
#include <bits/stdc++.h>
#include "grader.h"
#define pb push_back
using namespace std;
#define F first
#define sz size()
#define S second
#define in insert
#define all(v) v.begin(), v.end()
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0);
const int N = 300+5;
int n,m,k,tt,ans,sum=0,l, r, x, y, cnt, block = 448, res;
int a[N][N], b[N], c[N];
vector<int>q, v, lp;
void solve(int n){
FOR(i, 1, n, 1)q.pb(i);
while(1){
random_shuffle(all(q));
ans = query(q);
if(ans==n)return;
if(!ans)break;
}
cnt = 0;
vector<pair<int, int>>par;
vector<int>unknown;
FOR(i, 2, n, 1){
swap(q[0], q[i-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... |