oj.uz

Submission #247294

# Submission time Handle Problem Language Result Execution time Memory
247294 2020-07-11T08:38:34 Z oolimry Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 9 ms 896 KB 
#include "lokahia.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;

int p[205];
int sz[205];

int findSet(int u){
  if(u == p[u]) return u;
  else return findSet(p[u]);
}

int SZ(int u){ return sz[findSet(u)]; }

void unionSet(int u, int P){
  u = findSet(u), P = findSet(P);
  p[u] = P;
  sz[P] += sz[u];
}

int FindBase(int N){
  srand(time(NULL));
  vector<int> v;

  if(N == 1){
    return 0;
  }

  for(int i = 0;i < N;i++) v.push_back(i);

  for(int i = 0;i < N;i++){
    p[i] = i;
    sz[i] = 1;
  }

  int cnt = 0;
  map<int,int> occur;
  
  vector<int> P;
  for(int i = 0;i < N;i++){
	for(int j = 0;j < i+2;j++) P.push_back(i);  
  }
  
  while(cnt < 200){
    int a = P[rand() % P.size()], b = P[rand() % P.size()];
    if(a == b) continue;
    
    

    cnt++;
    int x = CollectRelics(a,b);
    occur[x]++;
  }

  int best = 0;
  for(int i = 0;i < N;i++){
    if(occur[best] < occur[i]){
      best = i;
    }
  }

  int total = 0;
  for(int i = 0;i < N;i++){
    if(i == best){
      total++;
      continue;
    }

    if(CollectRelics(i,best) != -1) total++;
  }

  //cout << best;
  if(total > (N/2)) return best;
  //assert(false);
  //cout << best;
  return -1;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 5 ms 896 KB Partially correct : C = 399
2 Partially correct 6 ms 896 KB Partially correct : C = 398
3 Partially correct 5 ms 640 KB Partially correct : C = 318
4 Partially correct 7 ms 896 KB Partially correct : C = 398
5 Partially correct 6 ms 896 KB Partially correct : C = 399
6 Partially correct 6 ms 640 KB Partially correct : C = 319
7 Partially correct 5 ms 896 KB Partially correct : C = 399
8 Partially correct 6 ms 896 KB Partially correct : C = 399
9 Partially correct 6 ms 872 KB Partially correct : C = 399
10 Incorrect 5 ms 896 KB Wrong
11 Incorrect 5 ms 640 KB Wrong
12 Partially correct 5 ms 640 KB Partially correct : C = 319
13 Partially correct 6 ms 896 KB Partially correct : C = 398
14 Correct 5 ms 512 KB Correct : C = 0
15 Partially correct 7 ms 896 KB Partially correct : C = 398
16 Partially correct 6 ms 872 KB Partially correct : C = 398
17 Partially correct 9 ms 896 KB Partially correct : C = 398
18 Correct 5 ms 512 KB Correct : C = 204
19 Partially correct 5 ms 640 KB Partially correct : C = 318
20 Partially correct 6 ms 896 KB Partially correct : C = 398
21 Partially correct 5 ms 640 KB Partially correct : C = 318
22 Partially correct 5 ms 896 KB Partially correct : C = 399
23 Partially correct 5 ms 640 KB Partially correct : C = 318
24 Partially correct 6 ms 640 KB Partially correct : C = 319
25 Partially correct 5 ms 640 KB Partially correct : C = 319
26 Partially correct 6 ms 896 KB Partially correct : C = 399
27 Partially correct 5 ms 640 KB Partially correct : C = 319