Submission #1269853
Source Code Expand
#include <cstdio> #include <cstring> #include <iostream> using namespace std; const int N = 202020; inline char get(void) { static char buf[100000], *S = buf, *T = buf; if (S == T) { T = (S = buf) + fread(buf, 1, 100000, stdin); if (S == T) return EOF; } return *S++; } template<typename T> inline void read(T &x) { static char c; x = 0; int sgn = 0; for (c = get(); c < '0' || c > '9'; c = get()) if (c == '-') sgn = 1; for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0'; if (sgn) x = -x; } int n; int p[N], q[N]; int f[N], T[N]; inline bool Check(int a, int b, int c) { return (a < b && b < c) || (b < c && c < a) || (c < a && a < b); } int main(void) { read(n); for (int i = 1; i <= n; i++) { read(p[i]); q[p[i]] = i; } T[n] = 0; for (int i = n - 1; i; i--) { if (T[i + 1] == 0) { if (q[i] > q[i + 1]) { T[i] = 1; f[i] = i + 1; } } else { if (Check(q[f[i + 1]], q[i], q[i + 1])) { 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; }
Submission Info
Submission Time | |
---|---|
Task | F - Strange Sorting |
User | Vectorxj |
Language | C++14 (GCC 5.4.1) |
Score | 2400 |
Code Size | 1112 Byte |
Status | AC |
Exec Time | 8 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 | 8 ms | 3456 KB |
in10.txt | AC | 8 ms | 3456 KB |
in11.txt | AC | 8 ms | 3456 KB |
in12.txt | AC | 8 ms | 3456 KB |
in13.txt | AC | 8 ms | 3456 KB |
in14.txt | AC | 8 ms | 3456 KB |
in15.txt | AC | 8 ms | 3456 KB |
in16.txt | AC | 8 ms | 3456 KB |
in17.txt | AC | 8 ms | 3456 KB |
in18.txt | AC | 8 ms | 3456 KB |
in19.txt | AC | 8 ms | 3456 KB |
in2.txt | AC | 8 ms | 3456 KB |
in20.txt | AC | 8 ms | 3456 KB |
in21.txt | AC | 4 ms | 1920 KB |
in22.txt | AC | 5 ms | 3456 KB |
in23.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 8 ms | 3456 KB |
in4.txt | AC | 8 ms | 3456 KB |
in5.txt | AC | 8 ms | 3456 KB |
in6.txt | AC | 8 ms | 3456 KB |
in7.txt | AC | 8 ms | 3456 KB |
in8.txt | AC | 8 ms | 3456 KB |
in9.txt | AC | 8 ms | 3456 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |