Submission details
Task:Optimal sort
Sender:ind1f
Submission time:2025-10-27 16:26:55 +0200
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#60.00 sdetails
#70.00 sdetails
#80.00 sdetails
#90.00 sdetails
#100.00 sdetails
#110.00 sdetails
#120.00 sdetails
#13ACCEPTED0.00 sdetails
#140.00 sdetails
#150.00 sdetails
#16ACCEPTED0.00 sdetails
#170.00 sdetails
#18ACCEPTED0.00 sdetails
#190.00 sdetails
#200.00 sdetails
#210.00 sdetails
#220.00 sdetails
#230.00 sdetails
#240.00 sdetails
#25ACCEPTED0.00 sdetails
#260.00 sdetails
#270.00 sdetails
#28ACCEPTED0.00 sdetails
#290.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#360.00 sdetails
#370.00 sdetails
#380.00 sdetails
#390.00 sdetails
#400.00 sdetails
#410.00 sdetails
#420.00 sdetails
#430.00 sdetails
#440.00 sdetails
#450.00 sdetails
#460.00 sdetails
#470.00 sdetails
#480.00 sdetails
#490.00 sdetails
#500.00 sdetails
#510.00 sdetails
#520.00 sdetails
#530.00 sdetails
#540.00 sdetails
#550.00 sdetails
#560.00 sdetails
#570.00 sdetails
#580.00 sdetails
#590.00 sdetails
#600.00 sdetails
#610.04 sdetails
#620.04 sdetails
#630.06 sdetails
#640.04 sdetails
#650.04 sdetails
#660.04 sdetails
#670.04 sdetails
#680.05 sdetails
#690.04 sdetails
#700.04 sdetails

Code

#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1e5 + 5;

struct fenwick_tree {
  int f[N];

  fenwick_tree() {
    memset(f, 0, sizeof(f));
  }

  void upd(int i, int x) {
    for (; i < N; i += i & -i) {
      f[i] = max(f[i], x);
    }
  }

  int get(int i) {
    int r = 0;
    for (; i > 0; i -= i & -i) {
      r = max(r, f[i]);
    }
    return r;
  }
};

int n;
int a[N];
fenwick_tree ft;
int f[N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  vector<int> v;
  copy(a + 1, a + n + 1, back_inserter(v));
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  for (int i = 1; i <= n; i++) {
    a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin() + 1;
    ft.upd(a[i], 1 + ft.get(a[i]));
  }
  cout << n - ft.get(N - 1) << '\n';
  return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1
14 

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
2
18 1 

correct output
1

user output
1

Test 3

Verdict: ACCEPTED

input
2
3 8 

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
3
6 13 8 

correct output
1

user output
1

Test 5

Verdict: ACCEPTED

input
3
8 6 14 

correct output
1

user output
1

Test 6

Verdict:

input
3
19 11 5 

correct output
1

user output
2

Test 7

Verdict:

input
4
17 15 16 13 

correct output
1

user output
2

Test 8

Verdict:

input
4
16 8 12 19 

correct output
2

user output
1

Test 9

Verdict:

input
4
13 18 5 15 

correct output
3

user output
2

Test 10

Verdict:

input
4
20 18 11 17 

correct output
3

user output
2

Test 11

Verdict:

input
5
17 12 15 13 11 

correct output
2

user output
3

Test 12

Verdict:

input
5
15 20 9 1 19 

correct output
4

user output
3

Test 13

Verdict: ACCEPTED

input
5
1 11 9 19 4 

correct output
2

user output
2

Test 14

Verdict:

input
5
17 2 15 6 12 

correct output
4

user output
2

Test 15

Verdict:

input
5
4 18 20 11 19 

correct output
3

user output
2

Test 16

Verdict: ACCEPTED

input
5
2 5 8 17 18 

correct output
0

user output
0

Test 17

Verdict:

input
5
19 5 7 17 18 

correct output
4

user output
1

Test 18

Verdict: ACCEPTED

input
5
2 5 9 7 16 

correct output
1

user output
1

Test 19

Verdict:

input
5
8 20 1 18 5 

correct output
2

user output
3

Test 20

Verdict:

input
5
10 8 11 3 1 

correct output
4

user output
3

Test 21

Verdict:

input
10
8 18 15 13 6 12 9 17 2 11 

correct output
6

user output
7

Test 22

Verdict:

input
10
5 7 1 19 9 20 8 3 2 15 

correct output
9

user output
6

Test 23

Verdict:

input
10
5 11 10 7 4 14 19 1 9 13 

correct output
8

user output
6

Test 24

Verdict:

input
10
17 12 2 3 18 15 9 6 11 1 

correct output
9

user output
6

Test 25

Verdict: ACCEPTED

input
10
18 13 20 12 4 5 19 15 14 11 

correct output
7

user output
7

Test 26

Verdict:

input
10
18 8 17 2 10 13 16 5 19 20 

correct output
7

user output
4

Test 27

Verdict:

input
10
3 5 18 19 17 2 1 20 8 7 

correct output
8

user output
5

Test 28

Verdict: ACCEPTED

input
10
9 7 16 5 20 2 10 15 11 6 

correct output
7

user output
7

Test 29

Verdict:

input
10
17 8 11 20 18 5 16 9 1 13 

correct output
8

user output
7

Test 30

Verdict:

input
10
5 10 11 2 1 7 3 9 18 8 

correct output
9

user output
6

Test 31

Verdict:

input
100
567896598 831327091 483130123 ...

correct output
95

user output
85

Test 32

Verdict:

input
100
253498609 556362063 442153869 ...

correct output
95

user output
83

Test 33

Verdict:

input
100
833824080 874174469 536879893 ...

correct output
96

user output
82

Test 34

Verdict:

input
100
55262494 701594610 766185388 6...

correct output
98

user output
82

Test 35

Verdict:

input
100
385222461 258813232 585406893 ...

correct output
95

user output
82

Test 36

Verdict:

input
100
528427003 520690782 556647080 ...

correct output
92

user output
80

Test 37

Verdict:

input
100
845689539 115595477 723524474 ...

correct output
95

user output
84

Test 38

Verdict:

input
100
566683130 399845016 457901037 ...

correct output
98

user output
82

Test 39

Verdict:

input
100
401801721 431563805 933290530 ...

correct output
95

user output
81

Test 40

Verdict:

input
100
941909102 224913296 697438766 ...

correct output
97

user output
83

Test 41

Verdict:

input
200
444811497 903431470 720091934 ...

correct output
191

user output
175

Test 42

Verdict:

input
200
336536656 534840541 835789078 ...

correct output
194

user output
175

Test 43

Verdict:

input
200
395789335 866736363 824087376 ...

correct output
195

user output
179

Test 44

Verdict:

input
200
238325464 289089504 743727937 ...

correct output
192

user output
174

Test 45

Verdict:

input
200
718880754 431102449 403271411 ...

correct output
197

user output
174

Test 46

Verdict:

input
200
97225921 989421484 860498340 2...

correct output
194

user output
173

Test 47

Verdict:

input
200
296729043 504301807 26318971 8...

correct output
193

user output
175

Test 48

Verdict:

input
200
903692950 776814822 973264570 ...

correct output
196

user output
171

Test 49

Verdict:

input
200
290066783 874736248 463312759 ...

correct output
192

user output
177

Test 50

Verdict:

input
200
973107823 90258367 557823872 1...

correct output
194

user output
173

Test 51

Verdict:

input
1000
592912152 847045692 284064425 ...

correct output
990

user output
941

Test 52

Verdict:

input
1000
407810678 616563051 942898335 ...

correct output
990

user output
942

Test 53

Verdict:

input
1000
618641025 671935409 944035992 ...

correct output
993

user output
940

Test 54

Verdict:

input
1000
366766968 558964810 539824828 ...

correct output
994

user output
940

Test 55

Verdict:

input
1000
307827860 66173733 860833950 9...

correct output
994

user output
943

Test 56

Verdict:

input
1000
249869917 995683003 692483481 ...

correct output
991

user output
942

Test 57

Verdict:

input
1000
955687818 719718081 43478262 6...

correct output
990

user output
939

Test 58

Verdict:

input
1000
734196441 465297605 360643915 ...

correct output
992

user output
940

Test 59

Verdict:

input
1000
851978986 549468516 638503725 ...

correct output
988

user output
940

Test 60

Verdict:

input
1000
310014536 901327171 160589368 ...

correct output
992

user output
941

Test 61

Verdict:

input
100000
614666693 269733332 88642683 5...

correct output
99989

user output
99386

Test 62

Verdict:

input
100000
272940982 811925955 61591592 5...

correct output
99992

user output
99375

Test 63

Verdict:

input
100000
620599476 742651279 318143272 ...

correct output
99989

user output
99373

Test 64

Verdict:

input
100000
848936553 838116035 936109023 ...

correct output
99983

user output
99373

Test 65

Verdict:

input
100000
480849086 599714294 875965742 ...

correct output
99984

user output
99381

Test 66

Verdict:

input
100000
888068198 739874627 942196434 ...

correct output
99987

user output
99371

Test 67

Verdict:

input
100000
169827791 713679537 698075748 ...

correct output
99986

user output
99381

Test 68

Verdict:

input
100000
636712086 376507123 906440322 ...

correct output
99987

user output
99384

Test 69

Verdict:

input
100000
300349845 13933235 833947124 8...

correct output
99985

user output
99375

Test 70

Verdict:

input
100000
200888519 710864746 665880694 ...

correct output
99985

user output
99375