Submission #151191

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
151191	2019-09-02T04:51:58 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)
		{
			int temp=CollectRelics(st.begin()->y,next(st.begin())->y);
			if(temp!=-1)
			{
				st.erase(next(st.begin()));
				st.insert(make_pair(st.begin()->x*2,temp));
				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	Incorrect	3 ms	632 KB	Wrong
2	Incorrect	2 ms	632 KB	Wrong
3	Correct	2 ms	632 KB	Correct : C = 100
4	Incorrect	2 ms	504 KB	Wrong
5	Correct	2 ms	632 KB	Correct : C = 60
6	Correct	3 ms	632 KB	Correct : C = 101
7	Incorrect	2 ms	504 KB	Wrong
8	Correct	2 ms	504 KB	Correct : C = 60
9	Correct	2 ms	504 KB	Correct : C = 150
10	Incorrect	3 ms	632 KB	Wrong
11	Correct	3 ms	632 KB	Correct : C = 101
12	Correct	3 ms	632 KB	Correct : C = 103
13	Correct	3 ms	632 KB	Correct : C = 101
14	Correct	2 ms	504 KB	Correct : C = 135
15	Incorrect	3 ms	636 KB	Wrong
16	Correct	3 ms	632 KB	Correct : C = 100
17	Incorrect	2 ms	632 KB	Wrong
18	Incorrect	3 ms	632 KB	Wrong
19	Incorrect	3 ms	632 KB	Wrong
20	Correct	2 ms	504 KB	Correct : C = 0
21	Incorrect	2 ms	504 KB	Wrong
22	Incorrect	2 ms	504 KB	Wrong
23	Incorrect	3 ms	632 KB	Wrong
24	Correct	2 ms	504 KB	Correct : C = 60
25	Incorrect	3 ms	632 KB	Wrong
26	Correct	3 ms	632 KB	Correct : C = 100
27	Correct	2 ms	508 KB	Correct : C = 3