제출 #376740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
376740		casperwang	Minerals (JOI19_minerals)	C++14	6 / 100	15 ms	364 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]; }

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));

	deque <int> dq;
	vector <int> tmp;
	int now = 0, prev = 0;
	for (int i = 0; i < 2*N; i++) {
		int id = num[i];
		//debug(id);
		prev = now;
		now = Query(id);
		dq.push_back(id);
		if (now != prev+1) {
			while (true) {
				prev = now;
				now = Query(dq.front());
				if (now == prev-1) {
					tmp.pb(dq.front());
					dq.pop_front();
				} else {
					//debug(id, dq.front());
					Answer(id, dq.front());
					dq.pop_front();
					break;
				}
			}
		}
		for (int i : tmp) {
			dq.push_front(i);
			//debug(i);
			now = Query(i);
		}
		tmp.clear();
	}
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 25
• Subtask 3: 0 / 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