oj.uz

Submission #467512

# Submission time Handle Problem Language Result Execution time Memory
467512 2021-08-23T11:59:39 Z LucaIlie CONSUL (info1cup19_consul) C++17
0 / 100
 2 ms 272 KB 
//#include <stdio.h>
#include <stdlib.h>
#include <map>
#include "grader.h"

#define MAX_Q 60

using namespace std;

map <int, int> checkedPoz, checkedVal;

/*int kth( int i ) {
    int ans;

    printf( "kth %d\n", i );
    scanf( "%d", &ans );

    return ans;
}

int cnt( int x ) {
    int ans;

    printf( "cnt %d\n", x );
    scanf( "%d", &ans );

    return ans;
}

void say_answer( int ans ) {
    printf( "%d\n", ans );
}*/

void solve( int n ) {
    int q, i, x;

    checkedPoz.clear();
    checkedVal.clear();
    q = 0;
    while ( q < MAX_Q && q < n ) {
        i = rand() % n;
        if ( !checkedPoz[i] ) {
            checkedPoz[i] = 1;
            x = kth( i + 1 );
            q++;
        }

        if ( q < MAX_Q && q < n && !checkedVal[x] ) {
            checkedVal[x] = 1;
            if ( cnt( x ) > n / 3 ) {
                say_answer( q );
                return;
            }
        }
    }

    say_answer( -1 );
}

/*int main() {
    int n;

    scanf( "%d", &n );
    solve( n );

    return 0;
}*/

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 268 KB Wrong answer

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 200 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 272 KB Wrong answer
2 Halted 0 ms 0 KB -