제출 #1169939

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1169939		Konti2	Minerals (JOI19_minerals)	C++20	6 / 100	6 ms	624 KiB

minerals

	#include "minerals.h"
	#include <bits/stdc++.h>

	using namespace std;



	void Solve(int N) {
		 srand(2137);
		 vector<int> indeksy;
		 vector<int> indeksy2;
		 for (int i = 1; i <= N; i++)
			indeksy.push_back(i);
		 for (int i = N+1; i <= 2*N; i++){
			 indeksy2.push_back(i);
		 }	
		int prev = 0;
		vector<int> wmaszynie;
		int kand = 0;
		int ilepar = 0;
		random_shuffle(indeksy.begin(), indeksy.end());
		random_shuffle(indeksy2.begin(), indeksy2.end());
		int tura = 0;
		while (indeksy.size() || indeksy2.size()){
			if (!indeksy.size() || (tura && indeksy2.size())) swap(indeksy, indeksy2);
			tura ^= 1;
			int nowe = Query(indeksy.back());
			//cerr << nowe << " " << prev << "\n";
			kand = indeksy.back();
			indeksy.pop_back();
			if (nowe == prev){
				//cerr << "wtf\n";
				while (wmaszynie.size()){
					nowe = Query(wmaszynie.back());
					if (nowe == prev){
						Answer(wmaszynie.back(), kand);
						prev = Query(kand);
						wmaszynie.pop_back();
						if (indeksy.size() && ilepar == 50 + rand()%1 ){
							random_shuffle(indeksy.begin(), indeksy.end());
							ilepar = 0;
						}
						ilepar++;
						break;
						}
					prev = nowe;
					indeksy.push_back(wmaszynie.back());
					wmaszynie.pop_back();
				}
			}
			else{
				prev = nowe;
				wmaszynie.push_back(kand);
			}
		}
	}

• 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