Submission #563725

#	Time	Username	Problem	Language	Result	Execution time	Memory
563725		Devigo	Zagonetka (COI18_zagonetka)	C++14	0 / 100	1 ms	208 KiB

zagonetka

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

#define pb push_back;
#define mp make_pair;

const int siz = 0;
const int mod = 0;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	vector<int> v(n);
	for(int i=0; i<n; i++) {
		cin >> v[i];
	}
	vector<int> sml = v;
	vector<int> lar = v;
	for(int i=0; i<n; i++) {
		int indi = -1, indj = -1, small = sml[i];
		for(int j=i+1; j<n; j++) {
			cout << "query";
			for(int k=0; k<n; i++) {
				if(k == i) {
					cout << " " << sml[j];
				}
				else if(k == j) {
					cout << " " << sml[i];
				}
				else {
					cout << " " << sml[k];
				}
			}
			cout << endl;
			int x; cin >> x;
			if(x == 1) {
				if(v[j] < small) {
					small = sml[j];
					indj = j; indi = i;
				}
			}
		}
		if(indi != -1) {
			swap(sml[indi],sml[indj]);
		}
	}
	for(int i=0; i<n; i++) {
		int indi = -1, indj = -1, small = lar[i];
		for(int j=i+1; j<n; j++) {
			cout << "query";
			for(int k=0; k<n; i++) {
				if(k == i) {
					cout << " " << lar[j];
				}
				else if(k == j) {
					cout << " " << lar[i];
				}
				else {
					cout << " " << lar[k];
				}
			}
			cout << endl;
			int x; cin >> x;
			if(x == 1) {
				if(v[j] > small) {
					small = lar[j];
					indj = j; indi = i;
				}
			}
		}
		if(indi != -1) {
			swap(lar[indi],lar[indj]);
		}
	}
	cout << "end" << endl;
	for(int i=0; i<n; i++) {
		cout << sml[i] << " ";
	}
	cout << endl;
	for(int i=0; i<n; i++) {
		cout << lar[i] << " ";
	}
	cout << endl;
	return 0;
}

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