oj.uz

Submission #379460

# Submission time Handle Problem Language Result Execution time Memory
379460 2021-03-18T09:40:23 Z oolimry Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 401 ms 896 KB 
#include "lokahia.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x, y) cerr << #x << " is " << x << "," << #y << " is " << y << endl;
typedef long long lint;
typedef pair<lint,lint> ii;

int n;
vector<int> adj[205];
int vis[205];
mt19937 rng(time(NULL));

void dfs(int u){
	if(vis[u]) return;
	vis[u] = 1;
	for(int v : adj[u]){
		dfs(v);
	}
}
int go(int a){
	fill(vis,vis+n,0);
	dfs(a);
	int cnt = 0;
	for(int i = 0;i < n;i++) cnt += vis[i];
	return cnt;
}

int FindBase(int N){
	n = N;
	int qrylimit = 600;
	
	int total = 10000000;
	
	vector<int> stuff;
	for(int i = 0;i < n;i++){
		stuff.push_back(i);
		stuff.push_back(i);
		stuff.push_back(i);
		stuff.push_back(i);
		stuff.push_back(i);
		stuff.push_back(i);
		if(i >= n/2) stuff.push_back(i);
		if(i >= n/2) stuff.push_back(i);
	}
	while(qrylimit >  0 and total > 0){
		int a = stuff[rng()%sz(stuff)];
		int b = stuff[rng()%sz(stuff)];
		
		total--;
		if(a == b) continue;
		if(a <= n/3 and b <= n/3) continue;
		int x = CollectRelics(a,b); qrylimit--;
		if(x != -1){
			adj[x].push_back(a);
			adj[x].push_back(b);
			
	
			if(x != a){
				for(int i = 0;i < sz(stuff);i++){
					if(stuff[i] == a){
						swap(stuff[i], stuff.back());
						stuff.pop_back();
						break;
					}
				}
			}
			if(x != b){
				for(int i = 0;i < sz(stuff);i++){
					if(stuff[i] == b){
						swap(stuff[i], stuff.back());
						stuff.pop_back();
						break;
					}
				}
			}
			
		}
	}
		
	for(int i = 0;i < n;i++){
		if(go(i) > n/2) return i;
	}
	return -1;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 620 KB Partially correct : C = 600
2 Partially correct 1 ms 620 KB Partially correct : C = 600
3 Correct 338 ms 492 KB Correct : C = 0
4 Partially correct 2 ms 620 KB Partially correct : C = 600
5 Partially correct 1 ms 620 KB Partially correct : C = 600
6 Partially correct 2 ms 620 KB Partially correct : C = 600
7 Incorrect 2 ms 620 KB Wrong
8 Partially correct 2 ms 620 KB Partially correct : C = 600
9 Incorrect 1 ms 620 KB Wrong
10 Partially correct 1 ms 620 KB Partially correct : C = 600
11 Incorrect 2 ms 620 KB Wrong
12 Incorrect 2 ms 620 KB Wrong
13 Partially correct 1 ms 620 KB Partially correct : C = 600
14 Partially correct 337 ms 748 KB Partially correct : C = 439
15 Partially correct 2 ms 620 KB Partially correct : C = 600
16 Partially correct 2 ms 620 KB Partially correct : C = 600
17 Partially correct 2 ms 620 KB Partially correct : C = 600
18 Incorrect 2 ms 748 KB Wrong
19 Partially correct 2 ms 620 KB Partially correct : C = 600
20 Partially correct 2 ms 620 KB Partially correct : C = 600
21 Partially correct 1 ms 620 KB Partially correct : C = 600
22 Partially correct 2 ms 620 KB Partially correct : C = 600
23 Partially correct 1 ms 620 KB Partially correct : C = 600
24 Correct 401 ms 620 KB Correct : C = 18
25 Partially correct 1 ms 620 KB Partially correct : C = 600
26 Partially correct 2 ms 620 KB Partially correct : C = 600
27 Partially correct 339 ms 896 KB Partially correct : C = 438