제출 #144647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
144647		emilem	Zagonetka (COI18_zagonetka)	C++98	9 / 100	64 ms	504 KiB

zagonetka

#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;

template<typename T>
ostream& operator<<(ostream& ostr, const vector<T>& a)
{
	for (int i = 0; i < a.size(); ++i)
		ostr << a[i] << ' ';
	return ostr;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	int n;
	cin >> n;
	vector<int> p(n);
	for (int i = 0; i < n; ++i)
		cin >> p[i];
	if (n <= 6)
	{
		for (int i = 0; i < n; ++i)
			p[i] = i + 1;
		vector<int> small, large;
		do {
			cout << "query " << p << endl;
			int res;
			cin >> res;
			if (res && small.empty())
				small = p;
			if (res)
				large = p;
		} while (next_permutation(p.begin(), p.end()));
		cout << "end\n" << small << '\n' << large << endl;
		return 0;
	}
	else
	{
		
		int res;
		set<int> possible;
		for (int i = 0; i < n; ++i)
			possible.insert(i);
		for (int i = 0; i < n; ++i)
			for (int j = i + 1; j < n; ++j)
			{
				swap(p[i], p[j]);
				cout << "query " << p << endl;
				cin >> res;
				if (res)
				{
					if (possible.count(i)) possible.erase(i);
					if (possible.count(i)) possible.erase(j);
				}
				swap(p[i], p[j]);
			}
		
		vector<int> small(n), large(n);
		for (int ii = 0; ii < n; ++ii)
			small[ii] = large[ii] = ii + 1;
		reverse(large.begin(), large.end());
		int i = *possible.begin(), j = *(++possible.begin());
		// int i = 1, j = 3;
		if (p[i] > p[j])
		{
			small[j] = small[i];
			if (small[i] == n)
				throw;
			++small[i];
			for (int k = i + 1; k < j; ++k)
				++small[k];
		}
		else
		{
			large[j] = large[i];
			--large[i];
			for (int k = i + 1; k < j; ++k)
				--large[k];
		}
		cout << "end\n" << small << '\n' << large << endl;
	}
}

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

zagonetka.cpp: In instantiation of 'std::ostream& operator<<(std::ostream&, const std::vector<T>&) [with T = int; std::ostream = std::basic_ostream<char>]':
zagonetka.cpp:31:24:   required from here
zagonetka.cpp:10:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.size(); ++i)

• Subtask 1: 9 / 9
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 51