oj.uz

Submission #561366

# Submission time Handle Problem Language Result Execution time Memory
561366 2022-05-12T17:16:15 Z mircea_007 CONSUL (info1cup19_consul) C++17
0 / 100
 12 ms 280 KB 
#include <stdio.h>
#include <random>
#include "grader.h"

#define MAXN 1000
#define MAXQ 60

void solve( int N ){
  int *viz = new int[N];
  std::mt19937 mt( clock() );
  int q = MAXQ, i, val;
  
  for( ; q-- ; ){
    while( viz[i = mt() % N] );
    viz[i] = 1;
    
    if( cnt( val = kth( i ) ) * 3 > N ){
      say_answer( val );
      delete viz;
      return;
    }
  }

  say_answer( -1 );
  delete viz;
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Wrong query format
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 280 KB Wrong query format
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 208 KB Wrong query format
2 Halted 0 ms 0 KB -