oj.uz

Submission #752537

# Submission time Handle Problem Language Result Execution time Memory
752537 2023-06-03T07:02:41 Z aryan12 Sequence (APIO23_sequence) C++17
100 / 100
 1022 ms 110704 KB 
#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
const int N = 5e5 + 5, INF = 1e18;

struct segtree
{
    pair<int, int> seg[N * 4];
    int lazy[N * 4];

    void Build(int l, int r, int pos)
    {
        seg[pos] = {-r, -l};
        if(l == r) return;
        int mid = (l + r) / 2;
        Build(l, mid, pos * 2);
        Build(mid + 1, r, pos * 2 + 1);
    }

    void UpdateLazy(int l, int r, int pos)
    {
        if(l == r)
        {
            seg[pos].first += lazy[pos];
            seg[pos].second += lazy[pos];
            lazy[pos] = 0;
            return;
        }
        seg[pos].first += lazy[pos];
        seg[pos].second += lazy[pos];
        lazy[pos * 2] += lazy[pos];
        lazy[pos * 2 + 1] += lazy[pos];
        lazy[pos] = 0;
    }

    void Update(int l, int r, int pos, int ql, int qval)
    {
        if(lazy[pos] != 0)
        {
            UpdateLazy(l, r, pos);
        }
        if(ql > r)
        {
            // cout << "Update(" << l << ", " << r << ") out of bounds\n";
            return;
        }
        if(l == r)
        {
            // cout << "Update(" << l << ", " << r << ") total in [1]\n";
            seg[pos].first += qval;
            seg[pos].second += qval;
            return;
        }
        if(l >= ql)
        {
            // cout << "Update(" << l << ", " << r << ") total in [2]\n";
            seg[pos].first += qval;
            seg[pos].second += qval;
            lazy[pos * 2] += qval;
            lazy[pos * 2 + 1] += qval;
            return;
        }
        int mid = (l + r) / 2;
        Update(l, mid, pos * 2, ql, qval);
        Update(mid + 1, r, pos * 2 + 1, ql, qval);
        // cout << "Update(" << l << ", " << r << ") partial\n";
        seg[pos].first = min(seg[pos * 2].first, seg[pos * 2 + 1].first);
        seg[pos].second = max(seg[pos * 2].second, seg[pos * 2 + 1].second);
    }

    pair<int, int> Query(int l, int r, int pos, int ql, int qr)
    {
        if(lazy[pos] != 0)
        {
            UpdateLazy(l, r, pos);
        }
        if(ql <= l && r <= qr)
        {
            return seg[pos];
        }
        if(ql > r || l > qr)
        {
            return {INF, -INF};
        }
        int mid = (l + r) / 2;
        pair<int, int> p1 = Query(l, mid, pos * 2, ql, qr);
        pair<int, int> p2 = Query(mid + 1, r, pos * 2 + 1, ql, qr);
        return {min(p1.first, p2.first), max(p1.second, p2.second)};
    }
} before, after;


int32_t sequence(int32_t n, vector<int32_t> a) 
{
    before.Build(1, n, 1);
    after.Build(1, n, 1);
    vector<int> occ[n + 1];
    for(int i = 0; i < a.size(); i++)
    {
        occ[a[i]].push_back(i + 1);
    }
    int ans = 1;
    for(int i = 1; i <= n; i++)
    {
        // cout << "i = " << i << endl;
        for(int j: occ[i])
        {
            // cout << "hello" << endl;
            before.Update(1, n, 1, j, 2);
        }
        for(int l = 0; l < occ[i].size(); l++)
        {
            int r = l + ans;
            if(r >= occ[i].size())
            {
                break;
            }
            int afterRightMin = after.Query(1, n, 1, occ[i][r], n).first;
            int afterLeftMax = after.Query(1, n, 1, 1, occ[i][l] - 1).second;
            afterLeftMax = max(afterLeftMax, 0LL);
            
            int beforeRightMax = before.Query(1, n, 1, occ[i][r], n).second;
            int beforeLeftMin = before.Query(1, n, 1, 1, occ[i][l] - 1).first;
            beforeLeftMin = min(beforeLeftMin, 0LL);

            int afterAnswer = afterRightMin - afterLeftMax;
            int beforeAnswer = beforeRightMax - beforeLeftMin;

            // cout << beforeLeftMin << " " << afterLeftMax << " " << afterRightMin << " " << beforeRightMax << "\n";

            if(afterAnswer <= 0 && beforeAnswer >= 0)
            {
                ans += 1;
                l -= 1;
            }
        }
        for(int j: occ[i])
        {
            after.Update(1, n, 1, j, 2);
        }
    }
    return ans;
}

Compilation message

sequence.cpp: In function 'int32_t sequence(int32_t, std::vector<int>)':
sequence.cpp:100:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |     for(int i = 0; i < a.size(); i++)
      |                    ~~^~~~~~~~~~
sequence.cpp:113:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |         for(int l = 0; l < occ[i].size(); l++)
      |                        ~~^~~~~~~~~~~~~~~
sequence.cpp:116:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |             if(r >= occ[i].size())
      |                ~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 62892 KB Output is correct
2 Correct 25 ms 62872 KB Output is correct
3 Correct 25 ms 62808 KB Output is correct
4 Correct 27 ms 62832 KB Output is correct
5 Correct 27 ms 62916 KB Output is correct
6 Correct 25 ms 62928 KB Output is correct
7 Correct 25 ms 62832 KB Output is correct
8 Correct 24 ms 62908 KB Output is correct
9 Correct 25 ms 62932 KB Output is correct
10 Correct 23 ms 62896 KB Output is correct
11 Correct 24 ms 62928 KB Output is correct
12 Correct 26 ms 62912 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 62892 KB Output is correct
2 Correct 25 ms 62872 KB Output is correct
3 Correct 25 ms 62808 KB Output is correct
4 Correct 27 ms 62832 KB Output is correct
5 Correct 27 ms 62916 KB Output is correct
6 Correct 25 ms 62928 KB Output is correct
7 Correct 25 ms 62832 KB Output is correct
8 Correct 24 ms 62908 KB Output is correct
9 Correct 25 ms 62932 KB Output is correct
10 Correct 23 ms 62896 KB Output is correct
11 Correct 24 ms 62928 KB Output is correct
12 Correct 26 ms 62912 KB Output is correct
13 Correct 25 ms 63020 KB Output is correct
14 Correct 25 ms 63060 KB Output is correct
15 Correct 27 ms 63040 KB Output is correct
16 Correct 26 ms 63008 KB Output is correct
17 Correct 25 ms 63036 KB Output is correct
18 Correct 23 ms 63108 KB Output is correct
19 Correct 25 ms 63060 KB Output is correct
20 Correct 28 ms 63044 KB Output is correct
21 Correct 25 ms 63060 KB Output is correct
22 Correct 26 ms 63052 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 62892 KB Output is correct
2 Correct 318 ms 105584 KB Output is correct
3 Correct 355 ms 105560 KB Output is correct
4 Correct 335 ms 99076 KB Output is correct
5 Correct 333 ms 104820 KB Output is correct
6 Correct 336 ms 104904 KB Output is correct
7 Correct 292 ms 99452 KB Output is correct
8 Correct 337 ms 100060 KB Output is correct
9 Correct 380 ms 99000 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 62872 KB Output is correct
2 Correct 455 ms 99452 KB Output is correct
3 Correct 507 ms 99068 KB Output is correct
4 Correct 553 ms 99196 KB Output is correct
5 Correct 516 ms 99448 KB Output is correct
6 Correct 506 ms 99044 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 631 ms 110636 KB Output is correct
2 Correct 763 ms 110704 KB Output is correct
3 Correct 677 ms 109996 KB Output is correct
4 Correct 599 ms 110088 KB Output is correct
5 Correct 534 ms 106748 KB Output is correct
6 Correct 587 ms 106680 KB Output is correct
7 Correct 451 ms 105588 KB Output is correct
8 Correct 402 ms 105148 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 62892 KB Output is correct
2 Correct 25 ms 62872 KB Output is correct
3 Correct 25 ms 62808 KB Output is correct
4 Correct 27 ms 62832 KB Output is correct
5 Correct 27 ms 62916 KB Output is correct
6 Correct 25 ms 62928 KB Output is correct
7 Correct 25 ms 62832 KB Output is correct
8 Correct 24 ms 62908 KB Output is correct
9 Correct 25 ms 62932 KB Output is correct
10 Correct 23 ms 62896 KB Output is correct
11 Correct 24 ms 62928 KB Output is correct
12 Correct 26 ms 62912 KB Output is correct
13 Correct 25 ms 63020 KB Output is correct
14 Correct 25 ms 63060 KB Output is correct
15 Correct 27 ms 63040 KB Output is correct
16 Correct 26 ms 63008 KB Output is correct
17 Correct 25 ms 63036 KB Output is correct
18 Correct 23 ms 63108 KB Output is correct
19 Correct 25 ms 63060 KB Output is correct
20 Correct 28 ms 63044 KB Output is correct
21 Correct 25 ms 63060 KB Output is correct
22 Correct 26 ms 63052 KB Output is correct
23 Correct 105 ms 71124 KB Output is correct
24 Correct 118 ms 71192 KB Output is correct
25 Correct 132 ms 71132 KB Output is correct
26 Correct 131 ms 70816 KB Output is correct
27 Correct 116 ms 70844 KB Output is correct
28 Correct 136 ms 70816 KB Output is correct
29 Correct 93 ms 70268 KB Output is correct
30 Correct 106 ms 70352 KB Output is correct
31 Correct 93 ms 70208 KB Output is correct
32 Correct 74 ms 71948 KB Output is correct
33 Correct 131 ms 71080 KB Output is correct
34 Correct 101 ms 70988 KB Output is correct
35 Correct 107 ms 71004 KB Output is correct
36 Correct 116 ms 71112 KB Output is correct
37 Correct 102 ms 71004 KB Output is correct
38 Correct 110 ms 70996 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 62892 KB Output is correct
2 Correct 25 ms 62872 KB Output is correct
3 Correct 25 ms 62808 KB Output is correct
4 Correct 27 ms 62832 KB Output is correct
5 Correct 27 ms 62916 KB Output is correct
6 Correct 25 ms 62928 KB Output is correct
7 Correct 25 ms 62832 KB Output is correct
8 Correct 24 ms 62908 KB Output is correct
9 Correct 25 ms 62932 KB Output is correct
10 Correct 23 ms 62896 KB Output is correct
11 Correct 24 ms 62928 KB Output is correct
12 Correct 26 ms 62912 KB Output is correct
13 Correct 25 ms 63020 KB Output is correct
14 Correct 25 ms 63060 KB Output is correct
15 Correct 27 ms 63040 KB Output is correct
16 Correct 26 ms 63008 KB Output is correct
17 Correct 25 ms 63036 KB Output is correct
18 Correct 23 ms 63108 KB Output is correct
19 Correct 25 ms 63060 KB Output is correct
20 Correct 28 ms 63044 KB Output is correct
21 Correct 25 ms 63060 KB Output is correct
22 Correct 26 ms 63052 KB Output is correct
23 Correct 318 ms 105584 KB Output is correct
24 Correct 355 ms 105560 KB Output is correct
25 Correct 335 ms 99076 KB Output is correct
26 Correct 333 ms 104820 KB Output is correct
27 Correct 336 ms 104904 KB Output is correct
28 Correct 292 ms 99452 KB Output is correct
29 Correct 337 ms 100060 KB Output is correct
30 Correct 380 ms 99000 KB Output is correct
31 Correct 455 ms 99452 KB Output is correct
32 Correct 507 ms 99068 KB Output is correct
33 Correct 553 ms 99196 KB Output is correct
34 Correct 516 ms 99448 KB Output is correct
35 Correct 506 ms 99044 KB Output is correct
36 Correct 631 ms 110636 KB Output is correct
37 Correct 763 ms 110704 KB Output is correct
38 Correct 677 ms 109996 KB Output is correct
39 Correct 599 ms 110088 KB Output is correct
40 Correct 534 ms 106748 KB Output is correct
41 Correct 587 ms 106680 KB Output is correct
42 Correct 451 ms 105588 KB Output is correct
43 Correct 402 ms 105148 KB Output is correct
44 Correct 105 ms 71124 KB Output is correct
45 Correct 118 ms 71192 KB Output is correct
46 Correct 132 ms 71132 KB Output is correct
47 Correct 131 ms 70816 KB Output is correct
48 Correct 116 ms 70844 KB Output is correct
49 Correct 136 ms 70816 KB Output is correct
50 Correct 93 ms 70268 KB Output is correct
51 Correct 106 ms 70352 KB Output is correct
52 Correct 93 ms 70208 KB Output is correct
53 Correct 74 ms 71948 KB Output is correct
54 Correct 131 ms 71080 KB Output is correct
55 Correct 101 ms 70988 KB Output is correct
56 Correct 107 ms 71004 KB Output is correct
57 Correct 116 ms 71112 KB Output is correct
58 Correct 102 ms 71004 KB Output is correct
59 Correct 110 ms 70996 KB Output is correct
60 Correct 1022 ms 105588 KB Output is correct
61 Correct 873 ms 105580 KB Output is correct
62 Correct 794 ms 105596 KB Output is correct
63 Correct 844 ms 101328 KB Output is correct
64 Correct 752 ms 101372 KB Output is correct
65 Correct 772 ms 101364 KB Output is correct
66 Correct 516 ms 99540 KB Output is correct
67 Correct 506 ms 99124 KB Output is correct
68 Correct 451 ms 99024 KB Output is correct
69 Correct 333 ms 110652 KB Output is correct
70 Correct 825 ms 104948 KB Output is correct
71 Correct 738 ms 104636 KB Output is correct
72 Correct 738 ms 104184 KB Output is correct
73 Correct 722 ms 104424 KB Output is correct
74 Correct 693 ms 104144 KB Output is correct
75 Correct 832 ms 104512 KB Output is correct