Submission #1268367
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- int N; int A[202020]; int B[202020]; int T[202020],F[202020]; void solve() { int i,j,k,l,r,x,y; string s; cin>>N; FOR(i,N) { cin>>A[i]; B[A[i]]=i+1; } T[N]=0; F[N]=N; for(i=N-1;i>=1;i--) { if(T[i+1]==0) { if(B[i]<B[i+1]) { T[i]=0; F[i]=i; } else { T[i]=1; F[i]=i+1; } } else { if((B[F[i+1]]<B[i] && B[i]<B[i+1]) || (B[i]<B[i+1] && B[i+1]<B[F[i+1]]) || (B[i+1]<B[F[i+1]] && B[F[i+1]]<B[i])) { T[i]=T[i+1]; F[i]=F[i+1]; } else { T[i]=T[i+1]+1; F[i]=i+1; } } } cout<<T[1]<<endl; } int main(int argc,char** argv){ string s;int i; if(argc==1) ios::sync_with_stdio(false), cin.tie(0); FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin); solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Strange Sorting |
User | kmjp |
Language | C++14 (GCC 5.4.1) |
Score | 2400 |
Code Size | 1285 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 3456 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 2400 / 2400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 21 ms | 3456 KB |
in10.txt | AC | 21 ms | 3456 KB |
in11.txt | AC | 21 ms | 3456 KB |
in12.txt | AC | 21 ms | 3456 KB |
in13.txt | AC | 21 ms | 3456 KB |
in14.txt | AC | 21 ms | 3456 KB |
in15.txt | AC | 21 ms | 3456 KB |
in16.txt | AC | 21 ms | 3456 KB |
in17.txt | AC | 21 ms | 3456 KB |
in18.txt | AC | 21 ms | 3456 KB |
in19.txt | AC | 21 ms | 3456 KB |
in2.txt | AC | 21 ms | 3456 KB |
in20.txt | AC | 21 ms | 3456 KB |
in21.txt | AC | 18 ms | 3456 KB |
in22.txt | AC | 18 ms | 3456 KB |
in23.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 21 ms | 3456 KB |
in4.txt | AC | 21 ms | 3456 KB |
in5.txt | AC | 21 ms | 3456 KB |
in6.txt | AC | 21 ms | 3456 KB |
in7.txt | AC | 21 ms | 3456 KB |
in8.txt | AC | 21 ms | 3456 KB |
in9.txt | AC | 21 ms | 3456 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |