oj.uz

답안 #967285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967285 2024-04-21T17:32:20 Z mdobric Zagonetka (COI18_zagonetka) C++11
9 / 100
 3 ms 596 KB 
#include <bits/stdc++.h>
using namespace std;

int n, p[105];
int a[10];
vector <int> ans1, ans2;

int main (void){
	
	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> p[i];
		a[i] = i + 1;
	}
	if (n <= 6){
		do{
			cout << "query ";
			for (int i = 0; i < n; i++){
				cout << a[i] << " ";
			}
			cout << endl;
			cout.flush();
			int ans;
			cin >> ans;
			if (ans == 1){
				if (ans1.size() == 0){
					for (int i = 0; i < n; i++){
						ans1.push_back(a[i]); 
					}
				}
				ans2.clear();
				for (int i = 0; i < n; i++){
					ans2.push_back(a[i]); 
				}
			}
		}while(next_permutation(a, a + n));
		cout << "end" << endl;
		for (int i = 0; i < n; i++){
			cout << ans1[i] << " ";
		}
		cout << endl;
		cout.flush();
		for (int i = 0; i < n; i++){
			cout << ans2[i] << " ";
		}
		cout << endl;
		cout.flush();
	}
	
	
	return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 596 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -