oj.uz

Submission #521113

# Submission time Handle Problem Language Result Execution time Memory
521113 2022-01-31T18:55:17 Z LucaIlie Mouse (info1cup19_mouse) C++17
0 / 100
 1 ms 200 KB 
#include <bits/stdc++.h>
#include "grader.h"
 
using namespace std;
 
void solve( int n ) {
    int a, i, j, k;
    vector <int> q, val, poz;
 
    if ( n == 1 ) {
        query( { 1 } );
        return;
    }
 
    for ( i = 1; i <= n; i++ ) {
        q.push_back( i );
        val.push_back( -1 );
        poz.push_back( -1 );
    }
 
    while ( query( q ) < n && query( q ) > 0 )
        random_shuffle( q.begin(), q.end() );
    if ( query( q ) == n )
        return;
 
    for ( i = 0; i < n; i++ ) {
        for ( j = i + 1; j < n; j++ ) {
            if ( i != j ) {
                if ( val[i] != -1 && val[j] != -1 )
                    continue;
                swap( q[i], q[j] );
                a = query( q );
                if ( a == 2 ) {
                    val[i] = q[i];
                    val[j] = q[j];
                } else if ( a == 1 ) {
                    if ( val[i] == -1 && val[j] == -1 ) {
                        k = ((i + 1 != j) ? i + 1 : (i + 2 < n ? i + 2 : i - 1));
                        swap( q[i], q[k] );
                        a = query( q );
                        if ( a == 3 ) {
                            val[i] = q[i];
                            val[j] = q[j];
                            val[k] = q[k];
                        } else if ( a == 2 )
                            val[j] = q[j];
                        else if ( a == 1 )
                            val[j] = q[j];
                        else
                            val[i] = q[k];
                        swap( q[i], q[k] );
                    } else {
                        if ( val[i] != q[i] )
                            val[j] = q[j];
                        else if ( val[j] != q[j] )
                            val[i] = q[i];
                    }
                }
                swap( q[i], q[j] );
            }
        }
    }
 
    query( val );
}

Subtask #1
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct! Number of queries: 26
2 Incorrect 1 ms 200 KB Integer -1 violates the range [1, 4]
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct! Number of queries: 26
2 Incorrect 1 ms 200 KB Integer -1 violates the range [1, 4]
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct! Number of queries: 26
2 Incorrect 1 ms 200 KB Integer -1 violates the range [1, 4]
3 Halted 0 ms 0 KB -