제출 #775462

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775462		rxlfd314	Library (JOI18_library)	C++17	19 / 100	264 ms	4512 KiB

library

#include "library.h"
#include <bits/stdc++.h>
using namespace std;

void Solve(int N) {
	if (N == 1) {
		Answer(vector<int>{1});
		return;
	}
	if (N == 2) {
		Answer(vector<int>{1, 2});
		return;
	}

	vector<int> cc[N];
	for (int i = 0; i < N; i++) {
		cc[i].resize(N);
		iota(cc[i].begin(), cc[i].end(), 0);
		cc[i].erase(find(cc[i].begin(), cc[i].end(), i));
	}
	
	int ae[N], s = 0;
	for (int i = 0; i < N; i++) {
		vector<int> vec(N, 1);
		vec[i] = 0;
		ae[i] = Query(vec) < 2;
		s = ae[i] ? s : i;
	}
	
	vector<int> adj[N];
	auto findBest = [&](int i) {
		int lo = 0, hi = cc[i].size()-1;
		while (lo < hi) {
			int mid = lo + hi >> 1;
			vector<int> vec(N);
			for (int j = 0; j <= mid; j++) {
				vec[cc[i][j]] = 1;
			}
			int q = Query(vec);
			vec[i] = 1;
			q - Query(vec) < 0 ? lo = mid + 1 : hi = mid;
		}
		if (lo == cc[i].size()) return -1;
		int j = cc[i][lo];
		adj[i].push_back(j);
		adj[j].push_back(i);
		cc[j].erase(find(cc[j].begin(), cc[j].end(), i));
		cc[i].erase(find(cc[i].begin(), cc[i].end(), j));
		return j;
	};
	for (int cur = s; cur >= 0 && !ae[cur]; cur = findBest(cur));
	for (int cur = s; cur >= 0 && !ae[cur]; cur = findBest(cur));

	for (int i = 0; i < N; i++) {
		if (adj[i].size() < 2) {
			vector<int> ans(N);
			ans[0] = i;
			for (int j = 1, x = adj[i][0]; j < N; j++) {
				ans[j] = x;
				for (int k : adj[x]) {
					x = k == ans[j-1] ? x : k;
				}
			}
			for (int &j : ans) {
				j++;
			}
			Answer(ans);
			return;
		}
	}
}

컴파일 시 표준 에러 (stderr) 메시지

library.cpp: In lambda function:
library.cpp:34:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |    int mid = lo + hi >> 1;
      |              ~~~^~~~
library.cpp:43:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   if (lo == cc[i].size()) return -1;
      |       ~~~^~~~~~~~~~~~~~~

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