제출 #329212

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
329212		NachoLibre	Library (JOI18_library)	C++14	0 / 100	46 ms	492 KiB

library

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

const int N = 1003;
int e[N][2];
vector<int> qv;

int ask(vector<int> v) {
	for(int i = 0; i < qv.size(); ++i) qv[i] = 0;
	for(int i = 0; i <  v.size(); ++i) qv[v[i] - 1] = 1;
	return Query(qv);
}

bool neig(vector<int> v, int x) {
	int a = ask(v);
	v.push_back(x);
	int b = ask(v);
	return(a >= b);
}

void dvd(vector<int> &v, int x) {
	int n = v.size();
	vector<int> l;
	for(int i = 0; i < n / 2; ++i) {
		l.push_back(v[i]);
	}
	if(neig(l, x)) v = l;
	else {
		l.clear();
		for(int i = n / 2; i < n; ++i) {
			l.push_back(v[i]);
		}
		v = l;
	}
}

void Solve(int n) {
	if(n == 1) {
		Answer({1});
		return;
	}
	for(int i = 0; i < n; ++i) qv.push_back(0);
	vector<int> v;
	for(int i = 2; i <= n; ++i) {
		v.push_back(i);
	}
	int dg = 1;
	while(true) {
		vector<int> u = v;
		while(u.size() > 1) {
			dvd(u, dg);
		}
		if(neig(u, dg)) {
			e[dg][0] = u[0];
			e[u[0]][1] = dg;
			dg = u[0];
			v.erase(find(v.begin(), v.end(), u[0]));
		} else {
			break;
		}
	}
	dg = 1;
	while(v.size()) {
		vector<int> u = v;
		while(u.size() > 1) {
			dvd(u, dg);
		}
		e[dg][1] = u[0];
		e[u[0]][0] = dg;
		dg = u[0];
		v.erase(find(v.begin(), v.end(), u[0]));
	}
	dg = 1;
	while(e[dg][0]) dg = e[dg][0];
	while(dg) {
		v.push_back(dg);
		dg = e[dg][1];
	}
	Answer(v);
}

/*int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	return 0;
}*/

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

library.cpp: In function 'int ask(std::vector<int>)':
library.cpp:10:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for(int i = 0; i < qv.size(); ++i) qv[i] = 0;
      |                 ~~^~~~~~~~~~~
library.cpp:11:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |  for(int i = 0; i <  v.size(); ++i) qv[v[i] - 1] = 1;
      |                 ~~^~~~~~~~~~~

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