oj.uz

답안 #985178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
985178 2024-05-17T12:03:04 Z Tsagana 서열 (APIO23_sequence) C++17
100 / 100
 763 ms 77916 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

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 46680 KB Output is correct
2 Correct 8 ms 46808 KB Output is correct
3 Correct 8 ms 46836 KB Output is correct
4 Correct 8 ms 46684 KB Output is correct
5 Correct 8 ms 46608 KB Output is correct
6 Correct 9 ms 46684 KB Output is correct
7 Correct 8 ms 46684 KB Output is correct
8 Correct 8 ms 46680 KB Output is correct
9 Correct 8 ms 46684 KB Output is correct
10 Correct 8 ms 46824 KB Output is correct
11 Correct 8 ms 46684 KB Output is correct
12 Correct 8 ms 46680 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 46680 KB Output is correct
2 Correct 8 ms 46808 KB Output is correct
3 Correct 8 ms 46836 KB Output is correct
4 Correct 8 ms 46684 KB Output is correct
5 Correct 8 ms 46608 KB Output is correct
6 Correct 9 ms 46684 KB Output is correct
7 Correct 8 ms 46684 KB Output is correct
8 Correct 8 ms 46680 KB Output is correct
9 Correct 8 ms 46684 KB Output is correct
10 Correct 8 ms 46824 KB Output is correct
11 Correct 8 ms 46684 KB Output is correct
12 Correct 8 ms 46680 KB Output is correct
13 Correct 9 ms 46684 KB Output is correct
14 Correct 9 ms 46684 KB Output is correct
15 Correct 10 ms 46684 KB Output is correct
16 Correct 9 ms 46684 KB Output is correct
17 Correct 9 ms 46684 KB Output is correct
18 Correct 10 ms 46940 KB Output is correct
19 Correct 9 ms 46684 KB Output is correct
20 Correct 9 ms 46684 KB Output is correct
21 Correct 9 ms 46684 KB Output is correct
22 Correct 9 ms 46684 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 46680 KB Output is correct
2 Correct 297 ms 68880 KB Output is correct
3 Correct 301 ms 68748 KB Output is correct
4 Correct 334 ms 62024 KB Output is correct
5 Correct 310 ms 71160 KB Output is correct
6 Correct 314 ms 70920 KB Output is correct
7 Correct 266 ms 62804 KB Output is correct
8 Correct 331 ms 62948 KB Output is correct
9 Correct 336 ms 61848 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 46808 KB Output is correct
2 Correct 417 ms 61180 KB Output is correct
3 Correct 444 ms 61056 KB Output is correct
4 Correct 441 ms 62028 KB Output is correct
5 Correct 528 ms 61952 KB Output is correct
6 Correct 480 ms 62108 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 453 ms 74652 KB Output is correct
2 Correct 448 ms 74588 KB Output is correct
3 Correct 604 ms 73812 KB Output is correct
4 Correct 490 ms 77308 KB Output is correct
5 Correct 450 ms 73892 KB Output is correct
6 Correct 471 ms 73896 KB Output is correct
7 Correct 412 ms 72720 KB Output is correct
8 Correct 364 ms 72412 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 46680 KB Output is correct
2 Correct 8 ms 46808 KB Output is correct
3 Correct 8 ms 46836 KB Output is correct
4 Correct 8 ms 46684 KB Output is correct
5 Correct 8 ms 46608 KB Output is correct
6 Correct 9 ms 46684 KB Output is correct
7 Correct 8 ms 46684 KB Output is correct
8 Correct 8 ms 46680 KB Output is correct
9 Correct 8 ms 46684 KB Output is correct
10 Correct 8 ms 46824 KB Output is correct
11 Correct 8 ms 46684 KB Output is correct
12 Correct 8 ms 46680 KB Output is correct
13 Correct 9 ms 46684 KB Output is correct
14 Correct 9 ms 46684 KB Output is correct
15 Correct 10 ms 46684 KB Output is correct
16 Correct 9 ms 46684 KB Output is correct
17 Correct 9 ms 46684 KB Output is correct
18 Correct 10 ms 46940 KB Output is correct
19 Correct 9 ms 46684 KB Output is correct
20 Correct 9 ms 46684 KB Output is correct
21 Correct 9 ms 46684 KB Output is correct
22 Correct 9 ms 46684 KB Output is correct
23 Correct 69 ms 53084 KB Output is correct
24 Correct 75 ms 53596 KB Output is correct
25 Correct 74 ms 53840 KB Output is correct
26 Correct 77 ms 52316 KB Output is correct
27 Correct 76 ms 52316 KB Output is correct
28 Correct 98 ms 52316 KB Output is correct
29 Correct 69 ms 52136 KB Output is correct
30 Correct 74 ms 52060 KB Output is correct
31 Correct 99 ms 52436 KB Output is correct
32 Correct 46 ms 54360 KB Output is correct
33 Correct 69 ms 53340 KB Output is correct
34 Correct 82 ms 53424 KB Output is correct
35 Correct 73 ms 53336 KB Output is correct
36 Correct 70 ms 53328 KB Output is correct
37 Correct 68 ms 53340 KB Output is correct
38 Correct 82 ms 53328 KB Output is correct

Subtask #7
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 46680 KB Output is correct
2 Correct 8 ms 46808 KB Output is correct
3 Correct 8 ms 46836 KB Output is correct
4 Correct 8 ms 46684 KB Output is correct
5 Correct 8 ms 46608 KB Output is correct
6 Correct 9 ms 46684 KB Output is correct
7 Correct 8 ms 46684 KB Output is correct
8 Correct 8 ms 46680 KB Output is correct
9 Correct 8 ms 46684 KB Output is correct
10 Correct 8 ms 46824 KB Output is correct
11 Correct 8 ms 46684 KB Output is correct
12 Correct 8 ms 46680 KB Output is correct
13 Correct 9 ms 46684 KB Output is correct
14 Correct 9 ms 46684 KB Output is correct
15 Correct 10 ms 46684 KB Output is correct
16 Correct 9 ms 46684 KB Output is correct
17 Correct 9 ms 46684 KB Output is correct
18 Correct 10 ms 46940 KB Output is correct
19 Correct 9 ms 46684 KB Output is correct
20 Correct 9 ms 46684 KB Output is correct
21 Correct 9 ms 46684 KB Output is correct
22 Correct 9 ms 46684 KB Output is correct
23 Correct 297 ms 68880 KB Output is correct
24 Correct 301 ms 68748 KB Output is correct
25 Correct 334 ms 62024 KB Output is correct
26 Correct 310 ms 71160 KB Output is correct
27 Correct 314 ms 70920 KB Output is correct
28 Correct 266 ms 62804 KB Output is correct
29 Correct 331 ms 62948 KB Output is correct
30 Correct 336 ms 61848 KB Output is correct
31 Correct 417 ms 61180 KB Output is correct
32 Correct 444 ms 61056 KB Output is correct
33 Correct 441 ms 62028 KB Output is correct
34 Correct 528 ms 61952 KB Output is correct
35 Correct 480 ms 62108 KB Output is correct
36 Correct 453 ms 74652 KB Output is correct
37 Correct 448 ms 74588 KB Output is correct
38 Correct 604 ms 73812 KB Output is correct
39 Correct 490 ms 77308 KB Output is correct
40 Correct 450 ms 73892 KB Output is correct
41 Correct 471 ms 73896 KB Output is correct
42 Correct 412 ms 72720 KB Output is correct
43 Correct 364 ms 72412 KB Output is correct
44 Correct 69 ms 53084 KB Output is correct
45 Correct 75 ms 53596 KB Output is correct
46 Correct 74 ms 53840 KB Output is correct
47 Correct 77 ms 52316 KB Output is correct
48 Correct 76 ms 52316 KB Output is correct
49 Correct 98 ms 52316 KB Output is correct
50 Correct 69 ms 52136 KB Output is correct
51 Correct 74 ms 52060 KB Output is correct
52 Correct 99 ms 52436 KB Output is correct
53 Correct 46 ms 54360 KB Output is correct
54 Correct 69 ms 53340 KB Output is correct
55 Correct 82 ms 53424 KB Output is correct
56 Correct 73 ms 53336 KB Output is correct
57 Correct 70 ms 53328 KB Output is correct
58 Correct 68 ms 53340 KB Output is correct
59 Correct 82 ms 53328 KB Output is correct
60 Correct 659 ms 72180 KB Output is correct
61 Correct 747 ms 72180 KB Output is correct
62 Correct 742 ms 72064 KB Output is correct
63 Correct 672 ms 64032 KB Output is correct
64 Correct 675 ms 64020 KB Output is correct
65 Correct 708 ms 64004 KB Output is correct
66 Correct 451 ms 61928 KB Output is correct
67 Correct 480 ms 62108 KB Output is correct
68 Correct 544 ms 64460 KB Output is correct
69 Correct 317 ms 77916 KB Output is correct
70 Correct 675 ms 71272 KB Output is correct
71 Correct 633 ms 71084 KB Output is correct
72 Correct 683 ms 70492 KB Output is correct
73 Correct 710 ms 70944 KB Output is correct
74 Correct 674 ms 70584 KB Output is correct
75 Correct 763 ms 70932 KB Output is correct