# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521079 | LucaIlie | Mouse (info1cup19_mouse) | C++17 | 1 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 <bits/stdc++.h>
#include "grader.h"
using namespace std;
int tried[256][256];
void solve( int n ) {
int a, b, i, j, k;
vector <int> q, val, poz;
if ( n == 1 ) {
query( { 1 } );
return;
}
if ( n == 2 ) {
if ( query( { 1, 2 } ) == 0 )
query( { 2, 1 } );
return;
}
for ( i = 1; i <= n; i++ ) {
q.push_back( i );
val.push_back( -1 );
poz.push_back( -1 );
}
while ( query( q ) > 0 )
random_shuffle( q.begin(), q.end() );
/*for ( i = 0; i < n; i++ ) {
if ( val[i] == -1 ) {
for ( j = 0; j < n; j++ ) {
if ( i != j && val[j] == -1 && !tried[i][j] ) {
tried[i][j] = 1;
swap( q[i], q[j] );
a = query( q );
if ( a == 2 ) {
val[i] = q[j];
val[j] = q[i];
} else if ( a == 1 ) {
k = ((i + 1 < n && i + 1 != j) ? i + 1 : (i + 2 < n && i + 2 != j ? i + 2 : (i - 1 >= 0 && i - 1 != j ? i - 1 : i - 2)));
swap( q[i], q[k] );
a = query( q );
}
}
}
}
}*/
query( val );
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |