Submission #376781

#	Time	Username	Problem	Language	Result	Execution time	Memory
376781		casperwang	Minerals (JOI19_minerals)	C++14	85 / 100	67 ms	3820 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>
#define All(x) x.begin(), x.end()
#define pb emplace_back
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }
 
int pre, now;
 
void check(vector <int> A, vector <int> B, bool flagA, bool flagB) {
	if (A.size() == 1) {
		Answer(A[0], B[0]);
		return;
	}
	int len = B.size() / 2;
	vector <int> LA, RA, LB, RB;
	for (int i = 0; i < len; i++) {
		pre = now;
		now = Query(B[i]);
		LB.pb(B[i]);
	}
	for (int i = len; i < B.size(); i++) {
		RB.pb(B[i]);
	}
	for (int i = 0; i < A.size(); i++) {
		pre = now;
		now = Query(A[i]);
		if ( (!flagA && !flagB && now == pre)
	  	|| (!flagA &&  flagB && now == pre+1)
	  	|| ( flagA && !flagB && now == pre)
			|| ( flagA &&  flagB && now == pre-1)) {
			LA.pb(A[i]);
		} else {
			RA.pb(A[i]);
		}
		if (LA.size() == len && RA.size() <= len/2) {
			for (int j : RA) {
				pre = now;
				now = Query(j);
			}
			for (int j = i+1; j < A.size(); j++)
				RA.pb(A[j]);
			check(LA, LB, !flagA, !flagB);
			check(RA, RB,  flagA,  flagB);
			return;
		}
		if (RA.size() == B.size()-len && LA.size() <= len/2) {
			for (int j : LA) {
				pre = now;
				now = Query(j);
			}
			for (int j = i+1; j < A.size(); j++)
				LA.pb(A[j]);
			check(LA, LB,  flagA, !flagB);
			check(RA, RB, !flagA,  flagB);
			return;
		}
	}
	check(LA, LB, !flagA, !flagB);
	check(RA, RB, !flagA, flagB);
}
 
void Solve(int N) {
	srand(time(NULL));
 
	vector <int> num(2*N);
	for (int i = 0; i < 2*N; i++) num[i] = i+1;
	random_shuffle(All(num));
 
	vector <int> A, B;
	for (int id : num) {
		pre = now;
		now = Query(id);
		if (now != pre + 1) {
			B.pb(id);
		} else {
			A.pb(id);
		}
	}
	check(A, B, true, true);
}

Compilation message (stderr)

minerals.cpp: In function 'void check(std::vector<int>, std::vector<int>, bool, bool)':
minerals.cpp:25:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |  for (int i = len; i < B.size(); i++) {
      |                    ~~^~~~~~~~~~
minerals.cpp:28:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for (int i = 0; i < A.size(); i++) {
      |                  ~~^~~~~~~~~~
minerals.cpp:39:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |   if (LA.size() == len && RA.size() <= len/2) {
      |       ~~~~~~~~~~^~~~~~
minerals.cpp:39:37: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |   if (LA.size() == len && RA.size() <= len/2) {
      |                           ~~~~~~~~~~^~~~~~~~
minerals.cpp:44:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |    for (int j = i+1; j < A.size(); j++)
      |                      ~~^~~~~~~~~~
minerals.cpp:50:46: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |   if (RA.size() == B.size()-len && LA.size() <= len/2) {
      |                                    ~~~~~~~~~~^~~~~~~~
minerals.cpp:55:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |    for (int j = i+1; j < A.size(); j++)
      |                      ~~^~~~~~~~~~

• 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: 5 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10