oj.uz

Submission #757645

# Submission time Handle Problem Language Result Execution time Memory
757645 2023-06-13T13:55:36 Z doowey Sequence (APIO23_sequence) C++17
100 / 100
 800 ms 64888 KB 
#include <bits/stdc++.h>
#include "sequence.h"
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
 
#define fi first
#define se second
#define mp make_pair
 
const int N = (int)5e5 + 100;
int n;
int A[N];
vector<int> P[N];
 
struct Node{
    pii can;
    int lazyL;
    int lazyR;
};
 
Node T[N * 4 + 500];
 
Node unite(Node ai, Node bi){
    Node res;
    res.can = mp(min(ai.can.fi, bi.can.fi), max(ai.can.se, bi.can.se));
    res.lazyL = res.lazyR = 0;
    return res;
}
 
 
void push(int node, int cl, int cr){
    T[node].can.fi += T[node].lazyL;
    T[node].can.se += T[node].lazyR;
    if(cl != cr){
        T[node * 2].lazyL += T[node].lazyL;
        T[node * 2].lazyR += T[node].lazyR;
        T[node * 2 + 1].lazyL += T[node].lazyL;
        T[node * 2 + 1].lazyR += T[node].lazyR;
    }
    T[node].lazyL = T[node].lazyR = 0;
}
 
void update(int node, int cl, int cr, int tl, int tr, int vl, int vr){
    push(node, cl, cr);
    if(cr < tl || cl > tr) return;
    if(cl >= tl && cr <= tr){
        T[node].lazyL = vl;
        T[node].lazyR = vr;
        push(node, cl, cr);
        return;
    }
    int mid = (cl + cr) / 2;
    update(node * 2, cl, mid, tl, tr, vl, vr);
    update(node * 2 + 1, mid + 1, cr, tl, tr, vl, vr);
    T[node] = unite(T[node * 2], T[node * 2 + 1]);
}
 
pii get(int node, int cl, int cr, int tl, int tr){
    push(node, cl, cr);
    if(cr < tl || cl > tr) return mp((int)1e9, -(int)1e9);
    if(cl >= tl && cr <= tr){
        return T[node].can;
    }
    int mid = (cl + cr) / 2;
    pii lf = get(node * 2, cl, mid, tl, tr);
    pii rf = get(node * 2 + 1, mid + 1, cr, tl, tr);
    return mp(min(lf.fi, rf.fi), max(lf.se, rf.se));
}
 
void build(int node, int cl, int cr){
    T[node].can = mp(cl, cr);
    if(cl == cr){
        T[node].lazyL = T[node].lazyR = 0;
        return;
    }
    int mid = (cl + cr) / 2;
    build(node * 2, cl, mid);
    build(node * 2 + 1, mid + 1, cr);
}
 
int sequence(int _n, vector<int> _a) {
    n = _n;
    for(int i = 1; i <= n; i ++ ){
        A[i] = _a[i - 1];
        P[A[i]].push_back(i);
    }
    int soln = 1;
    build(1, 0, n);
    int l, r;
    pii A, B;
    for(int id = 1; id <= n; id ++ ){
        for(int j = (int)P[id].size() - 1 ; j >= 0; j -- ){
            update(1, 0, n, P[id][j], n, -2, 0);
            while(j + soln < P[id].size()){
                l = P[id][j];
                r = P[id][j + soln];
                A = get(1, 0, n, 0, l - 1);
                B = get(1, 0, n, r, n);
                if(max(A.fi,B.fi) <= min(A.se,B.se)) {
                    soln ++ ;
                }
                else break;
            }
        }
        for(auto x : P[id]){
            update(1, 0, n, x, n, 0, -2);
        }
    }
    return soln;
}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:97:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |             while(j + soln < P[id].size()){
      |                   ~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 43348 KB Output is correct
2 Correct 20 ms 43348 KB Output is correct
3 Correct 20 ms 43348 KB Output is correct
4 Correct 19 ms 43252 KB Output is correct
5 Correct 21 ms 43280 KB Output is correct
6 Correct 20 ms 43328 KB Output is correct
7 Correct 21 ms 43368 KB Output is correct
8 Correct 21 ms 43368 KB Output is correct
9 Correct 21 ms 43276 KB Output is correct
10 Correct 20 ms 43340 KB Output is correct
11 Correct 23 ms 43328 KB Output is correct
12 Correct 19 ms 43348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 43348 KB Output is correct
2 Correct 20 ms 43348 KB Output is correct
3 Correct 20 ms 43348 KB Output is correct
4 Correct 19 ms 43252 KB Output is correct
5 Correct 21 ms 43280 KB Output is correct
6 Correct 20 ms 43328 KB Output is correct
7 Correct 21 ms 43368 KB Output is correct
8 Correct 21 ms 43368 KB Output is correct
9 Correct 21 ms 43276 KB Output is correct
10 Correct 20 ms 43340 KB Output is correct
11 Correct 23 ms 43328 KB Output is correct
12 Correct 19 ms 43348 KB Output is correct
13 Correct 21 ms 43348 KB Output is correct
14 Correct 20 ms 43396 KB Output is correct
15 Correct 21 ms 43416 KB Output is correct
16 Correct 20 ms 43396 KB Output is correct
17 Correct 21 ms 43348 KB Output is correct
18 Correct 24 ms 43336 KB Output is correct
19 Correct 21 ms 43348 KB Output is correct
20 Correct 21 ms 43348 KB Output is correct
21 Correct 21 ms 43348 KB Output is correct
22 Correct 20 ms 43384 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 43348 KB Output is correct
2 Correct 505 ms 59164 KB Output is correct
3 Correct 434 ms 59156 KB Output is correct
4 Correct 491 ms 51368 KB Output is correct
5 Correct 422 ms 58204 KB Output is correct
6 Correct 412 ms 58216 KB Output is correct
7 Correct 461 ms 51704 KB Output is correct
8 Correct 476 ms 51980 KB Output is correct
9 Correct 505 ms 51780 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 43348 KB Output is correct
2 Correct 549 ms 52232 KB Output is correct
3 Correct 577 ms 51332 KB Output is correct
4 Correct 568 ms 51340 KB Output is correct
5 Correct 648 ms 52244 KB Output is correct
6 Correct 638 ms 51420 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 590 ms 64844 KB Output is correct
2 Correct 552 ms 64880 KB Output is correct
3 Correct 538 ms 64204 KB Output is correct
4 Correct 567 ms 64316 KB Output is correct
5 Correct 553 ms 60976 KB Output is correct
6 Correct 568 ms 60940 KB Output is correct
7 Correct 483 ms 59772 KB Output is correct
8 Correct 462 ms 59460 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 43348 KB Output is correct
2 Correct 20 ms 43348 KB Output is correct
3 Correct 20 ms 43348 KB Output is correct
4 Correct 19 ms 43252 KB Output is correct
5 Correct 21 ms 43280 KB Output is correct
6 Correct 20 ms 43328 KB Output is correct
7 Correct 21 ms 43368 KB Output is correct
8 Correct 21 ms 43368 KB Output is correct
9 Correct 21 ms 43276 KB Output is correct
10 Correct 20 ms 43340 KB Output is correct
11 Correct 23 ms 43328 KB Output is correct
12 Correct 19 ms 43348 KB Output is correct
13 Correct 21 ms 43348 KB Output is correct
14 Correct 20 ms 43396 KB Output is correct
15 Correct 21 ms 43416 KB Output is correct
16 Correct 20 ms 43396 KB Output is correct
17 Correct 21 ms 43348 KB Output is correct
18 Correct 24 ms 43336 KB Output is correct
19 Correct 21 ms 43348 KB Output is correct
20 Correct 21 ms 43348 KB Output is correct
21 Correct 21 ms 43348 KB Output is correct
22 Correct 20 ms 43384 KB Output is correct
23 Correct 102 ms 45832 KB Output is correct
24 Correct 99 ms 45852 KB Output is correct
25 Correct 93 ms 45788 KB Output is correct
26 Correct 106 ms 44972 KB Output is correct
27 Correct 108 ms 44976 KB Output is correct
28 Correct 99 ms 44980 KB Output is correct
29 Correct 94 ms 44712 KB Output is correct
30 Correct 99 ms 44656 KB Output is correct
31 Correct 116 ms 44876 KB Output is correct
32 Correct 82 ms 46708 KB Output is correct
33 Correct 107 ms 45712 KB Output is correct
34 Correct 94 ms 45632 KB Output is correct
35 Correct 119 ms 45740 KB Output is correct
36 Correct 94 ms 45612 KB Output is correct
37 Correct 89 ms 45688 KB Output is correct
38 Correct 98 ms 45728 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 43348 KB Output is correct
2 Correct 20 ms 43348 KB Output is correct
3 Correct 20 ms 43348 KB Output is correct
4 Correct 19 ms 43252 KB Output is correct
5 Correct 21 ms 43280 KB Output is correct
6 Correct 20 ms 43328 KB Output is correct
7 Correct 21 ms 43368 KB Output is correct
8 Correct 21 ms 43368 KB Output is correct
9 Correct 21 ms 43276 KB Output is correct
10 Correct 20 ms 43340 KB Output is correct
11 Correct 23 ms 43328 KB Output is correct
12 Correct 19 ms 43348 KB Output is correct
13 Correct 21 ms 43348 KB Output is correct
14 Correct 20 ms 43396 KB Output is correct
15 Correct 21 ms 43416 KB Output is correct
16 Correct 20 ms 43396 KB Output is correct
17 Correct 21 ms 43348 KB Output is correct
18 Correct 24 ms 43336 KB Output is correct
19 Correct 21 ms 43348 KB Output is correct
20 Correct 21 ms 43348 KB Output is correct
21 Correct 21 ms 43348 KB Output is correct
22 Correct 20 ms 43384 KB Output is correct
23 Correct 505 ms 59164 KB Output is correct
24 Correct 434 ms 59156 KB Output is correct
25 Correct 491 ms 51368 KB Output is correct
26 Correct 422 ms 58204 KB Output is correct
27 Correct 412 ms 58216 KB Output is correct
28 Correct 461 ms 51704 KB Output is correct
29 Correct 476 ms 51980 KB Output is correct
30 Correct 505 ms 51780 KB Output is correct
31 Correct 549 ms 52232 KB Output is correct
32 Correct 577 ms 51332 KB Output is correct
33 Correct 568 ms 51340 KB Output is correct
34 Correct 648 ms 52244 KB Output is correct
35 Correct 638 ms 51420 KB Output is correct
36 Correct 590 ms 64844 KB Output is correct
37 Correct 552 ms 64880 KB Output is correct
38 Correct 538 ms 64204 KB Output is correct
39 Correct 567 ms 64316 KB Output is correct
40 Correct 553 ms 60976 KB Output is correct
41 Correct 568 ms 60940 KB Output is correct
42 Correct 483 ms 59772 KB Output is correct
43 Correct 462 ms 59460 KB Output is correct
44 Correct 102 ms 45832 KB Output is correct
45 Correct 99 ms 45852 KB Output is correct
46 Correct 93 ms 45788 KB Output is correct
47 Correct 106 ms 44972 KB Output is correct
48 Correct 108 ms 44976 KB Output is correct
49 Correct 99 ms 44980 KB Output is correct
50 Correct 94 ms 44712 KB Output is correct
51 Correct 99 ms 44656 KB Output is correct
52 Correct 116 ms 44876 KB Output is correct
53 Correct 82 ms 46708 KB Output is correct
54 Correct 107 ms 45712 KB Output is correct
55 Correct 94 ms 45632 KB Output is correct
56 Correct 119 ms 45740 KB Output is correct
57 Correct 94 ms 45612 KB Output is correct
58 Correct 89 ms 45688 KB Output is correct
59 Correct 98 ms 45728 KB Output is correct
60 Correct 691 ms 59160 KB Output is correct
61 Correct 672 ms 59156 KB Output is correct
62 Correct 727 ms 59196 KB Output is correct
63 Correct 641 ms 52436 KB Output is correct
64 Correct 678 ms 52428 KB Output is correct
65 Correct 734 ms 52416 KB Output is correct
66 Correct 590 ms 51472 KB Output is correct
67 Correct 583 ms 51608 KB Output is correct
68 Correct 650 ms 51328 KB Output is correct
69 Correct 408 ms 64888 KB Output is correct
70 Correct 649 ms 58240 KB Output is correct
71 Correct 692 ms 58052 KB Output is correct
72 Correct 800 ms 57596 KB Output is correct
73 Correct 689 ms 57900 KB Output is correct
74 Correct 702 ms 57464 KB Output is correct
75 Correct 727 ms 57932 KB Output is correct