oj.uz

Submission #954660

# Submission time Handle Problem Language Result Execution time Memory
954660 2024-03-28T09:50:13 Z boris_mihov Food Court (JOI21_foodcourt) C++17
100 / 100
 596 ms 93380 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
typedef long long llong;
const int MAXN = 250000 + 10;
const llong INF = 1e18;
 
const int BUFF_SIZE = 1e5;
char buff[BUFF_SIZE];
int buffPos = BUFF_SIZE-1;
 
void readChar() 
{
    if (++buffPos == BUFF_SIZE) fread(buff, BUFF_SIZE, 1, stdin), buffPos = 0;
}
 
void readInt(int &num) 
{
    num = 0;
    for (; '0' > buff[buffPos] || buff[buffPos] > '9' ; readChar());
    for (; '0' <= buff[buffPos] && buff[buffPos] <= '9' ; readChar())
    {
        num = 10*num + buff[buffPos]-'0';
    }
}
 
void readLong(llong &num) 
{
    num = 0;
    for (; '0' > buff[buffPos] || buff[buffPos] > '9' ; readChar());
    for (; '0' <= buff[buffPos] && buff[buffPos] <= '9' ; readChar())
    {
        num = 10*num + buff[buffPos]-'0';
    }
}
 
int n, m, q;
struct SegmentTree
{
    struct Node
    {
        llong minPrefix;
        llong maxSuffix;
        llong sumPositive;
        llong sumNegative;
        int minPrefixPos;
        llong sum;
        int c;
 
        Node()
        {
            maxSuffix = minPrefix = minPrefixPos = sumPositive = sumNegative = sum = c = 0;
        }   
 
        void assign(const Node &left, const Node &right)
        {
            sum = left.sum + right.sum;
            sumPositive = left.sumPositive + right.sumPositive;
            sumNegative = left.sumNegative + right.sumNegative;
            minPrefix = std::min(left.minPrefix, left.sum + right.minPrefix);
            if (minPrefix == left.minPrefix) minPrefixPos = left.minPrefixPos;
            else minPrefixPos = right.minPrefixPos;

            maxSuffix = std::max(right.maxSuffix, right.sum + left.maxSuffix);
            c = std::max(left.c, right.c);
        }
 
        void operator += (const Node &right)
        {
            minPrefix = std::min(minPrefix, sum + right.minPrefix);
            if (minPrefixPos == 0 || minPrefix == sum + right.minPrefix) minPrefixPos = right.minPrefixPos;
            maxSuffix = std::max(right.maxSuffix, right.sum + maxSuffix);
            
            sum = sum + right.sum;
            sumPositive = sumPositive + right.sumPositive;
            sumNegative = sumNegative + right.sumNegative;
            c = std::max(c, right.c);
        }

        friend Node operator + (const Node &left, const Node &right)
        {
            Node result;
            result.sum = left.sum + right.sum;
            result.sumPositive = left.sumPositive + right.sumPositive;
            result.sumNegative = left.sumNegative + right.sumNegative;
            result.minPrefix = std::min(left.minPrefix, left.sum + right.minPrefix);
            if (result.minPrefix == left.minPrefix) result.minPrefixPos = left.minPrefixPos;
            else result.minPrefixPos = right.minPrefixPos;

            result.maxSuffix = std::max(right.maxSuffix, right.sum + left.maxSuffix);
            result.c = std::max(left.c, right.c);
            return result;
        }
    };
 
    Node tree[4*MAXN];
    void build(int l, int r, int node)
    {
        if (l == r)
        {
            tree[node].minPrefixPos = l;
            return;
        }

        int mid = l + r >> 1;
        build(l, mid, 2*node);
        build(mid + 1, r, 2*node + 1);
        tree[node].assign(tree[2*node], tree[2*node + 1]);
    }
    
    void update(int l, int r, int node, const int &queryPos, const int &queryVal, const int &queryC, const bool &queryType)
    {
        if (l == r)
        {
            tree[node].c = queryC;
            if (queryType == true)
            {
                tree[node].sum = queryVal;
                tree[node].sumNegative = 0;
                tree[node].sumPositive = queryVal;
            } else
            {
                tree[node].sum = -queryVal;
                tree[node].sumPositive = 0;
                tree[node].sumNegative = queryVal;
            }

            tree[node].minPrefix = std::min(0LL, tree[node].sum);
            tree[node].maxSuffix = std::max(0LL, tree[node].sum);
            return;
        }
 
        int mid = l + r >> 1;
        if (queryPos <= mid) update(l, mid, 2*node, queryPos, queryVal, queryC, queryType);
        else update(mid + 1, r, 2*node + 1, queryPos, queryVal, queryC, queryType);
        tree[node].assign(tree[2*node], tree[2*node + 1]);
    }
 
    Node query(int l, int r, int node, const int &queryL, const int &queryR)
    {
        if (queryL <= l && r <= queryR)
        {
            return tree[node];
        }
 
        Node res;
        int mid = l + r >> 1;
        if (queryL <= mid) res = query(l, mid, 2*node, queryL, queryR);
        if (mid + 1 <= queryR) res = res + query(mid + 1, r, 2*node + 1, queryL, queryR);
        return res;
    }
 
    llong find(int l, int r, int node, const int &queryL, const int &queryR, const llong &k)
    {
        if (queryR < l || r < queryL)
        {
            return 0;
        }
 
        if (queryL <= l && r <= queryR && tree[node].sumPositive < k)
        {
            return -tree[node].sumPositive;
        }
 
        if (l == r)
        {
            return tree[node].c;
        }
 
        int mid = l + r >> 1;
        llong res = find(l, mid, 2*node, queryL, queryR, k);
        if (res > 0) return res;
        llong res2 = find(mid + 1, r, 2*node + 1, queryL, queryR, k + res);
        if (res2 > 0) return res2;
        else return res + res2;
    }

    void build()
    {
        build(1, q, 1);
    }
 
    void update(int pos, int val, int c, bool type)
    {
        update(1, q, 1, pos, val, c, type);
    }
 
    llong queryMaxSuffix(int l, int r)
    {
        return query(1, q, 1, l, r).maxSuffix;
    }
 
    llong queryMinPrefix(int l, int r)
    {
        return query(1, q, 1, l, r).minPrefix;
    }
 
    Node query(int l, int r)
    {
        return query(1, q, 1, l, r);
    }

    int queryMinPrefixPos(int l, int r)
    {
        return query(1, q, 1, l, r).minPrefixPos;
    }
 
    int find(int l, int r, llong k)
    {
        return find(1, q, 1, l, r, k);
    }
};
 
struct QueryAsk
{
    int time;
    llong val;
    int idx;
};
 
struct QueryAdd
{
    bool type;
    int val;
    int c;
    int idx;
};
 
int cntServices;
std::vector <QueryAdd> activate[MAXN];
std::vector <QueryAdd> deactivate[MAXN];
std::vector <QueryAsk> v[MAXN];
SegmentTree tree;
int answer[MAXN];
 
void solve()
{
    tree.build();
    for (int i = 1 ; i <= n ; ++i)
    {
        for (const QueryAdd query : activate[i])
        {
            tree.update(query.idx, query.val, query.c, query.type);
        }
 
        for (const QueryAdd query : deactivate[i])
        {
            tree.update(query.idx, 0, 0, false);
        }

        for (const auto &[time, val, idx] : v[i])
        {
            int r = tree.queryMinPrefixPos(1, time); 
            r += (tree.query(1, r).sum < 0);
            if (r > time) 
            {
                answer[idx] = 0;
                continue;
            }
            
            llong cntPositive = tree.query(r, time).sumPositive;
            llong cntNegative = tree.query(r, time).sumNegative;
 
            if (val + cntNegative > cntPositive) answer[idx] = 0;
            else answer[idx] = tree.find(r, time, val + cntNegative);
        }
    }
}
 
void input()
{
    std::cin >> n >> m >> q;
    for (int i = 1 ; i <= q ; ++i)
    {
        int qType;
        std::cin >> qType;
        if (qType == 1)
        {
            int l, r, c, val;
            std::cin >> l >> r >> c >> val;
            activate[l].push_back({true, val, c, i});
            deactivate[r + 1].push_back({true, val, c, i});
            continue;
        }
 
        if (qType == 2)
        {
            int l, r, val;
            std::cin >> l >> r >> val;
            activate[l].push_back({false, val, 0, i});
            deactivate[r + 1].push_back({false, val, 0, i});
            continue;
        }
 
        int pos;
        llong k;
        std::cin >> pos >> k;
        v[pos].push_back({i, k, ++cntServices});
    }
}
 
void print()
{
    for (int i = 1 ; i <= cntServices ; ++i)
    {
        std::cout << answer[i] << '\n';
    }
}
 
void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}
 
int main()
{
    fastIOI();
    input();
    solve();
    print();
 
    return 0;
}

Compilation message

foodcourt.cpp: In member function 'void SegmentTree::build(int, int, int)':
foodcourt.cpp:111:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  111 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'void SegmentTree::update(int, int, int, const int&, const int&, const int&, const bool&)':
foodcourt.cpp:139:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  139 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'SegmentTree::Node SegmentTree::query(int, int, int, const int&, const int&)':
foodcourt.cpp:153:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  153 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'llong SegmentTree::find(int, int, int, const int&, const int&, const llong&)':
foodcourt.cpp:176:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  176 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In function 'void readChar()':
foodcourt.cpp:20:38: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     if (++buffPos == BUFF_SIZE) fread(buff, BUFF_SIZE, 1, stdin), buffPos = 0;
      |                                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 73560 KB Output is correct
2 Correct 15 ms 73564 KB Output is correct
3 Correct 15 ms 73564 KB Output is correct
4 Correct 14 ms 73564 KB Output is correct
5 Correct 14 ms 73808 KB Output is correct
6 Correct 14 ms 73560 KB Output is correct
7 Correct 15 ms 73820 KB Output is correct
8 Correct 15 ms 73816 KB Output is correct
9 Correct 17 ms 73820 KB Output is correct
10 Correct 15 ms 73816 KB Output is correct
11 Correct 15 ms 73684 KB Output is correct
12 Correct 15 ms 73820 KB Output is correct
13 Correct 14 ms 73820 KB Output is correct
14 Correct 15 ms 73820 KB Output is correct
15 Correct 15 ms 73564 KB Output is correct
16 Correct 15 ms 73820 KB Output is correct
17 Correct 14 ms 73564 KB Output is correct
18 Correct 15 ms 73816 KB Output is correct
19 Correct 15 ms 73820 KB Output is correct
20 Correct 14 ms 73820 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 73560 KB Output is correct
2 Correct 15 ms 73564 KB Output is correct
3 Correct 15 ms 73564 KB Output is correct
4 Correct 14 ms 73564 KB Output is correct
5 Correct 14 ms 73808 KB Output is correct
6 Correct 14 ms 73560 KB Output is correct
7 Correct 15 ms 73820 KB Output is correct
8 Correct 15 ms 73816 KB Output is correct
9 Correct 17 ms 73820 KB Output is correct
10 Correct 15 ms 73816 KB Output is correct
11 Correct 15 ms 73684 KB Output is correct
12 Correct 15 ms 73820 KB Output is correct
13 Correct 14 ms 73820 KB Output is correct
14 Correct 15 ms 73820 KB Output is correct
15 Correct 15 ms 73564 KB Output is correct
16 Correct 15 ms 73820 KB Output is correct
17 Correct 14 ms 73564 KB Output is correct
18 Correct 15 ms 73816 KB Output is correct
19 Correct 15 ms 73820 KB Output is correct
20 Correct 14 ms 73820 KB Output is correct
21 Correct 15 ms 73820 KB Output is correct
22 Correct 15 ms 73820 KB Output is correct
23 Correct 15 ms 73620 KB Output is correct
24 Correct 15 ms 73820 KB Output is correct
25 Correct 14 ms 73816 KB Output is correct
26 Correct 25 ms 73820 KB Output is correct
27 Correct 15 ms 73712 KB Output is correct
28 Correct 15 ms 73820 KB Output is correct
29 Correct 15 ms 73820 KB Output is correct
30 Correct 15 ms 73820 KB Output is correct
31 Correct 15 ms 73816 KB Output is correct
32 Correct 15 ms 74016 KB Output is correct
33 Correct 16 ms 73768 KB Output is correct
34 Correct 14 ms 73716 KB Output is correct
35 Correct 16 ms 73816 KB Output is correct
36 Correct 15 ms 73820 KB Output is correct
37 Correct 14 ms 73564 KB Output is correct
38 Correct 15 ms 73628 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 76880 KB Output is correct
2 Correct 85 ms 77964 KB Output is correct
3 Correct 110 ms 78020 KB Output is correct
4 Correct 90 ms 77900 KB Output is correct
5 Correct 89 ms 78172 KB Output is correct
6 Correct 94 ms 78164 KB Output is correct
7 Correct 58 ms 76468 KB Output is correct
8 Correct 59 ms 76732 KB Output is correct
9 Correct 87 ms 78160 KB Output is correct
10 Correct 83 ms 78160 KB Output is correct
11 Correct 95 ms 78160 KB Output is correct
12 Correct 91 ms 78140 KB Output is correct
13 Correct 80 ms 77432 KB Output is correct
14 Correct 88 ms 78184 KB Output is correct
15 Correct 81 ms 78132 KB Output is correct
16 Correct 86 ms 78276 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 84560 KB Output is correct
2 Correct 371 ms 86864 KB Output is correct
3 Correct 517 ms 91688 KB Output is correct
4 Correct 358 ms 87096 KB Output is correct
5 Correct 391 ms 87260 KB Output is correct
6 Correct 477 ms 91988 KB Output is correct
7 Correct 302 ms 86048 KB Output is correct
8 Correct 308 ms 85920 KB Output is correct
9 Correct 544 ms 90728 KB Output is correct
10 Correct 518 ms 90824 KB Output is correct
11 Correct 490 ms 91752 KB Output is correct
12 Correct 479 ms 92028 KB Output is correct
13 Correct 507 ms 91732 KB Output is correct
14 Correct 470 ms 91808 KB Output is correct
15 Correct 491 ms 91724 KB Output is correct
16 Correct 475 ms 91732 KB Output is correct
17 Correct 498 ms 91852 KB Output is correct
18 Correct 513 ms 91936 KB Output is correct
19 Correct 479 ms 91732 KB Output is correct
20 Correct 486 ms 91776 KB Output is correct
21 Correct 478 ms 91936 KB Output is correct
22 Correct 492 ms 91732 KB Output is correct
23 Correct 530 ms 91680 KB Output is correct
24 Correct 485 ms 91748 KB Output is correct
25 Correct 419 ms 90932 KB Output is correct
26 Correct 484 ms 91292 KB Output is correct
27 Correct 328 ms 92496 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 73560 KB Output is correct
2 Correct 15 ms 73564 KB Output is correct
3 Correct 15 ms 73564 KB Output is correct
4 Correct 14 ms 73564 KB Output is correct
5 Correct 14 ms 73808 KB Output is correct
6 Correct 14 ms 73560 KB Output is correct
7 Correct 15 ms 73820 KB Output is correct
8 Correct 15 ms 73816 KB Output is correct
9 Correct 17 ms 73820 KB Output is correct
10 Correct 15 ms 73816 KB Output is correct
11 Correct 15 ms 73684 KB Output is correct
12 Correct 15 ms 73820 KB Output is correct
13 Correct 14 ms 73820 KB Output is correct
14 Correct 15 ms 73820 KB Output is correct
15 Correct 15 ms 73564 KB Output is correct
16 Correct 15 ms 73820 KB Output is correct
17 Correct 14 ms 73564 KB Output is correct
18 Correct 15 ms 73816 KB Output is correct
19 Correct 15 ms 73820 KB Output is correct
20 Correct 14 ms 73820 KB Output is correct
21 Correct 93 ms 76880 KB Output is correct
22 Correct 85 ms 77964 KB Output is correct
23 Correct 110 ms 78020 KB Output is correct
24 Correct 90 ms 77900 KB Output is correct
25 Correct 89 ms 78172 KB Output is correct
26 Correct 94 ms 78164 KB Output is correct
27 Correct 58 ms 76468 KB Output is correct
28 Correct 59 ms 76732 KB Output is correct
29 Correct 87 ms 78160 KB Output is correct
30 Correct 83 ms 78160 KB Output is correct
31 Correct 95 ms 78160 KB Output is correct
32 Correct 91 ms 78140 KB Output is correct
33 Correct 80 ms 77432 KB Output is correct
34 Correct 88 ms 78184 KB Output is correct
35 Correct 81 ms 78132 KB Output is correct
36 Correct 86 ms 78276 KB Output is correct
37 Correct 96 ms 77488 KB Output is correct
38 Correct 86 ms 77144 KB Output is correct
39 Correct 54 ms 76040 KB Output is correct
40 Correct 64 ms 77000 KB Output is correct
41 Correct 87 ms 77908 KB Output is correct
42 Correct 113 ms 77920 KB Output is correct
43 Correct 128 ms 77880 KB Output is correct
44 Correct 102 ms 77916 KB Output is correct
45 Correct 100 ms 77904 KB Output is correct
46 Correct 120 ms 78324 KB Output is correct
47 Correct 79 ms 76640 KB Output is correct
48 Correct 103 ms 77648 KB Output is correct
49 Correct 76 ms 76628 KB Output is correct
50 Correct 89 ms 77316 KB Output is correct
51 Correct 94 ms 77952 KB Output is correct
52 Correct 92 ms 77904 KB Output is correct
53 Correct 66 ms 77136 KB Output is correct
54 Correct 87 ms 78280 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 76324 KB Output is correct
2 Correct 104 ms 76624 KB Output is correct
3 Correct 121 ms 76640 KB Output is correct
4 Correct 107 ms 75760 KB Output is correct
5 Correct 98 ms 76208 KB Output is correct
6 Correct 147 ms 76600 KB Output is correct
7 Correct 82 ms 75776 KB Output is correct
8 Correct 67 ms 75456 KB Output is correct
9 Correct 94 ms 75856 KB Output is correct
10 Correct 82 ms 75608 KB Output is correct
11 Correct 99 ms 76228 KB Output is correct
12 Correct 104 ms 76256 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 73560 KB Output is correct
2 Correct 15 ms 73564 KB Output is correct
3 Correct 15 ms 73564 KB Output is correct
4 Correct 14 ms 73564 KB Output is correct
5 Correct 14 ms 73808 KB Output is correct
6 Correct 14 ms 73560 KB Output is correct
7 Correct 15 ms 73820 KB Output is correct
8 Correct 15 ms 73816 KB Output is correct
9 Correct 17 ms 73820 KB Output is correct
10 Correct 15 ms 73816 KB Output is correct
11 Correct 15 ms 73684 KB Output is correct
12 Correct 15 ms 73820 KB Output is correct
13 Correct 14 ms 73820 KB Output is correct
14 Correct 15 ms 73820 KB Output is correct
15 Correct 15 ms 73564 KB Output is correct
16 Correct 15 ms 73820 KB Output is correct
17 Correct 14 ms 73564 KB Output is correct
18 Correct 15 ms 73816 KB Output is correct
19 Correct 15 ms 73820 KB Output is correct
20 Correct 14 ms 73820 KB Output is correct
21 Correct 15 ms 73820 KB Output is correct
22 Correct 15 ms 73820 KB Output is correct
23 Correct 15 ms 73620 KB Output is correct
24 Correct 15 ms 73820 KB Output is correct
25 Correct 14 ms 73816 KB Output is correct
26 Correct 25 ms 73820 KB Output is correct
27 Correct 15 ms 73712 KB Output is correct
28 Correct 15 ms 73820 KB Output is correct
29 Correct 15 ms 73820 KB Output is correct
30 Correct 15 ms 73820 KB Output is correct
31 Correct 15 ms 73816 KB Output is correct
32 Correct 15 ms 74016 KB Output is correct
33 Correct 16 ms 73768 KB Output is correct
34 Correct 14 ms 73716 KB Output is correct
35 Correct 16 ms 73816 KB Output is correct
36 Correct 15 ms 73820 KB Output is correct
37 Correct 14 ms 73564 KB Output is correct
38 Correct 15 ms 73628 KB Output is correct
39 Correct 93 ms 76880 KB Output is correct
40 Correct 85 ms 77964 KB Output is correct
41 Correct 110 ms 78020 KB Output is correct
42 Correct 90 ms 77900 KB Output is correct
43 Correct 89 ms 78172 KB Output is correct
44 Correct 94 ms 78164 KB Output is correct
45 Correct 58 ms 76468 KB Output is correct
46 Correct 59 ms 76732 KB Output is correct
47 Correct 87 ms 78160 KB Output is correct
48 Correct 83 ms 78160 KB Output is correct
49 Correct 95 ms 78160 KB Output is correct
50 Correct 91 ms 78140 KB Output is correct
51 Correct 80 ms 77432 KB Output is correct
52 Correct 88 ms 78184 KB Output is correct
53 Correct 81 ms 78132 KB Output is correct
54 Correct 86 ms 78276 KB Output is correct
55 Correct 96 ms 77488 KB Output is correct
56 Correct 86 ms 77144 KB Output is correct
57 Correct 54 ms 76040 KB Output is correct
58 Correct 64 ms 77000 KB Output is correct
59 Correct 87 ms 77908 KB Output is correct
60 Correct 113 ms 77920 KB Output is correct
61 Correct 128 ms 77880 KB Output is correct
62 Correct 102 ms 77916 KB Output is correct
63 Correct 100 ms 77904 KB Output is correct
64 Correct 120 ms 78324 KB Output is correct
65 Correct 79 ms 76640 KB Output is correct
66 Correct 103 ms 77648 KB Output is correct
67 Correct 76 ms 76628 KB Output is correct
68 Correct 89 ms 77316 KB Output is correct
69 Correct 94 ms 77952 KB Output is correct
70 Correct 92 ms 77904 KB Output is correct
71 Correct 66 ms 77136 KB Output is correct
72 Correct 87 ms 78280 KB Output is correct
73 Correct 94 ms 76324 KB Output is correct
74 Correct 104 ms 76624 KB Output is correct
75 Correct 121 ms 76640 KB Output is correct
76 Correct 107 ms 75760 KB Output is correct
77 Correct 98 ms 76208 KB Output is correct
78 Correct 147 ms 76600 KB Output is correct
79 Correct 82 ms 75776 KB Output is correct
80 Correct 67 ms 75456 KB Output is correct
81 Correct 94 ms 75856 KB Output is correct
82 Correct 82 ms 75608 KB Output is correct
83 Correct 99 ms 76228 KB Output is correct
84 Correct 104 ms 76256 KB Output is correct
85 Correct 121 ms 77892 KB Output is correct
86 Correct 125 ms 78220 KB Output is correct
87 Correct 113 ms 77792 KB Output is correct
88 Correct 118 ms 78500 KB Output is correct
89 Correct 73 ms 76884 KB Output is correct
90 Correct 120 ms 78420 KB Output is correct
91 Correct 99 ms 77532 KB Output is correct
92 Correct 82 ms 77328 KB Output is correct
93 Correct 121 ms 78420 KB Output is correct
94 Correct 99 ms 78416 KB Output is correct
95 Correct 104 ms 78284 KB Output is correct
96 Correct 130 ms 78400 KB Output is correct
97 Correct 107 ms 78396 KB Output is correct
98 Correct 90 ms 77684 KB Output is correct
99 Correct 89 ms 77116 KB Output is correct
100 Correct 105 ms 77228 KB Output is correct
101 Correct 96 ms 78172 KB Output is correct
102 Correct 78 ms 78732 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 73560 KB Output is correct
2 Correct 15 ms 73564 KB Output is correct
3 Correct 15 ms 73564 KB Output is correct
4 Correct 14 ms 73564 KB Output is correct
5 Correct 14 ms 73808 KB Output is correct
6 Correct 14 ms 73560 KB Output is correct
7 Correct 15 ms 73820 KB Output is correct
8 Correct 15 ms 73816 KB Output is correct
9 Correct 17 ms 73820 KB Output is correct
10 Correct 15 ms 73816 KB Output is correct
11 Correct 15 ms 73684 KB Output is correct
12 Correct 15 ms 73820 KB Output is correct
13 Correct 14 ms 73820 KB Output is correct
14 Correct 15 ms 73820 KB Output is correct
15 Correct 15 ms 73564 KB Output is correct
16 Correct 15 ms 73820 KB Output is correct
17 Correct 14 ms 73564 KB Output is correct
18 Correct 15 ms 73816 KB Output is correct
19 Correct 15 ms 73820 KB Output is correct
20 Correct 14 ms 73820 KB Output is correct
21 Correct 15 ms 73820 KB Output is correct
22 Correct 15 ms 73820 KB Output is correct
23 Correct 15 ms 73620 KB Output is correct
24 Correct 15 ms 73820 KB Output is correct
25 Correct 14 ms 73816 KB Output is correct
26 Correct 25 ms 73820 KB Output is correct
27 Correct 15 ms 73712 KB Output is correct
28 Correct 15 ms 73820 KB Output is correct
29 Correct 15 ms 73820 KB Output is correct
30 Correct 15 ms 73820 KB Output is correct
31 Correct 15 ms 73816 KB Output is correct
32 Correct 15 ms 74016 KB Output is correct
33 Correct 16 ms 73768 KB Output is correct
34 Correct 14 ms 73716 KB Output is correct
35 Correct 16 ms 73816 KB Output is correct
36 Correct 15 ms 73820 KB Output is correct
37 Correct 14 ms 73564 KB Output is correct
38 Correct 15 ms 73628 KB Output is correct
39 Correct 93 ms 76880 KB Output is correct
40 Correct 85 ms 77964 KB Output is correct
41 Correct 110 ms 78020 KB Output is correct
42 Correct 90 ms 77900 KB Output is correct
43 Correct 89 ms 78172 KB Output is correct
44 Correct 94 ms 78164 KB Output is correct
45 Correct 58 ms 76468 KB Output is correct
46 Correct 59 ms 76732 KB Output is correct
47 Correct 87 ms 78160 KB Output is correct
48 Correct 83 ms 78160 KB Output is correct
49 Correct 95 ms 78160 KB Output is correct
50 Correct 91 ms 78140 KB Output is correct
51 Correct 80 ms 77432 KB Output is correct
52 Correct 88 ms 78184 KB Output is correct
53 Correct 81 ms 78132 KB Output is correct
54 Correct 86 ms 78276 KB Output is correct
55 Correct 489 ms 84560 KB Output is correct
56 Correct 371 ms 86864 KB Output is correct
57 Correct 517 ms 91688 KB Output is correct
58 Correct 358 ms 87096 KB Output is correct
59 Correct 391 ms 87260 KB Output is correct
60 Correct 477 ms 91988 KB Output is correct
61 Correct 302 ms 86048 KB Output is correct
62 Correct 308 ms 85920 KB Output is correct
63 Correct 544 ms 90728 KB Output is correct
64 Correct 518 ms 90824 KB Output is correct
65 Correct 490 ms 91752 KB Output is correct
66 Correct 479 ms 92028 KB Output is correct
67 Correct 507 ms 91732 KB Output is correct
68 Correct 470 ms 91808 KB Output is correct
69 Correct 491 ms 91724 KB Output is correct
70 Correct 475 ms 91732 KB Output is correct
71 Correct 498 ms 91852 KB Output is correct
72 Correct 513 ms 91936 KB Output is correct
73 Correct 479 ms 91732 KB Output is correct
74 Correct 486 ms 91776 KB Output is correct
75 Correct 478 ms 91936 KB Output is correct
76 Correct 492 ms 91732 KB Output is correct
77 Correct 530 ms 91680 KB Output is correct
78 Correct 485 ms 91748 KB Output is correct
79 Correct 419 ms 90932 KB Output is correct
80 Correct 484 ms 91292 KB Output is correct
81 Correct 328 ms 92496 KB Output is correct
82 Correct 96 ms 77488 KB Output is correct
83 Correct 86 ms 77144 KB Output is correct
84 Correct 54 ms 76040 KB Output is correct
85 Correct 64 ms 77000 KB Output is correct
86 Correct 87 ms 77908 KB Output is correct
87 Correct 113 ms 77920 KB Output is correct
88 Correct 128 ms 77880 KB Output is correct
89 Correct 102 ms 77916 KB Output is correct
90 Correct 100 ms 77904 KB Output is correct
91 Correct 120 ms 78324 KB Output is correct
92 Correct 79 ms 76640 KB Output is correct
93 Correct 103 ms 77648 KB Output is correct
94 Correct 76 ms 76628 KB Output is correct
95 Correct 89 ms 77316 KB Output is correct
96 Correct 94 ms 77952 KB Output is correct
97 Correct 92 ms 77904 KB Output is correct
98 Correct 66 ms 77136 KB Output is correct
99 Correct 87 ms 78280 KB Output is correct
100 Correct 94 ms 76324 KB Output is correct
101 Correct 104 ms 76624 KB Output is correct
102 Correct 121 ms 76640 KB Output is correct
103 Correct 107 ms 75760 KB Output is correct
104 Correct 98 ms 76208 KB Output is correct
105 Correct 147 ms 76600 KB Output is correct
106 Correct 82 ms 75776 KB Output is correct
107 Correct 67 ms 75456 KB Output is correct
108 Correct 94 ms 75856 KB Output is correct
109 Correct 82 ms 75608 KB Output is correct
110 Correct 99 ms 76228 KB Output is correct
111 Correct 104 ms 76256 KB Output is correct
112 Correct 121 ms 77892 KB Output is correct
113 Correct 125 ms 78220 KB Output is correct
114 Correct 113 ms 77792 KB Output is correct
115 Correct 118 ms 78500 KB Output is correct
116 Correct 73 ms 76884 KB Output is correct
117 Correct 120 ms 78420 KB Output is correct
118 Correct 99 ms 77532 KB Output is correct
119 Correct 82 ms 77328 KB Output is correct
120 Correct 121 ms 78420 KB Output is correct
121 Correct 99 ms 78416 KB Output is correct
122 Correct 104 ms 78284 KB Output is correct
123 Correct 130 ms 78400 KB Output is correct
124 Correct 107 ms 78396 KB Output is correct
125 Correct 90 ms 77684 KB Output is correct
126 Correct 89 ms 77116 KB Output is correct
127 Correct 105 ms 77228 KB Output is correct
128 Correct 96 ms 78172 KB Output is correct
129 Correct 78 ms 78732 KB Output is correct
130 Correct 581 ms 92036 KB Output is correct
131 Correct 409 ms 87124 KB Output is correct
132 Correct 596 ms 92060 KB Output is correct
133 Correct 450 ms 91896 KB Output is correct
134 Correct 418 ms 89936 KB Output is correct
135 Correct 479 ms 92752 KB Output is correct
136 Correct 502 ms 91728 KB Output is correct
137 Correct 510 ms 91728 KB Output is correct
138 Correct 461 ms 92376 KB Output is correct
139 Correct 489 ms 92496 KB Output is correct
140 Correct 478 ms 92240 KB Output is correct
141 Correct 492 ms 92380 KB Output is correct
142 Correct 516 ms 92244 KB Output is correct
143 Correct 517 ms 92304 KB Output is correct
144 Correct 564 ms 92408 KB Output is correct
145 Correct 494 ms 92400 KB Output is correct
146 Correct 526 ms 92376 KB Output is correct
147 Correct 508 ms 92340 KB Output is correct
148 Correct 508 ms 92336 KB Output is correct
149 Correct 519 ms 92176 KB Output is correct
150 Correct 315 ms 89520 KB Output is correct
151 Correct 447 ms 91988 KB Output is correct
152 Correct 459 ms 91896 KB Output is correct
153 Correct 343 ms 93380 KB Output is correct