oj.uz

답안 #151454

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
151454 2019-09-03T09:10:25 Z babo 로카히아 유적 (FXCUP4_lokahia) C++17
0 / 100
 3 ms 640 KB 
#include <bits/stdc++.h>
#define x first
#define y second

using namespace std;

int CollectRelics(int,int);

multiset<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("sz %d , %d %d %d %d %d\n",st.size(),st.begin()->y,next(st.begin())->y,st.begin()->x,next(st.begin())->x);
		//printf(" %d\n",CollectRelics(st.begin()->y,next(st.begin())->y));
		if(st.begin()->x==next(st.begin())->x)
		{
			int temp=st.begin()->y==next(st.begin())->y?st.begin()->y:CollectRelics(st.begin()->y,next(st.begin())->y);
			if(temp!=-1)
			{
				//printf("%d\n",st.size());
				st.erase(next(st.begin()));
				st.insert(make_pair(st.begin()->x*2,temp));
				st.erase(st.begin());	
				//printf("%d\n",st.size());
			}
			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;
	int ans=st.begin()->x;
	st.erase(st.begin());
	for(multiset<pair<int,int> >::iterator it=st2.begin();it!=st2.end();it++)
	{
		int temp=las==it->y?las:CollectRelics(las,it->y);
		if(temp!=-1)
		{
			las=temp;
			ans+=it->x;
		}
	}
	if(ans>N/2)
		return las;
	return -1;
}

Compilation message

lokahia.cpp: In function 'int FindBase(int)':
lokahia.cpp:19:114: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::multiset<std::pair<int, int> >::size_type {aka long unsigned int}' [-Wformat=]
   printf("sz %d , %d %d %d %d %d\n",st.size(),st.begin()->y,next(st.begin())->y,st.begin()->x,next(st.begin())->x);
                                     ~~~~~~~~~                                                                    ^
lokahia.cpp:19:114: warning: format '%d' expects a matching 'int' argument [-Wformat=]

Subtask #1
0 / 100.0

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