oj.uz

Submission #561371

# Submission time Handle Problem Language Result Execution time Memory
561371 2022-05-12T17:22:58 Z mircea_007 CONSUL (info1cup19_consul) C++17
85 / 100
 26 ms 208 KB 
#include <stdio.h>
#include <random>
#include "grader.h"

#define MAXN 1000
#define MAXQ 30

int viz[MAXN];

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

  say_answer( -1 );
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 7 ms 208 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 208 KB Output is correct
2 Correct 18 ms 208 KB Output is correct
3 Correct 11 ms 208 KB Output is correct
4 Correct 9 ms 208 KB Output is correct
5 Correct 22 ms 208 KB Output is correct
6 Correct 22 ms 208 KB Output is correct
7 Correct 23 ms 208 KB Output is correct
8 Correct 22 ms 208 KB Output is correct
9 Correct 22 ms 208 KB Output is correct
10 Correct 25 ms 208 KB Output is correct
11 Correct 26 ms 208 KB Output is correct
12 Correct 18 ms 208 KB Output is correct
13 Correct 22 ms 208 KB Output is correct
14 Correct 20 ms 208 KB Output is correct