#include <bits/stdc++.h>
#include "monster.h"
using namespace std;
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;
/*
const int N=1007;
int p[N];
bool Query(int a, int b)
{
if(abs(p[a]-p[b])==1) return p[a]<p[b];
else return p[a]>p[b];
}*/
vector<int>Solve(int n)
{
vector<int>V(n);
for(int i=0;i<n;i++) V[i]=i;
stable_sort(all(V),Query);
reverse(all(V));
for(int b=0;b<4;b++)
{
if(b+3<n&&Query(V[b],V[b+2])&&Query(V[b+1],V[b+3]))
{
int l=b+4;
for(int j=b+2;j+2<n;j++)
{
if(!Query(V[j],V[j+2])) break;
l++;
}
reverse(V.begin()+b,V.begin()+l);
}
}
int A=-1,B=-1;
for(int i=0;i<min(n,6);i++)
{
int c=0;
for(int j=0;j<min(n,6);j++) if(i!=j) c+=Query(V[i],V[j]);
if(c==1)
{
if(A==-1) A=i;
else B=i;
}
}
if(Query(V[A],V[B])) reverse(V.begin(),V.begin()+A+1);
else reverse(V.begin(),V.begin()+B+1);
for(int i=1;i<n;i++)
{
for(int j=i;j<n;j++)
{
if(Query(V[i-1],V[j]))
{
reverse(V.begin()+i,V.begin()+j+1);
break;
}
}
}
vector<int>ans(n,0);
for(int i=0;i<n;i++) ans[V[i]]=i;
return ans;
}
/*
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>p[i];
vector<int>V=Solve(n);
for(auto x:V) cout<<x<<" ";
cout<<endl;
return 0;
}*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
1 ms |
208 KB |
Output is correct |
| 5 |
Correct |
1 ms |
208 KB |
Output is correct |
| 6 |
Correct |
1 ms |
208 KB |
Output is correct |
| 7 |
Correct |
1 ms |
208 KB |
Output is correct |
| 8 |
Correct |
1 ms |
208 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
1 ms |
208 KB |
Output is correct |
| 11 |
Correct |
0 ms |
208 KB |
Output is correct |
| 12 |
Correct |
1 ms |
208 KB |
Output is correct |
| 13 |
Correct |
1 ms |
208 KB |
Output is correct |
| 14 |
Correct |
1 ms |
208 KB |
Output is correct |
| 15 |
Correct |
1 ms |
208 KB |
Output is correct |
| 16 |
Correct |
10 ms |
208 KB |
Output is correct |
| 17 |
Correct |
12 ms |
208 KB |
Output is correct |
| 18 |
Correct |
15 ms |
208 KB |
Output is correct |
| 19 |
Correct |
12 ms |
208 KB |
Output is correct |
| 20 |
Correct |
10 ms |
256 KB |
Output is correct |
| 21 |
Correct |
1 ms |
208 KB |
Output is correct |
| 22 |
Correct |
2 ms |
208 KB |
Output is correct |
| 23 |
Correct |
1 ms |
208 KB |
Output is correct |
| 24 |
Correct |
1 ms |
208 KB |
Output is correct |
| 25 |
Correct |
1 ms |
208 KB |
Output is correct |
| 26 |
Correct |
8 ms |
208 KB |
Output is correct |
| 27 |
Correct |
1 ms |
208 KB |
Output is correct |
| 28 |
Correct |
1 ms |
208 KB |
Output is correct |
| 29 |
Correct |
0 ms |
208 KB |
Output is correct |
| 30 |
Correct |
1 ms |
208 KB |
Output is correct |
| 31 |
Correct |
1 ms |
208 KB |
Output is correct |
| 32 |
Correct |
7 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
1 ms |
208 KB |
Output is correct |
| 5 |
Correct |
1 ms |
208 KB |
Output is correct |
| 6 |
Correct |
1 ms |
208 KB |
Output is correct |
| 7 |
Correct |
1 ms |
208 KB |
Output is correct |
| 8 |
Correct |
1 ms |
208 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
1 ms |
208 KB |
Output is correct |
| 11 |
Correct |
0 ms |
208 KB |
Output is correct |
| 12 |
Correct |
1 ms |
208 KB |
Output is correct |
| 13 |
Correct |
1 ms |
208 KB |
Output is correct |
| 14 |
Correct |
1 ms |
208 KB |
Output is correct |
| 15 |
Correct |
1 ms |
208 KB |
Output is correct |
| 16 |
Correct |
10 ms |
208 KB |
Output is correct |
| 17 |
Correct |
12 ms |
208 KB |
Output is correct |
| 18 |
Correct |
15 ms |
208 KB |
Output is correct |
| 19 |
Correct |
12 ms |
208 KB |
Output is correct |
| 20 |
Correct |
10 ms |
256 KB |
Output is correct |
| 21 |
Correct |
1 ms |
208 KB |
Output is correct |
| 22 |
Correct |
2 ms |
208 KB |
Output is correct |
| 23 |
Correct |
1 ms |
208 KB |
Output is correct |
| 24 |
Correct |
1 ms |
208 KB |
Output is correct |
| 25 |
Correct |
1 ms |
208 KB |
Output is correct |
| 26 |
Correct |
8 ms |
208 KB |
Output is correct |
| 27 |
Correct |
1 ms |
208 KB |
Output is correct |
| 28 |
Correct |
1 ms |
208 KB |
Output is correct |
| 29 |
Correct |
0 ms |
208 KB |
Output is correct |
| 30 |
Correct |
1 ms |
208 KB |
Output is correct |
| 31 |
Correct |
1 ms |
208 KB |
Output is correct |
| 32 |
Correct |
7 ms |
208 KB |
Output is correct |
| 33 |
Correct |
56 ms |
208 KB |
Output is correct |
| 34 |
Correct |
71 ms |
208 KB |
Output is correct |
| 35 |
Incorrect |
84 ms |
208 KB |
Wrong Answer [3] |
| 36 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Partially correct |
64 ms |
208 KB |
Partially correct |
| 2 |
Partially correct |
95 ms |
208 KB |
Partially correct |
| 3 |
Partially correct |
84 ms |
208 KB |
Partially correct |
| 4 |
Partially correct |
70 ms |
208 KB |
Partially correct |
| 5 |
Partially correct |
92 ms |
208 KB |
Partially correct |
| 6 |
Correct |
54 ms |
208 KB |
Output is correct |
| 7 |
Correct |
71 ms |
208 KB |
Output is correct |
| 8 |
Partially correct |
74 ms |
208 KB |
Partially correct |
| 9 |
Partially correct |
68 ms |
208 KB |
Partially correct |
| 10 |
Partially correct |
93 ms |
208 KB |
Partially correct |
| 11 |
Partially correct |
98 ms |
208 KB |
Partially correct |
| 12 |
Partially correct |
36 ms |
292 KB |
Partially correct |
| 13 |
Partially correct |
71 ms |
208 KB |
Partially correct |
| 14 |
Partially correct |
60 ms |
208 KB |
Partially correct |
| 15 |
Correct |
59 ms |
208 KB |
Output is correct |
| 16 |
Correct |
59 ms |
208 KB |
Output is correct |
| 17 |
Correct |
54 ms |
208 KB |
Output is correct |
| 18 |
Partially correct |
58 ms |
208 KB |
Partially correct |
