Submission #376860

#	Time	Username	Problem	Language	Result	Execution time	Memory
376860		8e7	Minerals (JOI19_minerals)	C++14	80 / 100	61 ms	3456 KiB

minerals

//Challenge: Accepted
#include "minerals.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <random>
#include <time.h>
#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 solvewitha(vector<int> a, vector<int> b); //if there is still a
void solvewithb(vector<int> a, vector<int> b); //if there is still b
void solvebydel(vector<int> a, vector<int> b);
void solvebyadd(vector<int> a, vector<int> b);

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);
	solvebydel(l, r);
}

void adda(int & num, int mid, vector<int> &a, vector<int> & al, vector<int> &ar) {
	for (int i = 0;i < mid;i++) {
		num = Query(a[i]);
		al.push_back(a[i]);
	}
	for (int i = mid;i < a.size();i++) ar.push_back(a[i]);
}
void addb(int &num, vector<int> &b, vector<int> &bl, vector<int> &br, bool type) {
	//true if left of a is there, false otherwise
	for (int i = 0;i < b.size();i++) {
		int tmp = Query(b[i]);
		if ((tmp == num) == type) {
			bl.push_back(b[i]);
		} else {
			br.push_back(b[i]);
		}
		num = tmp;
	}
}
void solve2(vector<int> a, vector<int> b, bool type) { //type is true if add, false if del
	int num = Query(a[0]);
	bool res = (Query(b[0]) == num) ^ type;
	if (res) {
		Answer(a[1], b[0]);
		Answer(a[0], b[1]);
	} else {
		Answer(a[0], b[0]);
		Answer(a[1], b[1]);
	}
}
void solvewitha(vector<int> a, vector<int> b) {
	if (a.size() < 1) return;
	if (a.size() == 1) {
		//Query(a[0]);
		Answer(a[0], b[0]);
		return;
	}
	if (a.size() == 2) {
		/*
		int num = Query(a[0]);
		if (Query(b[0]) == num) {
			Answer(a[1], b[0]);
			Answer(a[0], b[1]);
		} else {
			Answer(a[0], b[0]);
			Answer(a[1], b[1]);
		}
		*/
		solve2(a, b, false);
		return;
	}
	vector<int> al, bl, ar, br;
	int num = 0, mid = (a.size() + 1) / 2;
	adda(num, mid, a, al, ar);
	addb(num, b, bl, br, false);
	solvewithb(al, bl);
	solvebydel(ar, br);
}
void solvewithb(vector<int> a, vector<int> b) {
	if (a.size() < 1) return;
	if (a.size() == 1) {
		//Query(b[0]);
		Answer(a[0], b[0]);
		return;
	}
	if (a.size() == 2) {
		solve2(a, b, true);
		return;
	}
	vector<int> al, bl, ar, br;
	int num = 0, mid = (a.size() + 1) / 2;
	adda(num, mid, a, al, ar);
	addb(num, b, bl, br, true);
	solvewitha(al, bl);
	solvebyadd(ar, br);
}

void solvebydel(vector<int> a, vector<int> b) {
	if (a.size() < 1) return;

	if (a.size() == 1) { //look here
		//Query(a[0]), Query(b[0]);
		Answer(a[0], b[0]);
		return;
	}
	if (a.size() == 2) {
		solve2(a, b, false);
		return;
	}
	vector<int> al, bl, ar, br;
	int num = 0, mid = (a.size() + 1) / 2;
	adda(num, mid, a, al, ar);
	addb(num, b, bl, br, false);

	solvebyadd(al, bl);
	solvewitha(ar, br);
}

void solvebyadd(vector<int> a, vector<int> b) {
	if (a.size() < 1) return;

	if (a.size() == 1) {
		Answer(a[0], b[0]);
		return;
	}
	if (a.size() == 2) {
		solve2(a, b, true);
		return;
	}
	vector<int> al, bl, ar, br;
	int num = 0, mid = (a.size() + 1) / 2;
	adda(num, mid, a, al, ar);
	addb(num, b, bl, br, true);

	solvebydel(al, bl);
	solvewithb(ar, br);
}
/*
4
1 5
2 6
3 4
7 8

 */

Compilation message (stderr)

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