Submission #1144849

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144849		SmuggingSpun	Library (JOI18_library)	C++20	0 / 100	92 ms	412 KiB

library

#include "library.h"
#include<bits/stdc++.h>
using namespace std;
void Solve(int n){
	vector<int>M(n);
	if(n <= 200){
		vector<pair<int, int>>near(n, make_pair(-1, -1));
		for(int i = 0; i < n; i++){
			for(int j = i + 1; j < n; j++){
				fill(M.begin(), M.end(), 0);
				M[i] = M[j] = 1;
				if(Query(M) == 1){
					if(near[i].first == -1){
						near[i].first = j;
					}
					else{
						near[i].second = j;
					}
					if(near[j].first == -1){
						near[j].first = i;
					}
					else{
						near[j].second = i;
					}
				}
			}
		}
		vector<int>ans;
		for(int i = 0; i < n; i++){
			if(near[i].second == -1){
				ans.emplace_back(i);
				int pre = i;
				i = near[i].first;
				while(true){
					ans.emplace_back(i);
					if(near[i].second == -1){
						break;
					}
					int temp = i;
					i = near[i].first ^ near[i].second ^ pre;
					pre = temp;
				}
				break;
			}
		}
		Answer(ans);
	}
}

• Subtask 1: 0 / 19
• Subtask 2: 0 / 81