oj.uz

답안 #930805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930805 2024-02-20T12:39:12 Z boris_mihov 푸드 코트 (JOI21_foodcourt) C++17
68 / 100
 1000 ms 84280 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;
        }   

        friend Node operator + (const Node &left, const Node &right)
        {
            Node res;
            res.sum = left.sum + right.sum;
            res.sumPositive = left.sumPositive + right.sumPositive;
            res.sumNegative = left.sumNegative + right.sumNegative;
            res.minPrefix = std::min(left.minPrefix, left.sum + right.minPrefix);
            res.maxSuffix = std::max(right.maxSuffix, right.sum + left.maxSuffix);
            res.c = std::max(left.c, right.c);
            return res;
        }
    };

    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] = 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 = 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 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:96:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   96 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'SegmentTree::Node SegmentTree::query(int, int, int, const int&, const int&)':
foodcourt.cpp:110:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  110 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'llong SegmentTree::find(int, int, int, const int&, const int&, const llong&)':
foodcourt.cpp:133:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  133 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In function 'void solve()':
foodcourt.cpp:198:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  198 |                 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 21 ms 65872 KB Output is correct
2 Correct 16 ms 65884 KB Output is correct
3 Correct 14 ms 65784 KB Output is correct
4 Correct 16 ms 65764 KB Output is correct
5 Correct 15 ms 65988 KB Output is correct
6 Correct 15 ms 65884 KB Output is correct
7 Correct 15 ms 65996 KB Output is correct
8 Correct 15 ms 65880 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 18 ms 65948 KB Output is correct
12 Correct 15 ms 65948 KB Output is correct
13 Correct 15 ms 65884 KB Output is correct
14 Correct 16 ms 66012 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 16 ms 65884 KB Output is correct
17 Correct 17 ms 65884 KB Output is correct
18 Correct 16 ms 65980 KB Output is correct
19 Correct 15 ms 65784 KB Output is correct
20 Correct 16 ms 65880 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 65872 KB Output is correct
2 Correct 16 ms 65884 KB Output is correct
3 Correct 14 ms 65784 KB Output is correct
4 Correct 16 ms 65764 KB Output is correct
5 Correct 15 ms 65988 KB Output is correct
6 Correct 15 ms 65884 KB Output is correct
7 Correct 15 ms 65996 KB Output is correct
8 Correct 15 ms 65880 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 18 ms 65948 KB Output is correct
12 Correct 15 ms 65948 KB Output is correct
13 Correct 15 ms 65884 KB Output is correct
14 Correct 16 ms 66012 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 16 ms 65884 KB Output is correct
17 Correct 17 ms 65884 KB Output is correct
18 Correct 16 ms 65980 KB Output is correct
19 Correct 15 ms 65784 KB Output is correct
20 Correct 16 ms 65880 KB Output is correct
21 Correct 16 ms 65884 KB Output is correct
22 Correct 16 ms 66008 KB Output is correct
23 Correct 16 ms 65880 KB Output is correct
24 Correct 16 ms 65884 KB Output is correct
25 Correct 15 ms 65884 KB Output is correct
26 Correct 15 ms 65880 KB Output is correct
27 Correct 16 ms 65880 KB Output is correct
28 Correct 15 ms 65816 KB Output is correct
29 Correct 16 ms 65884 KB Output is correct
30 Correct 15 ms 65884 KB Output is correct
31 Correct 16 ms 65976 KB Output is correct
32 Correct 16 ms 65884 KB Output is correct
33 Correct 15 ms 66016 KB Output is correct
34 Correct 15 ms 65884 KB Output is correct
35 Correct 16 ms 65972 KB Output is correct
36 Correct 18 ms 65880 KB Output is correct
37 Correct 14 ms 65884 KB Output is correct
38 Correct 15 ms 65884 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 69344 KB Output is correct
2 Correct 145 ms 69432 KB Output is correct
3 Correct 180 ms 69092 KB Output is correct
4 Correct 170 ms 68952 KB Output is correct
5 Correct 149 ms 69184 KB Output is correct
6 Correct 156 ms 69208 KB Output is correct
7 Correct 116 ms 68016 KB Output is correct
8 Correct 123 ms 68292 KB Output is correct
9 Correct 144 ms 69164 KB Output is correct
10 Correct 153 ms 69212 KB Output is correct
11 Correct 142 ms 69200 KB Output is correct
12 Correct 141 ms 69160 KB Output is correct
13 Correct 151 ms 68988 KB Output is correct
14 Correct 165 ms 68956 KB Output is correct
15 Correct 108 ms 68944 KB Output is correct
16 Correct 119 ms 69256 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 884 ms 76820 KB Output is correct
2 Correct 673 ms 74872 KB Output is correct
3 Correct 967 ms 77936 KB Output is correct
4 Correct 521 ms 79424 KB Output is correct
5 Correct 572 ms 79436 KB Output is correct
6 Correct 795 ms 84280 KB Output is correct
7 Correct 596 ms 78616 KB Output is correct
8 Correct 644 ms 78572 KB Output is correct
9 Execution timed out 1022 ms 82988 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 65872 KB Output is correct
2 Correct 16 ms 65884 KB Output is correct
3 Correct 14 ms 65784 KB Output is correct
4 Correct 16 ms 65764 KB Output is correct
5 Correct 15 ms 65988 KB Output is correct
6 Correct 15 ms 65884 KB Output is correct
7 Correct 15 ms 65996 KB Output is correct
8 Correct 15 ms 65880 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 18 ms 65948 KB Output is correct
12 Correct 15 ms 65948 KB Output is correct
13 Correct 15 ms 65884 KB Output is correct
14 Correct 16 ms 66012 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 16 ms 65884 KB Output is correct
17 Correct 17 ms 65884 KB Output is correct
18 Correct 16 ms 65980 KB Output is correct
19 Correct 15 ms 65784 KB Output is correct
20 Correct 16 ms 65880 KB Output is correct
21 Correct 175 ms 69344 KB Output is correct
22 Correct 145 ms 69432 KB Output is correct
23 Correct 180 ms 69092 KB Output is correct
24 Correct 170 ms 68952 KB Output is correct
25 Correct 149 ms 69184 KB Output is correct
26 Correct 156 ms 69208 KB Output is correct
27 Correct 116 ms 68016 KB Output is correct
28 Correct 123 ms 68292 KB Output is correct
29 Correct 144 ms 69164 KB Output is correct
30 Correct 153 ms 69212 KB Output is correct
31 Correct 142 ms 69200 KB Output is correct
32 Correct 141 ms 69160 KB Output is correct
33 Correct 151 ms 68988 KB Output is correct
34 Correct 165 ms 68956 KB Output is correct
35 Correct 108 ms 68944 KB Output is correct
36 Correct 119 ms 69256 KB Output is correct
37 Correct 176 ms 68732 KB Output is correct
38 Correct 122 ms 68444 KB Output is correct
39 Correct 88 ms 67852 KB Output is correct
40 Correct 108 ms 68556 KB Output is correct
41 Correct 150 ms 69072 KB Output is correct
42 Correct 147 ms 68944 KB Output is correct
43 Correct 157 ms 69076 KB Output is correct
44 Correct 174 ms 69200 KB Output is correct
45 Correct 153 ms 69076 KB Output is correct
46 Correct 157 ms 68956 KB Output is correct
47 Correct 160 ms 68092 KB Output is correct
48 Correct 182 ms 69152 KB Output is correct
49 Correct 96 ms 68180 KB Output is correct
50 Correct 120 ms 68696 KB Output is correct
51 Correct 138 ms 69200 KB Output is correct
52 Correct 142 ms 69204 KB Output is correct
53 Correct 87 ms 68440 KB Output is correct
54 Correct 113 ms 69212 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 68692 KB Output is correct
2 Correct 225 ms 68948 KB Output is correct
3 Correct 223 ms 68948 KB Output is correct
4 Correct 151 ms 68024 KB Output is correct
5 Correct 191 ms 68436 KB Output is correct
6 Correct 220 ms 68948 KB Output is correct
7 Correct 148 ms 68004 KB Output is correct
8 Correct 141 ms 67768 KB Output is correct
9 Correct 198 ms 68128 KB Output is correct
10 Correct 142 ms 67856 KB Output is correct
11 Correct 224 ms 68492 KB Output is correct
12 Correct 213 ms 68516 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 65872 KB Output is correct
2 Correct 16 ms 65884 KB Output is correct
3 Correct 14 ms 65784 KB Output is correct
4 Correct 16 ms 65764 KB Output is correct
5 Correct 15 ms 65988 KB Output is correct
6 Correct 15 ms 65884 KB Output is correct
7 Correct 15 ms 65996 KB Output is correct
8 Correct 15 ms 65880 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 18 ms 65948 KB Output is correct
12 Correct 15 ms 65948 KB Output is correct
13 Correct 15 ms 65884 KB Output is correct
14 Correct 16 ms 66012 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 16 ms 65884 KB Output is correct
17 Correct 17 ms 65884 KB Output is correct
18 Correct 16 ms 65980 KB Output is correct
19 Correct 15 ms 65784 KB Output is correct
20 Correct 16 ms 65880 KB Output is correct
21 Correct 16 ms 65884 KB Output is correct
22 Correct 16 ms 66008 KB Output is correct
23 Correct 16 ms 65880 KB Output is correct
24 Correct 16 ms 65884 KB Output is correct
25 Correct 15 ms 65884 KB Output is correct
26 Correct 15 ms 65880 KB Output is correct
27 Correct 16 ms 65880 KB Output is correct
28 Correct 15 ms 65816 KB Output is correct
29 Correct 16 ms 65884 KB Output is correct
30 Correct 15 ms 65884 KB Output is correct
31 Correct 16 ms 65976 KB Output is correct
32 Correct 16 ms 65884 KB Output is correct
33 Correct 15 ms 66016 KB Output is correct
34 Correct 15 ms 65884 KB Output is correct
35 Correct 16 ms 65972 KB Output is correct
36 Correct 18 ms 65880 KB Output is correct
37 Correct 14 ms 65884 KB Output is correct
38 Correct 15 ms 65884 KB Output is correct
39 Correct 175 ms 69344 KB Output is correct
40 Correct 145 ms 69432 KB Output is correct
41 Correct 180 ms 69092 KB Output is correct
42 Correct 170 ms 68952 KB Output is correct
43 Correct 149 ms 69184 KB Output is correct
44 Correct 156 ms 69208 KB Output is correct
45 Correct 116 ms 68016 KB Output is correct
46 Correct 123 ms 68292 KB Output is correct
47 Correct 144 ms 69164 KB Output is correct
48 Correct 153 ms 69212 KB Output is correct
49 Correct 142 ms 69200 KB Output is correct
50 Correct 141 ms 69160 KB Output is correct
51 Correct 151 ms 68988 KB Output is correct
52 Correct 165 ms 68956 KB Output is correct
53 Correct 108 ms 68944 KB Output is correct
54 Correct 119 ms 69256 KB Output is correct
55 Correct 176 ms 68732 KB Output is correct
56 Correct 122 ms 68444 KB Output is correct
57 Correct 88 ms 67852 KB Output is correct
58 Correct 108 ms 68556 KB Output is correct
59 Correct 150 ms 69072 KB Output is correct
60 Correct 147 ms 68944 KB Output is correct
61 Correct 157 ms 69076 KB Output is correct
62 Correct 174 ms 69200 KB Output is correct
63 Correct 153 ms 69076 KB Output is correct
64 Correct 157 ms 68956 KB Output is correct
65 Correct 160 ms 68092 KB Output is correct
66 Correct 182 ms 69152 KB Output is correct
67 Correct 96 ms 68180 KB Output is correct
68 Correct 120 ms 68696 KB Output is correct
69 Correct 138 ms 69200 KB Output is correct
70 Correct 142 ms 69204 KB Output is correct
71 Correct 87 ms 68440 KB Output is correct
72 Correct 113 ms 69212 KB Output is correct
73 Correct 208 ms 68692 KB Output is correct
74 Correct 225 ms 68948 KB Output is correct
75 Correct 223 ms 68948 KB Output is correct
76 Correct 151 ms 68024 KB Output is correct
77 Correct 191 ms 68436 KB Output is correct
78 Correct 220 ms 68948 KB Output is correct
79 Correct 148 ms 68004 KB Output is correct
80 Correct 141 ms 67768 KB Output is correct
81 Correct 198 ms 68128 KB Output is correct
82 Correct 142 ms 67856 KB Output is correct
83 Correct 224 ms 68492 KB Output is correct
84 Correct 213 ms 68516 KB Output is correct
85 Correct 174 ms 68748 KB Output is correct
86 Correct 201 ms 69160 KB Output is correct
87 Correct 129 ms 68692 KB Output is correct
88 Correct 149 ms 69356 KB Output is correct
89 Correct 111 ms 68072 KB Output is correct
90 Correct 153 ms 68956 KB Output is correct
91 Correct 126 ms 68488 KB Output is correct
92 Correct 124 ms 68428 KB Output is correct
93 Correct 164 ms 69072 KB Output is correct
94 Correct 152 ms 68944 KB Output is correct
95 Correct 154 ms 68988 KB Output is correct
96 Correct 157 ms 69072 KB Output is correct
97 Correct 170 ms 69212 KB Output is correct
98 Correct 136 ms 68600 KB Output is correct
99 Correct 155 ms 68148 KB Output is correct
100 Correct 145 ms 68244 KB Output is correct
101 Correct 173 ms 69072 KB Output is correct
102 Correct 112 ms 69368 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 65872 KB Output is correct
2 Correct 16 ms 65884 KB Output is correct
3 Correct 14 ms 65784 KB Output is correct
4 Correct 16 ms 65764 KB Output is correct
5 Correct 15 ms 65988 KB Output is correct
6 Correct 15 ms 65884 KB Output is correct
7 Correct 15 ms 65996 KB Output is correct
8 Correct 15 ms 65880 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 15 ms 65880 KB Output is correct
11 Correct 18 ms 65948 KB Output is correct
12 Correct 15 ms 65948 KB Output is correct
13 Correct 15 ms 65884 KB Output is correct
14 Correct 16 ms 66012 KB Output is correct
15 Correct 15 ms 65884 KB Output is correct
16 Correct 16 ms 65884 KB Output is correct
17 Correct 17 ms 65884 KB Output is correct
18 Correct 16 ms 65980 KB Output is correct
19 Correct 15 ms 65784 KB Output is correct
20 Correct 16 ms 65880 KB Output is correct
21 Correct 16 ms 65884 KB Output is correct
22 Correct 16 ms 66008 KB Output is correct
23 Correct 16 ms 65880 KB Output is correct
24 Correct 16 ms 65884 KB Output is correct
25 Correct 15 ms 65884 KB Output is correct
26 Correct 15 ms 65880 KB Output is correct
27 Correct 16 ms 65880 KB Output is correct
28 Correct 15 ms 65816 KB Output is correct
29 Correct 16 ms 65884 KB Output is correct
30 Correct 15 ms 65884 KB Output is correct
31 Correct 16 ms 65976 KB Output is correct
32 Correct 16 ms 65884 KB Output is correct
33 Correct 15 ms 66016 KB Output is correct
34 Correct 15 ms 65884 KB Output is correct
35 Correct 16 ms 65972 KB Output is correct
36 Correct 18 ms 65880 KB Output is correct
37 Correct 14 ms 65884 KB Output is correct
38 Correct 15 ms 65884 KB Output is correct
39 Correct 175 ms 69344 KB Output is correct
40 Correct 145 ms 69432 KB Output is correct
41 Correct 180 ms 69092 KB Output is correct
42 Correct 170 ms 68952 KB Output is correct
43 Correct 149 ms 69184 KB Output is correct
44 Correct 156 ms 69208 KB Output is correct
45 Correct 116 ms 68016 KB Output is correct
46 Correct 123 ms 68292 KB Output is correct
47 Correct 144 ms 69164 KB Output is correct
48 Correct 153 ms 69212 KB Output is correct
49 Correct 142 ms 69200 KB Output is correct
50 Correct 141 ms 69160 KB Output is correct
51 Correct 151 ms 68988 KB Output is correct
52 Correct 165 ms 68956 KB Output is correct
53 Correct 108 ms 68944 KB Output is correct
54 Correct 119 ms 69256 KB Output is correct
55 Correct 884 ms 76820 KB Output is correct
56 Correct 673 ms 74872 KB Output is correct
57 Correct 967 ms 77936 KB Output is correct
58 Correct 521 ms 79424 KB Output is correct
59 Correct 572 ms 79436 KB Output is correct
60 Correct 795 ms 84280 KB Output is correct
61 Correct 596 ms 78616 KB Output is correct
62 Correct 644 ms 78572 KB Output is correct
63 Execution timed out 1022 ms 82988 KB Time limit exceeded
64 Halted 0 ms 0 KB -