oj.uz

답안 #930806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930806 2024-02-20T12:43:05 Z boris_mihov 푸드 코트 (JOI21_foodcourt) C++17
68 / 100
 1000 ms 77996 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;
        llong sum;
        int c;

        Node()
        {
            maxSuffix = minPrefix = 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);
            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);
            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);
        }
    };

    Node tree[4*MAXN];
    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 += 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 update(int pos, int val, int c, bool type)
    {
        update(1, q, 1, pos, val, c, type);
    }

    Node query(int l, int r)
    {
        return query(1, q, 1, l, r);
    }

    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()
{
    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 l = 0, r = time + 1, mid;
            while (l < r - 1)
            {
                mid = l + r >> 1;
                llong res = tree.query(mid, time).minPrefix;
                if (mid > 1) res += tree.query(1, mid - 1).maxSuffix;
                if (res >= 0) r = mid;
                else l = mid;
            }

            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()
{
    readInt(n);
    readInt(m);
    readInt(q);
    for (int i = 1 ; i <= q ; ++i)
    {
        int qType;
        readInt(qType);
        if (qType == 1)
        {
            int l, r, c, val;
            readInt(l);
            readInt(r);
            readInt(c);
            readInt(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;
            readInt(l);
            readInt(r);
            readInt(val);
            activate[l].push_back({false, val, 0, i});
            deactivate[r + 1].push_back({false, val, 0, i});
            continue;
        }

        assert(qType == 3);
        int pos;
        llong k;
        readInt(pos);
        readLong(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::update(int, int, int, const int&, const int&, const int&, const bool&)':
foodcourt.cpp:105:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  105 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'SegmentTree::Node SegmentTree::query(int, int, int, const int&, const int&)':
foodcourt.cpp:119:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  119 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'llong SegmentTree::find(int, int, int, const int&, const int&, const llong&)':
foodcourt.cpp:142:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  142 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In function 'void solve()':
foodcourt.cpp:207:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  207 |                 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

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 65712 KB Output is correct
2 Correct 15 ms 65816 KB Output is correct
3 Correct 15 ms 65948 KB Output is correct
4 Correct 15 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 14 ms 65884 KB Output is correct
7 Correct 15 ms 65880 KB Output is correct
8 Correct 15 ms 65884 KB Output is correct
9 Correct 16 ms 66000 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 15 ms 65884 KB Output is correct
12 Correct 16 ms 65884 KB Output is correct
13 Correct 17 ms 65884 KB Output is correct
14 Correct 19 ms 66140 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 15 ms 65884 KB Output is correct
17 Correct 15 ms 65884 KB Output is correct
18 Correct 15 ms 66244 KB Output is correct
19 Correct 15 ms 65884 KB Output is correct
20 Correct 14 ms 65884 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 65712 KB Output is correct
2 Correct 15 ms 65816 KB Output is correct
3 Correct 15 ms 65948 KB Output is correct
4 Correct 15 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 14 ms 65884 KB Output is correct
7 Correct 15 ms 65880 KB Output is correct
8 Correct 15 ms 65884 KB Output is correct
9 Correct 16 ms 66000 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 15 ms 65884 KB Output is correct
12 Correct 16 ms 65884 KB Output is correct
13 Correct 17 ms 65884 KB Output is correct
14 Correct 19 ms 66140 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 15 ms 65884 KB Output is correct
17 Correct 15 ms 65884 KB Output is correct
18 Correct 15 ms 66244 KB Output is correct
19 Correct 15 ms 65884 KB Output is correct
20 Correct 14 ms 65884 KB Output is correct
21 Correct 17 ms 65880 KB Output is correct
22 Correct 17 ms 65792 KB Output is correct
23 Correct 16 ms 65884 KB Output is correct
24 Correct 15 ms 65868 KB Output is correct
25 Correct 14 ms 65804 KB Output is correct
26 Correct 14 ms 65760 KB Output is correct
27 Correct 16 ms 65792 KB Output is correct
28 Correct 15 ms 66136 KB Output is correct
29 Correct 16 ms 65884 KB Output is correct
30 Correct 17 ms 65884 KB Output is correct
31 Correct 15 ms 65968 KB Output is correct
32 Correct 16 ms 65884 KB Output is correct
33 Correct 15 ms 65884 KB Output is correct
34 Correct 15 ms 65836 KB Output is correct
35 Correct 16 ms 65884 KB Output is correct
36 Correct 16 ms 65780 KB Output is correct
37 Correct 15 ms 65884 KB Output is correct
38 Correct 15 ms 66056 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 68956 KB Output is correct
2 Correct 139 ms 69180 KB Output is correct
3 Correct 162 ms 69092 KB Output is correct
4 Correct 164 ms 69088 KB Output is correct
5 Correct 144 ms 69204 KB Output is correct
6 Correct 135 ms 69172 KB Output is correct
7 Correct 118 ms 68020 KB Output is correct
8 Correct 118 ms 68292 KB Output is correct
9 Correct 143 ms 68952 KB Output is correct
10 Correct 136 ms 69132 KB Output is correct
11 Correct 143 ms 69140 KB Output is correct
12 Correct 139 ms 69152 KB Output is correct
13 Correct 140 ms 68696 KB Output is correct
14 Correct 185 ms 69268 KB Output is correct
15 Correct 106 ms 69112 KB Output is correct
16 Correct 111 ms 69252 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 864 ms 76884 KB Output is correct
2 Correct 705 ms 74832 KB Output is correct
3 Correct 948 ms 77764 KB Output is correct
4 Correct 507 ms 74952 KB Output is correct
5 Correct 526 ms 74832 KB Output is correct
6 Correct 766 ms 77996 KB Output is correct
7 Correct 560 ms 76836 KB Output is correct
8 Correct 616 ms 74112 KB Output is correct
9 Execution timed out 1016 ms 76760 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 65712 KB Output is correct
2 Correct 15 ms 65816 KB Output is correct
3 Correct 15 ms 65948 KB Output is correct
4 Correct 15 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 14 ms 65884 KB Output is correct
7 Correct 15 ms 65880 KB Output is correct
8 Correct 15 ms 65884 KB Output is correct
9 Correct 16 ms 66000 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 15 ms 65884 KB Output is correct
12 Correct 16 ms 65884 KB Output is correct
13 Correct 17 ms 65884 KB Output is correct
14 Correct 19 ms 66140 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 15 ms 65884 KB Output is correct
17 Correct 15 ms 65884 KB Output is correct
18 Correct 15 ms 66244 KB Output is correct
19 Correct 15 ms 65884 KB Output is correct
20 Correct 14 ms 65884 KB Output is correct
21 Correct 170 ms 68956 KB Output is correct
22 Correct 139 ms 69180 KB Output is correct
23 Correct 162 ms 69092 KB Output is correct
24 Correct 164 ms 69088 KB Output is correct
25 Correct 144 ms 69204 KB Output is correct
26 Correct 135 ms 69172 KB Output is correct
27 Correct 118 ms 68020 KB Output is correct
28 Correct 118 ms 68292 KB Output is correct
29 Correct 143 ms 68952 KB Output is correct
30 Correct 136 ms 69132 KB Output is correct
31 Correct 143 ms 69140 KB Output is correct
32 Correct 139 ms 69152 KB Output is correct
33 Correct 140 ms 68696 KB Output is correct
34 Correct 185 ms 69268 KB Output is correct
35 Correct 106 ms 69112 KB Output is correct
36 Correct 111 ms 69252 KB Output is correct
37 Correct 163 ms 68736 KB Output is correct
38 Correct 117 ms 68444 KB Output is correct
39 Correct 84 ms 67852 KB Output is correct
40 Correct 101 ms 68556 KB Output is correct
41 Correct 148 ms 68948 KB Output is correct
42 Correct 149 ms 68952 KB Output is correct
43 Correct 159 ms 69080 KB Output is correct
44 Correct 148 ms 68956 KB Output is correct
45 Correct 146 ms 68944 KB Output is correct
46 Correct 147 ms 68944 KB Output is correct
47 Correct 150 ms 68080 KB Output is correct
48 Correct 169 ms 69080 KB Output is correct
49 Correct 94 ms 68188 KB Output is correct
50 Correct 119 ms 68688 KB Output is correct
51 Correct 137 ms 69200 KB Output is correct
52 Correct 137 ms 69200 KB Output is correct
53 Correct 91 ms 68804 KB Output is correct
54 Correct 115 ms 69248 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 68692 KB Output is correct
2 Correct 231 ms 68944 KB Output is correct
3 Correct 213 ms 68948 KB Output is correct
4 Correct 142 ms 67932 KB Output is correct
5 Correct 180 ms 68472 KB Output is correct
6 Correct 212 ms 68788 KB Output is correct
7 Correct 140 ms 67956 KB Output is correct
8 Correct 131 ms 67724 KB Output is correct
9 Correct 200 ms 68128 KB Output is correct
10 Correct 141 ms 67928 KB Output is correct
11 Correct 198 ms 68496 KB Output is correct
12 Correct 213 ms 68524 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 65712 KB Output is correct
2 Correct 15 ms 65816 KB Output is correct
3 Correct 15 ms 65948 KB Output is correct
4 Correct 15 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 14 ms 65884 KB Output is correct
7 Correct 15 ms 65880 KB Output is correct
8 Correct 15 ms 65884 KB Output is correct
9 Correct 16 ms 66000 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 15 ms 65884 KB Output is correct
12 Correct 16 ms 65884 KB Output is correct
13 Correct 17 ms 65884 KB Output is correct
14 Correct 19 ms 66140 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 15 ms 65884 KB Output is correct
17 Correct 15 ms 65884 KB Output is correct
18 Correct 15 ms 66244 KB Output is correct
19 Correct 15 ms 65884 KB Output is correct
20 Correct 14 ms 65884 KB Output is correct
21 Correct 17 ms 65880 KB Output is correct
22 Correct 17 ms 65792 KB Output is correct
23 Correct 16 ms 65884 KB Output is correct
24 Correct 15 ms 65868 KB Output is correct
25 Correct 14 ms 65804 KB Output is correct
26 Correct 14 ms 65760 KB Output is correct
27 Correct 16 ms 65792 KB Output is correct
28 Correct 15 ms 66136 KB Output is correct
29 Correct 16 ms 65884 KB Output is correct
30 Correct 17 ms 65884 KB Output is correct
31 Correct 15 ms 65968 KB Output is correct
32 Correct 16 ms 65884 KB Output is correct
33 Correct 15 ms 65884 KB Output is correct
34 Correct 15 ms 65836 KB Output is correct
35 Correct 16 ms 65884 KB Output is correct
36 Correct 16 ms 65780 KB Output is correct
37 Correct 15 ms 65884 KB Output is correct
38 Correct 15 ms 66056 KB Output is correct
39 Correct 170 ms 68956 KB Output is correct
40 Correct 139 ms 69180 KB Output is correct
41 Correct 162 ms 69092 KB Output is correct
42 Correct 164 ms 69088 KB Output is correct
43 Correct 144 ms 69204 KB Output is correct
44 Correct 135 ms 69172 KB Output is correct
45 Correct 118 ms 68020 KB Output is correct
46 Correct 118 ms 68292 KB Output is correct
47 Correct 143 ms 68952 KB Output is correct
48 Correct 136 ms 69132 KB Output is correct
49 Correct 143 ms 69140 KB Output is correct
50 Correct 139 ms 69152 KB Output is correct
51 Correct 140 ms 68696 KB Output is correct
52 Correct 185 ms 69268 KB Output is correct
53 Correct 106 ms 69112 KB Output is correct
54 Correct 111 ms 69252 KB Output is correct
55 Correct 163 ms 68736 KB Output is correct
56 Correct 117 ms 68444 KB Output is correct
57 Correct 84 ms 67852 KB Output is correct
58 Correct 101 ms 68556 KB Output is correct
59 Correct 148 ms 68948 KB Output is correct
60 Correct 149 ms 68952 KB Output is correct
61 Correct 159 ms 69080 KB Output is correct
62 Correct 148 ms 68956 KB Output is correct
63 Correct 146 ms 68944 KB Output is correct
64 Correct 147 ms 68944 KB Output is correct
65 Correct 150 ms 68080 KB Output is correct
66 Correct 169 ms 69080 KB Output is correct
67 Correct 94 ms 68188 KB Output is correct
68 Correct 119 ms 68688 KB Output is correct
69 Correct 137 ms 69200 KB Output is correct
70 Correct 137 ms 69200 KB Output is correct
71 Correct 91 ms 68804 KB Output is correct
72 Correct 115 ms 69248 KB Output is correct
73 Correct 198 ms 68692 KB Output is correct
74 Correct 231 ms 68944 KB Output is correct
75 Correct 213 ms 68948 KB Output is correct
76 Correct 142 ms 67932 KB Output is correct
77 Correct 180 ms 68472 KB Output is correct
78 Correct 212 ms 68788 KB Output is correct
79 Correct 140 ms 67956 KB Output is correct
80 Correct 131 ms 67724 KB Output is correct
81 Correct 200 ms 68128 KB Output is correct
82 Correct 141 ms 67928 KB Output is correct
83 Correct 198 ms 68496 KB Output is correct
84 Correct 213 ms 68524 KB Output is correct
85 Correct 166 ms 68696 KB Output is correct
86 Correct 181 ms 69152 KB Output is correct
87 Correct 124 ms 68944 KB Output is correct
88 Correct 145 ms 68944 KB Output is correct
89 Correct 91 ms 67932 KB Output is correct
90 Correct 146 ms 69204 KB Output is correct
91 Correct 140 ms 68692 KB Output is correct
92 Correct 117 ms 68380 KB Output is correct
93 Correct 152 ms 68956 KB Output is correct
94 Correct 184 ms 68956 KB Output is correct
95 Correct 142 ms 68988 KB Output is correct
96 Correct 149 ms 69076 KB Output is correct
97 Correct 150 ms 68956 KB Output is correct
98 Correct 146 ms 68600 KB Output is correct
99 Correct 148 ms 68152 KB Output is correct
100 Correct 143 ms 68236 KB Output is correct
101 Correct 185 ms 69072 KB Output is correct
102 Correct 109 ms 69360 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 65712 KB Output is correct
2 Correct 15 ms 65816 KB Output is correct
3 Correct 15 ms 65948 KB Output is correct
4 Correct 15 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 14 ms 65884 KB Output is correct
7 Correct 15 ms 65880 KB Output is correct
8 Correct 15 ms 65884 KB Output is correct
9 Correct 16 ms 66000 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 15 ms 65884 KB Output is correct
12 Correct 16 ms 65884 KB Output is correct
13 Correct 17 ms 65884 KB Output is correct
14 Correct 19 ms 66140 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 15 ms 65884 KB Output is correct
17 Correct 15 ms 65884 KB Output is correct
18 Correct 15 ms 66244 KB Output is correct
19 Correct 15 ms 65884 KB Output is correct
20 Correct 14 ms 65884 KB Output is correct
21 Correct 17 ms 65880 KB Output is correct
22 Correct 17 ms 65792 KB Output is correct
23 Correct 16 ms 65884 KB Output is correct
24 Correct 15 ms 65868 KB Output is correct
25 Correct 14 ms 65804 KB Output is correct
26 Correct 14 ms 65760 KB Output is correct
27 Correct 16 ms 65792 KB Output is correct
28 Correct 15 ms 66136 KB Output is correct
29 Correct 16 ms 65884 KB Output is correct
30 Correct 17 ms 65884 KB Output is correct
31 Correct 15 ms 65968 KB Output is correct
32 Correct 16 ms 65884 KB Output is correct
33 Correct 15 ms 65884 KB Output is correct
34 Correct 15 ms 65836 KB Output is correct
35 Correct 16 ms 65884 KB Output is correct
36 Correct 16 ms 65780 KB Output is correct
37 Correct 15 ms 65884 KB Output is correct
38 Correct 15 ms 66056 KB Output is correct
39 Correct 170 ms 68956 KB Output is correct
40 Correct 139 ms 69180 KB Output is correct
41 Correct 162 ms 69092 KB Output is correct
42 Correct 164 ms 69088 KB Output is correct
43 Correct 144 ms 69204 KB Output is correct
44 Correct 135 ms 69172 KB Output is correct
45 Correct 118 ms 68020 KB Output is correct
46 Correct 118 ms 68292 KB Output is correct
47 Correct 143 ms 68952 KB Output is correct
48 Correct 136 ms 69132 KB Output is correct
49 Correct 143 ms 69140 KB Output is correct
50 Correct 139 ms 69152 KB Output is correct
51 Correct 140 ms 68696 KB Output is correct
52 Correct 185 ms 69268 KB Output is correct
53 Correct 106 ms 69112 KB Output is correct
54 Correct 111 ms 69252 KB Output is correct
55 Correct 864 ms 76884 KB Output is correct
56 Correct 705 ms 74832 KB Output is correct
57 Correct 948 ms 77764 KB Output is correct
58 Correct 507 ms 74952 KB Output is correct
59 Correct 526 ms 74832 KB Output is correct
60 Correct 766 ms 77996 KB Output is correct
61 Correct 560 ms 76836 KB Output is correct
62 Correct 616 ms 74112 KB Output is correct
63 Execution timed out 1016 ms 76760 KB Time limit exceeded
64 Halted 0 ms 0 KB -