C. Chocolate Bunny
time limit per test: 1 second
memory limit per test: 256 megabytes
input: standard input
output: standard output
This is an interactive problem.
We hid from you a permutation p of length n, consisting of the elements from 1 to n. You want to guess it. To do that, you can give us 2 different indices i and j, and we will reply with pimodpj (remainder of division pi by pj).
We have enough patience to answer at most 2⋅n queries, so you should fit in this constraint. Can you do it?
As a reminder, a permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).
Input
The only line of the input contains a single integer n (1≤n≤104) — length of the permutation.
Interaction
The interaction starts with reading n.
Then you are allowed to make at most 2⋅n queries in the following way:
“? x y” (1≤x,y≤n,x≠y).
After each one, you should read an integer k, that equals pxmodpy.
When you have guessed the permutation, print a single line "! " (without quotes), followed by array p and quit.
After printing a query do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:
fflush(stdout) or cout.flush() in C++;
System.out.flush() in Java;
flush(output) in Pascal;
stdout.flush() in Python;
see documentation for other languages.
Exit immediately after receiving “-1” and you will see Wrong answer verdict. Otherwise you can get an arbitrary verdict because your solution will continue to read from a closed stream.
Hack format
In the first line output n (1≤n≤104). In the second line print the permutation of n integers p1,p2,…,pn.
Example
Input
3
1
2
1
0
Output
? 1 2
? 3 2
? 1 3
? 2 1
! 1 3 2
【思路分析】
思维。对于两个数a,b,若a%b<b%a,则b=b%a;若a%b>b%a,则a=a%b。
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1] = {0};
int visited[n + 1] = {0};
set<int> s;
for (int i = 1; i <= n; ++i) s.insert(i);
if (n == 1) {
cout << "! 1" << endl;
return 0;
}
for (int x = 1, y = 2; x <= n && y <= n; ) {
cout << "? " << x << " " << y << endl;
cout.flush();
int res1;
cin >> res1;
cout << "? " << y << " " << x << endl;
cout.flush();
int res2;
cin >> res2;
if (res1 > res2) {
arr[x] = res1;
visited[x] = 1;
s.erase(res1);
while (x <= n && visited[x]) ++x;
if (x == y) ++x;
} else {
arr[y] = res2;
visited[y] = 1;
s.erase(res2);
while (y <= n && visited[y]) ++y;
if (y == x) ++y;
}
}
int num = *s.begin();
for (int i = 1; i <= n; ++i) {
if (visited[i] == 0) arr[i] = num;
}
cout << "! ";
for (int i = 1; i <= n; ++i) {
cout << arr[i] << " ";
}
cout << endl;
cout.flush();
return 0;
}