oj.uz

Submission #150796

# Submission time Handle Problem Language Result Execution time Memory
150796 2019-09-01T08:56:31 Z CHT를 사랑하는 모임(#3587, moonrabbit2, Retro3014, gs18115) Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 8 ms 768 KB 
#include"lokahia.h"
#include<iostream>
#include<vector>
#include<algorithm>
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const ll inf=1e18;
int q[205][205];
int query(int x,int y)
{
	if(q[x][y]) return q[x][y]-100;
	if(q[y][x]) return q[y][x]-100;
	q[x][y]=CollectRelics(x,y)+100;
	return q[x][y]-100;
}
int FindBase(int N)
{
	int cnt=0,tgt=0;
	vector<int>tgs,szs;
	vector<vector<int> >difs;
	int i;
	for(i=0;i<N;i++)
	{
		if(cnt==0)
		{
			tgt=i;
			cnt=1;
			tgs.eb(tgt);
			szs.eb(1);
			difs.eb(vector<int>());
		}
		else
		{
			if(query(tgt,i)!=-1)
				cnt++,szs[szs.size()-1]++;
			else
				difs.back().eb(i),cnt--;
		}
	}
	int t=tgs.back();
	int n=tgs.size();
	cnt=0;
	for(i=0;i<n;i++)
	{
		if(tgs[i]==t)
			cnt+=szs[i];
		else
		{
			if(query(tgs[i],t)!=-1)
				cnt+=szs[i];
			else
				for(int m:difs[i])
					if(query(t,m)!=-1)
						cnt++;
		}
	}
	for(int i=0;i<N;i++){
		if(i!=t&&(q[i][t]||q[t][i])){
			if(q[i][t]==-1||q[t][i]==-1) continue;
			if(q[i][t]) t=q[i][t]-100;
			else t=q[t][i]-100;
			break;
		}
	}
	if(cnt>=N/2)
		return t;
	return -1;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 640 KB Correct : C = 121
2 Correct 7 ms 688 KB Correct : C = 205
3 Correct 6 ms 640 KB Correct : C = 177
4 Correct 6 ms 512 KB Correct : C = 4
5 Incorrect 7 ms 768 KB Wrong
6 Correct 7 ms 768 KB Correct : C = 297
7 Correct 6 ms 600 KB Correct : C = 119
8 Correct 6 ms 640 KB Correct : C = 198
9 Correct 6 ms 640 KB Correct : C = 167
10 Correct 7 ms 768 KB Correct : C = 204
11 Correct 6 ms 768 KB Correct : C = 298
12 Correct 6 ms 688 KB Correct : C = 177
13 Correct 6 ms 640 KB Correct : C = 126
14 Correct 7 ms 640 KB Correct : C = 201
15 Correct 5 ms 464 KB Correct : C = 0
16 Incorrect 7 ms 640 KB Wrong
17 Correct 6 ms 640 KB Correct : C = 119
18 Correct 8 ms 640 KB Correct : C = 199
19 Correct 7 ms 768 KB Correct : C = 279
20 Correct 6 ms 640 KB Correct : C = 204
21 Correct 6 ms 640 KB Correct : C = 178
22 Correct 6 ms 640 KB Correct : C = 118
23 Correct 6 ms 640 KB Correct : C = 198
24 Correct 6 ms 768 KB Correct : C = 269
25 Correct 6 ms 640 KB Correct : C = 199
26 Correct 5 ms 512 KB Correct : C = 121
27 Incorrect 7 ms 640 KB Wrong