#include <swaps.h>
#include <algorithm>
#include <functional>
#include <vector>
#include <iostream>
using namespace std;
/*void schedule(int i, int j){
cout << "schedule " << i << " " << j << "\n";
}
vector<int> visit(){
cout << "visit\n";
int n;
cin >> n;
vector<int> ans(n);
for(int i=0; i<n; i++){
cin >> ans[i];
}
return ans;
}
void answer(vector<int>& ans){
cout << "answer: \n";
for(auto e: ans){
cout << e << " ";
}
cout << "\n";
}*/
void solve(int n, int v){
vector<int> a(n);
for(int i=0; i<n; i++){
a[i]=i+1;
}
for(int i=0; i<v; i++){
if(i%2==0){
for(int j=0; j+1<n; j+=2){
schedule(j, j+1);
}
vector<int> resp=visit();
for(int j=0; j+1<n; j+=2){
if(resp[j/2]==0) swap(a[j], a[j+1]);
}
}
else{
for(int j=1; j+1<n; j+=2){
schedule(j, j+1);
}
vector<int> resp=visit();
for(int j=1; j+1<n; j+=2){
if(resp[j/2]==0) swap(a[j], a[j+1]);
}
}
}
answer(a);
}
/*signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, v;
cin >> n >> v;
solve(n, v);
}*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |