oj.uz

Submission #150639

# Submission time Handle Problem Language Result Execution time Memory
150639 2019-09-01T08:45:28 Z CHT를 사랑하는 모임(#3587, moonrabbit2, Retro3014, gs18115) Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 7 ms 640 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 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(CollectRelics(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(CollectRelics(tgs[i],t)!=-1)
				cnt+=szs[i];
			else
				for(int m:difs[i])
					if(CollectRelics(t,m)!=-1)
						cnt++;
		}
	}
	cout<<t<<endl;
	if(cnt>=N/2)
		return t+1;
	return-1;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 512 KB Wrong
2 Incorrect 6 ms 512 KB Wrong
3 Incorrect 6 ms 512 KB Wrong
4 Incorrect 7 ms 640 KB Wrong
5 Incorrect 6 ms 640 KB Wrong
6 Incorrect 7 ms 640 KB Wrong
7 Incorrect 5 ms 512 KB Wrong
8 Incorrect 6 ms 512 KB Wrong
9 Incorrect 6 ms 640 KB Wrong
10 Incorrect 6 ms 640 KB Wrong
11 Incorrect 6 ms 640 KB Wrong
12 Incorrect 6 ms 512 KB Wrong
13 Incorrect 6 ms 640 KB Wrong
14 Incorrect 6 ms 640 KB Wrong
15 Incorrect 7 ms 640 KB Wrong
16 Incorrect 6 ms 640 KB Wrong
17 Incorrect 6 ms 512 KB Wrong
18 Incorrect 6 ms 512 KB Wrong
19 Incorrect 6 ms 640 KB Wrong
20 Incorrect 7 ms 640 KB Wrong
21 Incorrect 7 ms 640 KB Wrong
22 Incorrect 6 ms 512 KB Wrong
23 Incorrect 6 ms 384 KB Wrong
24 Incorrect 6 ms 512 KB Wrong
25 Incorrect 6 ms 640 KB Wrong
26 Incorrect 6 ms 512 KB Wrong
27 Incorrect 6 ms 640 KB Wrong