Submission #151190

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
151190	2019-09-02T04:48:35 Z	babo	Lokahian Relics (FXCUP4_lokahia)	C++17	0 / 100	3 ms	636 KB

lokahia

#include <bits/stdc++.h>
#define x first
#define y second

using namespace std;

int CollectRelics(int,int);

set<pair<int,int> >st,st2;

int FindBase(int N){
	int i;
	for(i=0;i<N;i++)
	{
		st.insert(make_pair(1,i));
	}
	while(st.size()>=2)
	{
		//printf("%d %d %d %d %d\n",st.begin()->y,next(st.begin())->y,st.begin()->x,next(st.begin())->x,CollectRelics(st.begin()->y,next(st.begin())->y));
		if(st.begin()->x==next(st.begin())->x)
		{
			if(CollectRelics(st.begin()->y,next(st.begin())->y)!=-1)
			{
				st.erase(next(st.begin()));
				st.insert(make_pair(st.begin()->x*2,st.begin()->y));
				st.erase(st.begin());	
			}
			else
			{
				st2.insert(*st.begin());
				st.erase(st.begin());
				st2.insert(*st.begin());
				st.erase(st.begin());
			}
		}
		else
		{
			st2.insert(*st.begin());
			st.erase(st.begin());
		}
	}
	if(st.empty()) return -1;
	int las=st.begin()->y;
	//printf("las %d sz %d\n",las,sz[las]);
	int ans=st.begin()->x;
	st.erase(st.begin());
	for(set<pair<int,int> >::iterator it=st2.begin();it!=st2.end();it++)
	{
		int temp=CollectRelics(las,it->y);
		if(temp!=-1)
		{
			las=temp;
			ans++;
		}
	}
	if(ans>=N%2?N/2+1:N/2)
		return las;
	return -1;
}

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	632 KB	Correct : C = 158
2	Incorrect	3 ms	632 KB	Wrong
3	Incorrect	2 ms	504 KB	Wrong
4	Incorrect	3 ms	632 KB	Wrong
5	Incorrect	3 ms	632 KB	Wrong
6	Correct	3 ms	632 KB	Correct : C = 198
7	Correct	3 ms	552 KB	Correct : C = 131
8	Correct	2 ms	632 KB	Correct : C = 271
9	Incorrect	3 ms	632 KB	Wrong
10	Correct	3 ms	636 KB	Correct : C = 272
11	Incorrect	2 ms	504 KB	Wrong
12	Incorrect	2 ms	636 KB	Wrong
13	Correct	2 ms	632 KB	Correct : C = 118
14	Correct	2 ms	504 KB	Correct : C = 163
15	Correct	2 ms	632 KB	Correct : C = 100
16	Incorrect	2 ms	632 KB	Wrong
17	Correct	2 ms	632 KB	Correct : C = 60
18	Incorrect	2 ms	632 KB	Wrong
19	Correct	3 ms	632 KB	Correct : C = 105
20	Correct	3 ms	632 KB	Correct : C = 199
21	Correct	3 ms	632 KB	Correct : C = 264
22	Correct	2 ms	504 KB	Correct : C = 0
23	Correct	2 ms	632 KB	Correct : C = 119
24	Correct	2 ms	376 KB	Correct : C = 4
25	Incorrect	3 ms	632 KB	Wrong
26	Incorrect	3 ms	632 KB	Wrong
27	Correct	2 ms	632 KB	Correct : C = 163