제출 #137974

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
137974		Mahmoud_Adel	Minerals (JOI19_minerals)	C++14	80 / 100	60 ms	3372 KiB

minerals

#include "minerals.h"
//~ #include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
const int N = 43004;
vector<int> vec1, vec2;
void dc(vector<int> v1, vector<int> v2, int bit)
{
	//~ cout << "v1 : ";
	//~ for(int i : v1) cout << i << " ";
	//~ cout << endl;
	//~ cout << "v2 : ";
	//~ for(int i : v2) cout << i << " ";
	//~ cout << endl;
	if(v1.size() == 1) {Answer(v1[0], v2[0]); return;}
	vector<int> l1(v1.begin(), v1.begin()+v1.size()/2);
	vector<int> l2(v1.begin()+v1.size()/2, v1.end());
	vector<int> r1, r2;
	int lst = 0;
	for(int i=0; i<l1.size(); i++) lst = Query(l1[i]);
	for(int i=0; i<v2.size(); i++)
	{
		int nw = Query(v2[i]);
		if(bit)
		{
			if(nw == lst) r2.push_back(v2[i]);
			else lst = nw, r1.push_back(v2[i]);
		}
		else
		{
			if(nw == lst) r1.push_back(v2[i]);
			else lst = nw, r2.push_back(v2[i]);
		}
	}
	if(l1.size()) dc(l1, r1, 1-bit);
	if(l2.size()) dc(l2, r2, bit);
}
void Solve(int n) 
{
	int lst = 0;
	for(int i=1; i<=2*n; i++)
	{
		if(lst == Query(i)) vec1.push_back(i);
		else lst++, vec2.push_back(i);
	}
	dc(vec1, vec2, 1);
}

컴파일 시 표준 에러 (stderr) 메시지

minerals.cpp: In function 'void dc(std::vector<int>, std::vector<int>, int)':
minerals.cpp:20:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<l1.size(); i++) lst = Query(l1[i]);
               ~^~~~~~~~~~
minerals.cpp:21:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<v2.size(); i++)
               ~^~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 25 / 25
• Subtask 3: 9 / 9
• Subtask 4: 30 / 30
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10