oj.uz

답안 #151195

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
151195 2019-09-02T06:23:57 Z babo 로카히아 유적 (FXCUP4_lokahia) C++17
0 / 100
 17 ms 636 KB 
#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+=it->x;
		}
	}
	if(ans>=N%2?N/2+1:N/2)
		return las;
	return -1;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Correct : C = 3
2 Incorrect 3 ms 632 KB Wrong
3 Correct 2 ms 632 KB Correct : C = 135
4 Incorrect 3 ms 632 KB Wrong
5 Incorrect 2 ms 632 KB Wrong
6 Correct 3 ms 632 KB Correct : C = 103
7 Incorrect 3 ms 632 KB Wrong
8 Incorrect 3 ms 636 KB Wrong
9 Correct 3 ms 552 KB Correct : C = 100
10 Incorrect 3 ms 632 KB Wrong
11 Correct 3 ms 632 KB Correct : C = 101
12 Correct 2 ms 632 KB Correct : C = 60
13 Correct 2 ms 504 KB Correct : C = 60
14 Correct 3 ms 632 KB Correct : C = 100
15 Correct 3 ms 552 KB Correct : C = 101
16 Incorrect 2 ms 632 KB Wrong
17 Correct 2 ms 376 KB Correct : C = 0
18 Correct 17 ms 504 KB Correct : C = 150
19 Incorrect 2 ms 632 KB Wrong
20 Incorrect 3 ms 632 KB Wrong
21 Correct 3 ms 632 KB Correct : C = 101
22 Incorrect 2 ms 632 KB Wrong
23 Incorrect 3 ms 636 KB Wrong
24 Incorrect 3 ms 632 KB Wrong
25 Correct 2 ms 632 KB Correct : C = 60
26 Correct 2 ms 632 KB Correct : C = 100
27 Incorrect 3 ms 632 KB Wrong