oj.uz

Submission #521106

# Submission time Handle Problem Language Result Execution time Memory
521106 2022-01-31T18:43:58 Z LucaIlie Mouse (info1cup19_mouse) C++17
34 / 100
 130 ms 284 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 = 0; j < n && val[i] == -1; j++ ) {
            if ( i != j ) {
                swap( q[i], q[j] );
                a = query( q );
                if ( a == 2 ) {
                    val[i] = q[i];
                    val[j] = q[j];
                } 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 );
                    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] );
                }
                swap( q[i], q[j] );
            }
        }
    }

    query( val );
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct! Number of queries: 35
2 Correct 1 ms 200 KB Correct! Number of queries: 14
3 Correct 1 ms 200 KB Correct! Number of queries: 27
4 Correct 1 ms 284 KB Correct! Number of queries: 30
5 Correct 1 ms 200 KB Correct! Number of queries: 27
6 Correct 1 ms 200 KB Correct! Number of queries: 45

Subtask #2
21.000016 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct! Number of queries: 35
2 Correct 1 ms 200 KB Correct! Number of queries: 14
3 Correct 1 ms 200 KB Correct! Number of queries: 27
4 Correct 1 ms 284 KB Correct! Number of queries: 30
5 Correct 1 ms 200 KB Correct! Number of queries: 27
6 Correct 1 ms 200 KB Correct! Number of queries: 45
7 Correct 20 ms 200 KB Correct! Number of queries: 1300
8 Correct 18 ms 200 KB Correct! Number of queries: 1300
9 Correct 14 ms 200 KB Correct! Number of queries: 1100
10 Correct 14 ms 200 KB Correct! Number of queries: 1300
11 Correct 13 ms 200 KB Correct! Number of queries: 900
12 Correct 14 ms 200 KB Correct! Number of queries: 1200
13 Correct 15 ms 200 KB Correct! Number of queries: 1100
14 Correct 19 ms 200 KB Correct! Number of queries: 1300
15 Correct 17 ms 200 KB Correct! Number of queries: 1300
16 Correct 18 ms 200 KB Correct! Number of queries: 1300

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Correct! Number of queries: 35
2 Correct 1 ms 200 KB Correct! Number of queries: 14
3 Correct 1 ms 200 KB Correct! Number of queries: 27
4 Correct 1 ms 284 KB Correct! Number of queries: 30
5 Correct 1 ms 200 KB Correct! Number of queries: 27
6 Correct 1 ms 200 KB Correct! Number of queries: 45
7 Correct 20 ms 200 KB Correct! Number of queries: 1300
8 Correct 18 ms 200 KB Correct! Number of queries: 1300
9 Correct 14 ms 200 KB Correct! Number of queries: 1100
10 Correct 14 ms 200 KB Correct! Number of queries: 1300
11 Correct 13 ms 200 KB Correct! Number of queries: 900
12 Correct 14 ms 200 KB Correct! Number of queries: 1200
13 Correct 15 ms 200 KB Correct! Number of queries: 1100
14 Correct 19 ms 200 KB Correct! Number of queries: 1300
15 Correct 17 ms 200 KB Correct! Number of queries: 1300
16 Correct 18 ms 200 KB Correct! Number of queries: 1300
17 Runtime error 130 ms 200 KB Execution killed with signal 13
18 Halted 0 ms 0 KB -