oj.uz

Submission #981985

# Submission time Handle Problem Language Result Execution time Memory
981985 2024-05-13T17:37:48 Z nnin Sequence (APIO23_sequence) C++17
100 / 100
 674 ms 77756 KB 
#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define f first
#define s second
 
vector<int> ct[500005];
int N;
 
struct segTree {
  pii seg[4*500005];
  int lazy[4*500005];
 
  void laze(int i, int l, int r) {
    if(lazy[i]) {
      seg[i] = {seg[i].f+lazy[i], seg[i].s+lazy[i]};
      if(l!=r) {
        lazy[i*2+1] += lazy[i];
        lazy[i*2+2] += lazy[i];
      }
      lazy[i] = 0;
    }
  }
 
  void build(int i, int l, int r, int val) {
    lazy[i] = 0;
    if(l==r) {
      seg[i].f = seg[i].s = val*(l);
      return;
    }
    int m = (l+r)/2;
    build(i*2+1, l, m, val);
    build(i*2+2, m+1, r, val);
    seg[i].f = min(seg[i*2+1].f, seg[i*2+2].f);
    seg[i].s = max(seg[i*2+1].s, seg[i*2+2].s);
  }
  void build(int val) {
    build(0, 0, N, val);
  }
 
  void update(int i, int l, int r, int wl, int wr, int val) {
    if(wl<=l && wr>=r) lazy[i] += val;
    laze(i, l, r);
    if(wl>r || wr<l || (wl<=l && wr>=r)) return;
    int m = (l+r)/2;
    update(i*2+1, l, m, wl, wr, val);
    update(i*2+2, m+1, r, wl, wr, val);
    seg[i].f = min(seg[i*2+1].f, seg[i*2+2].f);
    seg[i].s = max(seg[i*2+1].s, seg[i*2+2].s);
  }
  void update(int wl, int wr, int val) {
    update(0, 0, N, wl+1, wr+1, val);
  }
 
  pii query(int i, int l, int r, int wl, int wr) {
    laze(i, l, r);
    if(wl>r || wr<l) return {(int)1e9, (int)-1e9};
    if(wl<=l && wr>=r) return seg[i];
    int m = (l+r)/2;
    pii q1 = query(i*2+1, l, m, wl, wr);
    pii q2 = query(i*2+2, m+1, r, wl, wr);
    return {min(q1.f, q2.f), max(q1.s, q2.s)};
  }
  pii query(int wl, int wr) {
    return query(0, 0, N, wl+1, wr+1);
  }
} les, mor;
 
int sequence(int n, std::vector<int> A) {
  N = n;
  for(int i=0;i<N;i++) {
    ct[A[i]].push_back(i);
  }
  int ans = 1;
  les.build(-1);
  mor.build(1);
  for(int i=1;i<=N;i++) {
    for(int j:ct[i]) {
      les.update(j, N-1, 2);
    }
    for(int j=0;j+ans<ct[i].size();j++) {
      int st = ct[i][j];
      int en = ct[i][j+ans];
      int qles = les.query(en, N-1).s - les.query(-1, st-1).f;
      int qmor = mor.query(en, N-1).s - mor.query(-1, st-1).f;
      if(qles>=0 && qmor>=0) {
        ans++; j--;
      }
    }
    for(int j:ct[i]) {
      mor.update(j, N-1, -2);
    }
  }
  return ans;
}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:82:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for(int j=0;j+ans<ct[i].size();j++) {
      |                 ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 46680 KB Output is correct
2 Correct 9 ms 46684 KB Output is correct
3 Correct 9 ms 46684 KB Output is correct
4 Correct 8 ms 46684 KB Output is correct
5 Correct 8 ms 46628 KB Output is correct
6 Correct 8 ms 46684 KB Output is correct
7 Correct 9 ms 46684 KB Output is correct
8 Correct 8 ms 46684 KB Output is correct
9 Correct 8 ms 46800 KB Output is correct
10 Correct 8 ms 46680 KB Output is correct
11 Correct 8 ms 46680 KB Output is correct
12 Correct 9 ms 46684 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 46680 KB Output is correct
2 Correct 9 ms 46684 KB Output is correct
3 Correct 9 ms 46684 KB Output is correct
4 Correct 8 ms 46684 KB Output is correct
5 Correct 8 ms 46628 KB Output is correct
6 Correct 8 ms 46684 KB Output is correct
7 Correct 9 ms 46684 KB Output is correct
8 Correct 8 ms 46684 KB Output is correct
9 Correct 8 ms 46800 KB Output is correct
10 Correct 8 ms 46680 KB Output is correct
11 Correct 8 ms 46680 KB Output is correct
12 Correct 9 ms 46684 KB Output is correct
13 Correct 10 ms 46684 KB Output is correct
14 Correct 9 ms 46684 KB Output is correct
15 Correct 9 ms 46852 KB Output is correct
16 Correct 9 ms 46680 KB Output is correct
17 Correct 9 ms 46680 KB Output is correct
18 Correct 9 ms 46880 KB Output is correct
19 Correct 9 ms 46684 KB Output is correct
20 Correct 8 ms 46684 KB Output is correct
21 Correct 9 ms 46680 KB Output is correct
22 Correct 9 ms 46888 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 46680 KB Output is correct
2 Correct 280 ms 68764 KB Output is correct
3 Correct 285 ms 68868 KB Output is correct
4 Correct 378 ms 61044 KB Output is correct
5 Correct 283 ms 67928 KB Output is correct
6 Correct 278 ms 67924 KB Output is correct
7 Correct 272 ms 61416 KB Output is correct
8 Correct 306 ms 61564 KB Output is correct
9 Correct 334 ms 61048 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 46684 KB Output is correct
2 Correct 400 ms 61180 KB Output is correct
3 Correct 440 ms 61052 KB Output is correct
4 Correct 439 ms 61052 KB Output is correct
5 Correct 539 ms 61180 KB Output is correct
6 Correct 465 ms 61136 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 423 ms 74576 KB Output is correct
2 Correct 482 ms 74596 KB Output is correct
3 Correct 456 ms 74028 KB Output is correct
4 Correct 444 ms 73960 KB Output is correct
5 Correct 478 ms 70688 KB Output is correct
6 Correct 414 ms 70692 KB Output is correct
7 Correct 375 ms 69484 KB Output is correct
8 Correct 325 ms 69172 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 46680 KB Output is correct
2 Correct 9 ms 46684 KB Output is correct
3 Correct 9 ms 46684 KB Output is correct
4 Correct 8 ms 46684 KB Output is correct
5 Correct 8 ms 46628 KB Output is correct
6 Correct 8 ms 46684 KB Output is correct
7 Correct 9 ms 46684 KB Output is correct
8 Correct 8 ms 46684 KB Output is correct
9 Correct 8 ms 46800 KB Output is correct
10 Correct 8 ms 46680 KB Output is correct
11 Correct 8 ms 46680 KB Output is correct
12 Correct 9 ms 46684 KB Output is correct
13 Correct 10 ms 46684 KB Output is correct
14 Correct 9 ms 46684 KB Output is correct
15 Correct 9 ms 46852 KB Output is correct
16 Correct 9 ms 46680 KB Output is correct
17 Correct 9 ms 46680 KB Output is correct
18 Correct 9 ms 46880 KB Output is correct
19 Correct 9 ms 46684 KB Output is correct
20 Correct 8 ms 46684 KB Output is correct
21 Correct 9 ms 46680 KB Output is correct
22 Correct 9 ms 46888 KB Output is correct
23 Correct 88 ms 53080 KB Output is correct
24 Correct 90 ms 53080 KB Output is correct
25 Correct 69 ms 53080 KB Output is correct
26 Correct 77 ms 52060 KB Output is correct
27 Correct 80 ms 52224 KB Output is correct
28 Correct 79 ms 52216 KB Output is correct
29 Correct 68 ms 52056 KB Output is correct
30 Correct 69 ms 52184 KB Output is correct
31 Correct 80 ms 52476 KB Output is correct
32 Correct 46 ms 54360 KB Output is correct
33 Correct 74 ms 53416 KB Output is correct
34 Correct 73 ms 53340 KB Output is correct
35 Correct 71 ms 53336 KB Output is correct
36 Correct 74 ms 53384 KB Output is correct
37 Correct 70 ms 53396 KB Output is correct
38 Correct 73 ms 53336 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 46680 KB Output is correct
2 Correct 9 ms 46684 KB Output is correct
3 Correct 9 ms 46684 KB Output is correct
4 Correct 8 ms 46684 KB Output is correct
5 Correct 8 ms 46628 KB Output is correct
6 Correct 8 ms 46684 KB Output is correct
7 Correct 9 ms 46684 KB Output is correct
8 Correct 8 ms 46684 KB Output is correct
9 Correct 8 ms 46800 KB Output is correct
10 Correct 8 ms 46680 KB Output is correct
11 Correct 8 ms 46680 KB Output is correct
12 Correct 9 ms 46684 KB Output is correct
13 Correct 10 ms 46684 KB Output is correct
14 Correct 9 ms 46684 KB Output is correct
15 Correct 9 ms 46852 KB Output is correct
16 Correct 9 ms 46680 KB Output is correct
17 Correct 9 ms 46680 KB Output is correct
18 Correct 9 ms 46880 KB Output is correct
19 Correct 9 ms 46684 KB Output is correct
20 Correct 8 ms 46684 KB Output is correct
21 Correct 9 ms 46680 KB Output is correct
22 Correct 9 ms 46888 KB Output is correct
23 Correct 280 ms 68764 KB Output is correct
24 Correct 285 ms 68868 KB Output is correct
25 Correct 378 ms 61044 KB Output is correct
26 Correct 283 ms 67928 KB Output is correct
27 Correct 278 ms 67924 KB Output is correct
28 Correct 272 ms 61416 KB Output is correct
29 Correct 306 ms 61564 KB Output is correct
30 Correct 334 ms 61048 KB Output is correct
31 Correct 400 ms 61180 KB Output is correct
32 Correct 440 ms 61052 KB Output is correct
33 Correct 439 ms 61052 KB Output is correct
34 Correct 539 ms 61180 KB Output is correct
35 Correct 465 ms 61136 KB Output is correct
36 Correct 423 ms 74576 KB Output is correct
37 Correct 482 ms 74596 KB Output is correct
38 Correct 456 ms 74028 KB Output is correct
39 Correct 444 ms 73960 KB Output is correct
40 Correct 478 ms 70688 KB Output is correct
41 Correct 414 ms 70692 KB Output is correct
42 Correct 375 ms 69484 KB Output is correct
43 Correct 325 ms 69172 KB Output is correct
44 Correct 88 ms 53080 KB Output is correct
45 Correct 90 ms 53080 KB Output is correct
46 Correct 69 ms 53080 KB Output is correct
47 Correct 77 ms 52060 KB Output is correct
48 Correct 80 ms 52224 KB Output is correct
49 Correct 79 ms 52216 KB Output is correct
50 Correct 68 ms 52056 KB Output is correct
51 Correct 69 ms 52184 KB Output is correct
52 Correct 80 ms 52476 KB Output is correct
53 Correct 46 ms 54360 KB Output is correct
54 Correct 74 ms 53416 KB Output is correct
55 Correct 73 ms 53340 KB Output is correct
56 Correct 71 ms 53336 KB Output is correct
57 Correct 74 ms 53384 KB Output is correct
58 Correct 70 ms 53396 KB Output is correct
59 Correct 73 ms 53336 KB Output is correct
60 Correct 674 ms 72180 KB Output is correct
61 Correct 627 ms 72176 KB Output is correct
62 Correct 606 ms 72072 KB Output is correct
63 Correct 609 ms 64032 KB Output is correct
64 Correct 624 ms 64020 KB Output is correct
65 Correct 622 ms 64012 KB Output is correct
66 Correct 432 ms 62164 KB Output is correct
67 Correct 442 ms 62292 KB Output is correct
68 Correct 514 ms 64456 KB Output is correct
69 Correct 273 ms 77756 KB Output is correct
70 Correct 613 ms 71372 KB Output is correct
71 Correct 604 ms 70860 KB Output is correct
72 Correct 600 ms 70600 KB Output is correct
73 Correct 608 ms 70936 KB Output is correct
74 Correct 609 ms 70584 KB Output is correct
75 Correct 617 ms 70936 KB Output is correct