제출 #315015

#제출 시각아이디문제언어결과실행 시간메모리
315015casperwangCONSUL (info1cup19_consul)C++14
100 / 100
27 ms384 KiB
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

const int MAXN = 1000;
int v[MAXN+1];

void solve(int N) {
  srand(time(NULL));
  for (int i = 1; i <= N; i++)
    v[i] = -1;
  for (int i = 1; i <= 25; i++) {
    int p = rand() % N + 1;
    while (v[p] != -1) p = rand() % N + 1;
    v[p] = kth(p);
    int c = cnt(v[p]);
    if (c * 3 > N) {
      say_answer(v[p]);
      return;
    }
  }
  say_answer(-1);
  return;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...