oj.uz

Submission #848889

# Submission time Handle Problem Language Result Execution time Memory
848889 2023-09-13T16:30:55 Z Itamar Radio Towers (IOI22_towers) C++17
60 / 100
 1667 ms 55128 KB 
#include <vector>
#include <cassert>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define vi vector<int>
#include <set>
vi st;
const int siz = 1e5;
int h[siz];
int d;
#define pi pair<int,int>
#pragma warning(disable : 4996)
struct node {
    int l, r, mid, maxi,ans;
    vector<pi> v;
    vi vd;
    node* sl, * sr,*t=NULL;
    node(int li, int ri) {
        l = li, r = ri, mid = (l + r) / 2,v.resize(r-l+2),vd.resize(r-l+2);
        vd[0] = 1e9;
        if (l < r) {
            sl = new node(l, mid);
            sr = new node(mid + 1, r);
            maxi = max(sl->maxi, sr->maxi);
        }
        else {
            maxi = h[l];
            ans = 1;
            v[1] = { l,l };
            vd[1] = 1e9;
        }
    }
    int qm(int a, int b) {
        if (a > b)return 0;
        if (a > r || b < l)return 0;
        if (a <= l && b >= r)return maxi;
        return max(sl->qm(a, b), sr->qm(a, b));
    }
    void calc(node* top) {
        t = top;
        if (l < r) {
            sl->calc(top), sr->calc(top);
            vector<pi> vec;
            for (int i = 1; i <= mid - l + 1; i++)vec.push_back({ sl->vd[i], i });
            for (int i = 1; i <= r-mid; i++)vec.push_back({ sr->vd[i], -i });
            sort(vec.begin(), vec.end());
            reverse(vec.begin(), vec.end());
            int maxi1 = 0, maxi2 = 0;
            for (int i = 0; i < vec.size(); i++) {
                if (vec[i].second>=0)maxi1++;
                else maxi2++;
                int op = min(vec[i].first, t->qm(sl->v[maxi1].second + 1, sr->v[maxi2].first - 1)- max(h[sl->v[maxi1].second],h[sr->v[maxi2].first]));
                if (maxi1 && maxi2 && vd[maxi1 + maxi2] < op) {
                    vd[maxi1 + maxi2] = op;
                    v[maxi1 + maxi2] = { sl->v[maxi1].first,sr->v[maxi2].second };
                }
                if (maxi1 && maxi2 && vd[maxi1 + maxi2 - 1] < vec[i].first) {
                    vd[maxi1 + maxi2 - 1] = vec[i].first;
                    v[i].first = sl->v[maxi1].first;
                    v[i].second = sr->v[maxi2].second;
                    if (sl->v[maxi1].first == sl->v[maxi1].second && h[sl->v[maxi1].first] > h[sr->v[maxi2].first])v[i].first = sr->v[maxi2].first;
                    else if (sr->v[maxi2].first == sr->v[maxi2].second && h[sr->v[maxi2].first] > h[sl->v[maxi1].second])v[i].second = sl->v[maxi1].second;
                }
            }

        }
    }
    void rev() {
        if (l < r) {
            sl->rev();
            sr->rev();
        }
        reverse(vd.begin(), vd.end());
    }
    int query(int a, int b, int &rep, int dq) {
        if (a > r || b < l)return 0;
        if (a <= l && b >= r) {
            int i = upper_bound(vd.begin(), vd.end(), dq) - vd.begin();
            i = r - l + 1 - i;
            if (rep != -1) {
                int l1 = rep, r1 = v[i].first;
                if (t->qm(l1 + 1, r1 - 1) - dq >= max(h[l1], h[r1])) {
                    rep = v[i].second;
                    return i;
                }
                else {
                    if (v[i].first != v[i].second || h[v[i].first] < h[rep]) {
                        rep = v[i].second;
                    }
                    return i - 1;
                }
            }
            else {
                rep = v[i].second;
                return i;
            }
        }
        else {
            return sl->query(a, b, rep,dq) + sr->query(a, b, rep,dq);
        }
    }
};
node* seg;
void init(int N, std::vector<int> H) {
    for (int i = 0; i < N; i++)h[i] = H[i];
    seg = new node(0, N - 1);
    /*set<int> s;
    multiset<pi> d;
    for (int i = 0; i < N; i++)s.insert(i);
    for (int i = 0; i < N; i++)d.insert({ 0,i });
    while (s.size()>1) {
        auto it = d.begin(); pi p = *it;
        if(d.fi)
    }*/
    seg->calc(seg);
    seg->rev();
}
bool f = 0;
int max_towers(int L, int R, int D) {
    int k = -1;
    return seg->query(L, R, k,D);
}
/*
int main() {
    int N, Q;
    assert(2 == scanf("%d %d", &N, &Q));
    std::vector<int> H(N);
    for (int i = 0; i < N; ++i) {
        assert(1 == scanf("%d", &H[i]));
    }
    init(N, H);

    for (int i = 0; i < Q; ++i) {
        int L, R, D;
        assert(3 == scanf("%d %d %d", &L, &R, &D));
        printf("%d\n", max_towers(L, R, D));
    }
    return 0;
}*/

Compilation message

towers.cpp:15: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
   15 | #pragma warning(disable : 4996)
      | 
towers.cpp: In member function 'void node::calc(node*)':
towers.cpp:52:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |             for (int i = 0; i < vec.size(); i++) {
      |                             ~~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 31892 KB Output is correct
2 Correct 1257 ms 54688 KB Output is correct
3 Correct 1227 ms 55020 KB Output is correct
4 Correct 1200 ms 54736 KB Output is correct
5 Correct 1480 ms 54732 KB Output is correct
6 Correct 1215 ms 54732 KB Output is correct
7 Correct 1432 ms 54748 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 4 ms 1368 KB Output is correct
10 Correct 3 ms 1368 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 3 ms 1368 KB Output is correct
3 Correct 3 ms 1368 KB Output is correct
4 Correct 3 ms 1368 KB Output is correct
5 Correct 3 ms 1368 KB Output is correct
6 Correct 3 ms 1368 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 2 ms 1200 KB Output is correct
9 Correct 3 ms 1368 KB Output is correct
10 Correct 2 ms 1368 KB Output is correct
11 Correct 3 ms 1368 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 3 ms 1356 KB Output is correct
14 Correct 3 ms 1368 KB Output is correct
15 Correct 3 ms 1368 KB Output is correct
16 Correct 2 ms 1368 KB Output is correct
17 Correct 3 ms 1368 KB Output is correct
18 Correct 3 ms 1368 KB Output is correct
19 Correct 2 ms 1368 KB Output is correct
20 Correct 3 ms 1368 KB Output is correct
21 Correct 3 ms 1368 KB Output is correct
22 Correct 3 ms 1368 KB Output is correct
23 Correct 4 ms 1524 KB Output is correct
24 Correct 2 ms 1368 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 3 ms 1352 KB Output is correct
27 Correct 3 ms 1368 KB Output is correct
28 Correct 3 ms 1368 KB Output is correct
29 Correct 3 ms 1368 KB Output is correct
30 Correct 3 ms 1368 KB Output is correct
31 Correct 3 ms 1368 KB Output is correct
32 Correct 2 ms 1352 KB Output is correct
33 Correct 3 ms 1368 KB Output is correct
34 Correct 3 ms 1368 KB Output is correct
35 Correct 2 ms 1368 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 3 ms 1368 KB Output is correct
3 Correct 3 ms 1368 KB Output is correct
4 Correct 3 ms 1368 KB Output is correct
5 Correct 3 ms 1368 KB Output is correct
6 Correct 3 ms 1368 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 2 ms 1200 KB Output is correct
9 Correct 3 ms 1368 KB Output is correct
10 Correct 2 ms 1368 KB Output is correct
11 Correct 3 ms 1368 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 3 ms 1356 KB Output is correct
14 Correct 3 ms 1368 KB Output is correct
15 Correct 3 ms 1368 KB Output is correct
16 Correct 2 ms 1368 KB Output is correct
17 Correct 3 ms 1368 KB Output is correct
18 Correct 3 ms 1368 KB Output is correct
19 Correct 2 ms 1368 KB Output is correct
20 Correct 3 ms 1368 KB Output is correct
21 Correct 3 ms 1368 KB Output is correct
22 Correct 3 ms 1368 KB Output is correct
23 Correct 4 ms 1524 KB Output is correct
24 Correct 2 ms 1368 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 3 ms 1352 KB Output is correct
27 Correct 3 ms 1368 KB Output is correct
28 Correct 3 ms 1368 KB Output is correct
29 Correct 3 ms 1368 KB Output is correct
30 Correct 3 ms 1368 KB Output is correct
31 Correct 3 ms 1368 KB Output is correct
32 Correct 2 ms 1352 KB Output is correct
33 Correct 3 ms 1368 KB Output is correct
34 Correct 3 ms 1368 KB Output is correct
35 Correct 2 ms 1368 KB Output is correct
36 Correct 135 ms 34916 KB Output is correct
37 Correct 212 ms 54728 KB Output is correct
38 Correct 210 ms 54732 KB Output is correct
39 Correct 205 ms 55060 KB Output is correct
40 Correct 205 ms 54744 KB Output is correct
41 Correct 206 ms 54744 KB Output is correct
42 Correct 210 ms 54724 KB Output is correct
43 Correct 179 ms 54792 KB Output is correct
44 Correct 193 ms 54728 KB Output is correct
45 Correct 182 ms 54744 KB Output is correct
46 Correct 197 ms 54728 KB Output is correct
47 Correct 216 ms 54732 KB Output is correct
48 Correct 207 ms 54852 KB Output is correct
49 Correct 210 ms 54736 KB Output is correct
50 Correct 201 ms 55044 KB Output is correct
51 Correct 173 ms 54632 KB Output is correct
52 Correct 220 ms 54776 KB Output is correct
53 Correct 212 ms 55128 KB Output is correct
54 Correct 207 ms 54736 KB Output is correct
55 Correct 196 ms 54604 KB Output is correct
56 Correct 178 ms 54696 KB Output is correct
57 Correct 203 ms 53020 KB Output is correct
58 Correct 214 ms 54780 KB Output is correct
59 Correct 220 ms 54764 KB Output is correct
60 Correct 205 ms 54644 KB Output is correct
61 Correct 215 ms 54776 KB Output is correct
62 Correct 202 ms 54728 KB Output is correct
63 Correct 205 ms 54748 KB Output is correct
64 Correct 216 ms 54848 KB Output is correct
65 Correct 193 ms 54904 KB Output is correct
66 Correct 174 ms 54728 KB Output is correct
67 Correct 185 ms 54756 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1092 ms 54416 KB Output is correct
2 Correct 1385 ms 54728 KB Output is correct
3 Correct 1408 ms 54800 KB Output is correct
4 Correct 1444 ms 54724 KB Output is correct
5 Correct 1404 ms 54732 KB Output is correct
6 Correct 1439 ms 54848 KB Output is correct
7 Correct 1406 ms 54736 KB Output is correct
8 Correct 1192 ms 54916 KB Output is correct
9 Correct 1424 ms 54712 KB Output is correct
10 Correct 1169 ms 54732 KB Output is correct
11 Correct 1385 ms 54640 KB Output is correct
12 Correct 1170 ms 54744 KB Output is correct
13 Correct 1411 ms 54712 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 4 ms 1368 KB Output is correct
16 Correct 2 ms 1360 KB Output is correct
17 Correct 220 ms 54676 KB Output is correct
18 Correct 207 ms 54788 KB Output is correct
19 Correct 203 ms 54652 KB Output is correct
20 Correct 203 ms 54724 KB Output is correct
21 Correct 179 ms 54732 KB Output is correct
22 Correct 212 ms 54732 KB Output is correct
23 Correct 205 ms 54728 KB Output is correct
24 Correct 203 ms 54728 KB Output is correct
25 Correct 207 ms 54732 KB Output is correct
26 Correct 178 ms 54732 KB Output is correct
27 Correct 3 ms 1368 KB Output is correct
28 Correct 3 ms 1368 KB Output is correct
29 Correct 3 ms 1368 KB Output is correct
30 Correct 3 ms 1368 KB Output is correct
31 Correct 2 ms 1368 KB Output is correct
32 Correct 3 ms 1368 KB Output is correct
33 Correct 3 ms 1364 KB Output is correct
34 Correct 3 ms 1368 KB Output is correct
35 Correct 2 ms 1368 KB Output is correct
36 Correct 2 ms 1368 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 12688 KB Output is correct
2 Correct 807 ms 54804 KB Output is correct
3 Incorrect 799 ms 54736 KB 66712th lines differ - on the 1st token, expected: '21557', found: '21556'
4 Halted 0 ms 0 KB -

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 3 ms 1368 KB Output is correct
3 Correct 3 ms 1368 KB Output is correct
4 Correct 3 ms 1368 KB Output is correct
5 Correct 3 ms 1368 KB Output is correct
6 Correct 3 ms 1368 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 2 ms 1200 KB Output is correct
9 Correct 3 ms 1368 KB Output is correct
10 Correct 2 ms 1368 KB Output is correct
11 Correct 3 ms 1368 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 3 ms 1356 KB Output is correct
14 Correct 3 ms 1368 KB Output is correct
15 Correct 3 ms 1368 KB Output is correct
16 Correct 2 ms 1368 KB Output is correct
17 Correct 3 ms 1368 KB Output is correct
18 Correct 3 ms 1368 KB Output is correct
19 Correct 2 ms 1368 KB Output is correct
20 Correct 3 ms 1368 KB Output is correct
21 Correct 3 ms 1368 KB Output is correct
22 Correct 3 ms 1368 KB Output is correct
23 Correct 4 ms 1524 KB Output is correct
24 Correct 2 ms 1368 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 3 ms 1352 KB Output is correct
27 Correct 3 ms 1368 KB Output is correct
28 Correct 3 ms 1368 KB Output is correct
29 Correct 3 ms 1368 KB Output is correct
30 Correct 3 ms 1368 KB Output is correct
31 Correct 3 ms 1368 KB Output is correct
32 Correct 2 ms 1352 KB Output is correct
33 Correct 3 ms 1368 KB Output is correct
34 Correct 3 ms 1368 KB Output is correct
35 Correct 2 ms 1368 KB Output is correct
36 Correct 135 ms 34916 KB Output is correct
37 Correct 212 ms 54728 KB Output is correct
38 Correct 210 ms 54732 KB Output is correct
39 Correct 205 ms 55060 KB Output is correct
40 Correct 205 ms 54744 KB Output is correct
41 Correct 206 ms 54744 KB Output is correct
42 Correct 210 ms 54724 KB Output is correct
43 Correct 179 ms 54792 KB Output is correct
44 Correct 193 ms 54728 KB Output is correct
45 Correct 182 ms 54744 KB Output is correct
46 Correct 197 ms 54728 KB Output is correct
47 Correct 216 ms 54732 KB Output is correct
48 Correct 207 ms 54852 KB Output is correct
49 Correct 210 ms 54736 KB Output is correct
50 Correct 201 ms 55044 KB Output is correct
51 Correct 173 ms 54632 KB Output is correct
52 Correct 220 ms 54776 KB Output is correct
53 Correct 212 ms 55128 KB Output is correct
54 Correct 207 ms 54736 KB Output is correct
55 Correct 196 ms 54604 KB Output is correct
56 Correct 178 ms 54696 KB Output is correct
57 Correct 203 ms 53020 KB Output is correct
58 Correct 214 ms 54780 KB Output is correct
59 Correct 220 ms 54764 KB Output is correct
60 Correct 205 ms 54644 KB Output is correct
61 Correct 215 ms 54776 KB Output is correct
62 Correct 202 ms 54728 KB Output is correct
63 Correct 205 ms 54748 KB Output is correct
64 Correct 216 ms 54848 KB Output is correct
65 Correct 193 ms 54904 KB Output is correct
66 Correct 174 ms 54728 KB Output is correct
67 Correct 185 ms 54756 KB Output is correct
68 Correct 1092 ms 54416 KB Output is correct
69 Correct 1385 ms 54728 KB Output is correct
70 Correct 1408 ms 54800 KB Output is correct
71 Correct 1444 ms 54724 KB Output is correct
72 Correct 1404 ms 54732 KB Output is correct
73 Correct 1439 ms 54848 KB Output is correct
74 Correct 1406 ms 54736 KB Output is correct
75 Correct 1192 ms 54916 KB Output is correct
76 Correct 1424 ms 54712 KB Output is correct
77 Correct 1169 ms 54732 KB Output is correct
78 Correct 1385 ms 54640 KB Output is correct
79 Correct 1170 ms 54744 KB Output is correct
80 Correct 1411 ms 54712 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 4 ms 1368 KB Output is correct
83 Correct 2 ms 1360 KB Output is correct
84 Correct 220 ms 54676 KB Output is correct
85 Correct 207 ms 54788 KB Output is correct
86 Correct 203 ms 54652 KB Output is correct
87 Correct 203 ms 54724 KB Output is correct
88 Correct 179 ms 54732 KB Output is correct
89 Correct 212 ms 54732 KB Output is correct
90 Correct 205 ms 54728 KB Output is correct
91 Correct 203 ms 54728 KB Output is correct
92 Correct 207 ms 54732 KB Output is correct
93 Correct 178 ms 54732 KB Output is correct
94 Correct 3 ms 1368 KB Output is correct
95 Correct 3 ms 1368 KB Output is correct
96 Correct 3 ms 1368 KB Output is correct
97 Correct 3 ms 1368 KB Output is correct
98 Correct 2 ms 1368 KB Output is correct
99 Correct 3 ms 1368 KB Output is correct
100 Correct 3 ms 1364 KB Output is correct
101 Correct 3 ms 1368 KB Output is correct
102 Correct 2 ms 1368 KB Output is correct
103 Correct 2 ms 1368 KB Output is correct
104 Correct 1182 ms 48700 KB Output is correct
105 Correct 1436 ms 54728 KB Output is correct
106 Correct 1566 ms 54728 KB Output is correct
107 Correct 1473 ms 54732 KB Output is correct
108 Correct 1667 ms 54828 KB Output is correct
109 Correct 1497 ms 54804 KB Output is correct
110 Correct 1394 ms 54676 KB Output is correct
111 Correct 1228 ms 54724 KB Output is correct
112 Correct 1410 ms 54752 KB Output is correct
113 Correct 1207 ms 54732 KB Output is correct
114 Correct 1384 ms 55020 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 31892 KB Output is correct
2 Correct 1257 ms 54688 KB Output is correct
3 Correct 1227 ms 55020 KB Output is correct
4 Correct 1200 ms 54736 KB Output is correct
5 Correct 1480 ms 54732 KB Output is correct
6 Correct 1215 ms 54732 KB Output is correct
7 Correct 1432 ms 54748 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 4 ms 1368 KB Output is correct
10 Correct 3 ms 1368 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 3 ms 1368 KB Output is correct
13 Correct 3 ms 1368 KB Output is correct
14 Correct 3 ms 1368 KB Output is correct
15 Correct 3 ms 1368 KB Output is correct
16 Correct 3 ms 1368 KB Output is correct
17 Correct 4 ms 1368 KB Output is correct
18 Correct 2 ms 1200 KB Output is correct
19 Correct 3 ms 1368 KB Output is correct
20 Correct 2 ms 1368 KB Output is correct
21 Correct 3 ms 1368 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 3 ms 1356 KB Output is correct
24 Correct 3 ms 1368 KB Output is correct
25 Correct 3 ms 1368 KB Output is correct
26 Correct 2 ms 1368 KB Output is correct
27 Correct 3 ms 1368 KB Output is correct
28 Correct 3 ms 1368 KB Output is correct
29 Correct 2 ms 1368 KB Output is correct
30 Correct 3 ms 1368 KB Output is correct
31 Correct 3 ms 1368 KB Output is correct
32 Correct 3 ms 1368 KB Output is correct
33 Correct 4 ms 1524 KB Output is correct
34 Correct 2 ms 1368 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 3 ms 1352 KB Output is correct
37 Correct 3 ms 1368 KB Output is correct
38 Correct 3 ms 1368 KB Output is correct
39 Correct 3 ms 1368 KB Output is correct
40 Correct 3 ms 1368 KB Output is correct
41 Correct 3 ms 1368 KB Output is correct
42 Correct 2 ms 1352 KB Output is correct
43 Correct 3 ms 1368 KB Output is correct
44 Correct 3 ms 1368 KB Output is correct
45 Correct 2 ms 1368 KB Output is correct
46 Correct 135 ms 34916 KB Output is correct
47 Correct 212 ms 54728 KB Output is correct
48 Correct 210 ms 54732 KB Output is correct
49 Correct 205 ms 55060 KB Output is correct
50 Correct 205 ms 54744 KB Output is correct
51 Correct 206 ms 54744 KB Output is correct
52 Correct 210 ms 54724 KB Output is correct
53 Correct 179 ms 54792 KB Output is correct
54 Correct 193 ms 54728 KB Output is correct
55 Correct 182 ms 54744 KB Output is correct
56 Correct 197 ms 54728 KB Output is correct
57 Correct 216 ms 54732 KB Output is correct
58 Correct 207 ms 54852 KB Output is correct
59 Correct 210 ms 54736 KB Output is correct
60 Correct 201 ms 55044 KB Output is correct
61 Correct 173 ms 54632 KB Output is correct
62 Correct 220 ms 54776 KB Output is correct
63 Correct 212 ms 55128 KB Output is correct
64 Correct 207 ms 54736 KB Output is correct
65 Correct 196 ms 54604 KB Output is correct
66 Correct 178 ms 54696 KB Output is correct
67 Correct 203 ms 53020 KB Output is correct
68 Correct 214 ms 54780 KB Output is correct
69 Correct 220 ms 54764 KB Output is correct
70 Correct 205 ms 54644 KB Output is correct
71 Correct 215 ms 54776 KB Output is correct
72 Correct 202 ms 54728 KB Output is correct
73 Correct 205 ms 54748 KB Output is correct
74 Correct 216 ms 54848 KB Output is correct
75 Correct 193 ms 54904 KB Output is correct
76 Correct 174 ms 54728 KB Output is correct
77 Correct 185 ms 54756 KB Output is correct
78 Correct 1092 ms 54416 KB Output is correct
79 Correct 1385 ms 54728 KB Output is correct
80 Correct 1408 ms 54800 KB Output is correct
81 Correct 1444 ms 54724 KB Output is correct
82 Correct 1404 ms 54732 KB Output is correct
83 Correct 1439 ms 54848 KB Output is correct
84 Correct 1406 ms 54736 KB Output is correct
85 Correct 1192 ms 54916 KB Output is correct
86 Correct 1424 ms 54712 KB Output is correct
87 Correct 1169 ms 54732 KB Output is correct
88 Correct 1385 ms 54640 KB Output is correct
89 Correct 1170 ms 54744 KB Output is correct
90 Correct 1411 ms 54712 KB Output is correct
91 Correct 1 ms 344 KB Output is correct
92 Correct 4 ms 1368 KB Output is correct
93 Correct 2 ms 1360 KB Output is correct
94 Correct 220 ms 54676 KB Output is correct
95 Correct 207 ms 54788 KB Output is correct
96 Correct 203 ms 54652 KB Output is correct
97 Correct 203 ms 54724 KB Output is correct
98 Correct 179 ms 54732 KB Output is correct
99 Correct 212 ms 54732 KB Output is correct
100 Correct 205 ms 54728 KB Output is correct
101 Correct 203 ms 54728 KB Output is correct
102 Correct 207 ms 54732 KB Output is correct
103 Correct 178 ms 54732 KB Output is correct
104 Correct 3 ms 1368 KB Output is correct
105 Correct 3 ms 1368 KB Output is correct
106 Correct 3 ms 1368 KB Output is correct
107 Correct 3 ms 1368 KB Output is correct
108 Correct 2 ms 1368 KB Output is correct
109 Correct 3 ms 1368 KB Output is correct
110 Correct 3 ms 1364 KB Output is correct
111 Correct 3 ms 1368 KB Output is correct
112 Correct 2 ms 1368 KB Output is correct
113 Correct 2 ms 1368 KB Output is correct
114 Correct 211 ms 12688 KB Output is correct
115 Correct 807 ms 54804 KB Output is correct
116 Incorrect 799 ms 54736 KB 66712th lines differ - on the 1st token, expected: '21557', found: '21556'
117 Halted 0 ms 0 KB -