제출 #376753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
376753		8e7	Minerals (JOI19_minerals)	C++14	40 / 100	32 ms	3180 KiB

minerals

//Challenge: Accepted
#include "minerals.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
int tot;

void getans(vector<int> a, vector<int> b) {
	//for (int i:a) cout << i << " ";
	//cout << endl;
	//for (int i:b) cout << i << " ";
	//cout << endl;
	//cout << endl;
	if (a.size() < 1) return;
	if (a.size() == 1) {
		Answer(a[0], b[0]);
		return;
	}
	int num = 0, mid = (a.size() + 1) / 2;
	for (int i = 0;i < mid;i++) {
		num = Query(a[i]);
	}
	vector<int> al, bl, ar, br;

	for (int i = 0;i < b.size();i++) {
		int tmp = Query(b[i]);
		if (tmp == num) {
			bl.push_back(b[i]);
		} else {
			br.push_back(b[i]);
		}
		num = tmp;
	}
	for (int i = 0;i < mid;i++) {
		Query(a[i]);
		al.push_back(a[i]);
	}
	for (int i = mid;i < a.size();i++) ar.push_back(a[i]);
	for (int i:b) Query(i);
	getans(al, bl);
	getans(ar, br);
}

void Solve(int N) {
	tot = N;
	int num = 0;
	vector<int> l, r;
	for (int i = 1;i <= 2 * N;i++) {
		int tmp = Query(i);
		if (tmp != num) l.push_back(i);
		else r.push_back(i);
		num = tmp;
	}
	for (int i = 1;i <= 2 * N;i++) Query(i);
	getans(l, r);
}
/*
4
1 5
2 6
3 4
7 8

 */

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

minerals.cpp: In function 'void getans(std::vector<int>, std::vector<int>)':
minerals.cpp:33:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for (int i = 0;i < b.size();i++) {
      |                 ~~^~~~~~~~~~
minerals.cpp:46:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |  for (int i = mid;i < a.size();i++) ar.push_back(a[i]);
      |                   ~~^~~~~~~~~~

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