QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#456097 | #4831. Eager Sorting | biank23 | 0 | 0ms | 0kb | C++14 | 2.2kb | 2024-06-27 10:32:57 | 2024-06-27 10:32:57 |
answer
#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define all(x) begin(x),end(x)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define forn(i,n) for(int i=0;i<int(n);i++)
#define dforsn(i,s,n) for(int i=int(n)-1;i>=int(s);i--)
#define dforn(i,n) for(int i=int(n)-1;i>=0;i--)
#define dbg(x) cerr<<#x<<": "<<x<<endl
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
//const int MAXN = 2e5+5;
//const ll INF = 1e18;
const int MOD = 1e9+7;
template<class x> ostream & operator<<(ostream & out, vector<x> v){
out<<"[ ";
for(auto y : v) out<<y<<" ";
out<<"]";
return out;
}
template<class a, class b> ostream & operator<<(ostream & out, pair<a, b> p){
return out<<"("<<p.fst<<", "<<p.snd<<")";
}
vi arr;
bool flag=true;
vi p,p2;
bool cmp(int x, int y){
if(p[x]>p[y]) swap(x,y);
cout<<p[x]+1<<' '<<p[y]+1<<endl;
int r;
if(flag) cin>>r;
else r=arr[p[x]]>arr[p[y]];
if(r==-1)exit(0);
if(r==1){
swap(arr[p[x]],arr[p[y]]);
swap(p[x],p[y]);
p2[p[x]]=x,p2[p[y]]=y;
return false;
}
return true;
}
vi merge(const vi &a, const vi &b){
int n=sz(a),m=sz(b);
vi c(n+m);
int i=0,j=0;
forn(k,n+m){
if(j>=m||(i<n&&cmp(a[i],b[j]))) c[k]=a[i++];
else c[k]=b[j++];
}
return c;
}
void merge_sort(vi &v){
int n=sz(v);
if(n<=1) return;
vi a(begin(v),begin(v)+n/2);
vi b(begin(v)+n/2,end(v));
merge_sort(a);
merge_sort(b);
v=merge(a,b);
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin>>n;
if(!flag){
arr.resize(n);
forn(i,n) cin>>arr[i];
}
vi a(n); iota(all(a),0);
p.resize(n); iota(all(p),0);
p2.resize(n); iota(all(p2),0);
merge_sort(a);
//forn(i,n) cerr<<arr[p[a[i]]]<<' ';
//cerr<<'\n';
forn(i,n) cmp(p2[i],a[i]);
//forn(i,n) cerr<<arr[i]<<' ';
//cerr<<'\n';
cout<<"-1 -1"<<endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Instance #0 Runtime Error
Interactor to First Run
5 0 1
First Run to Interactor
1 2 4 5
Interactor to Second Run
5 0 0 0 1
Second Run to Interactor
1 2 4 5 3 4 1 3
Manager to Checker
WA array is not sorted!