oj.uz

Submission #835448

# Submission time Handle Problem Language Result Execution time Memory
835448 2023-08-23T14:36:46 Z SamAnd Radio Towers (IOI22_towers) C++17
60 / 100
 1126 ms 74972 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 100005;

int n, d;
int a[N];

int ul[N], ur[N];
vector<pair<pair<int, int>, pair<int, int> > > b;

int z;
int s[N * 18 * 18];
int sl[N * 18 * 18], sr[N * 18 * 18];
void ubdy(int tl, int tr, int l, int r, int posy)
{
    if (l > r)
        return;
    if (tl == l && tr == r)
    {
        s[posy]++;
        return;
    }
    int m = (tl + tr) / 2;
    if (sl[posy] == 0)
        sl[posy] = ++z;
    if (sr[posy] == 0)
        sr[posy] = ++z;
    ubdy(tl, m, l, min(m, r), sl[posy]);
    ubdy(m + 1, tr, max(m + 1, l), r, sr[posy]);
}

int r[N * 4];
void ubdx(int tl, int tr, int lx, int rx, int ly, int ry, int posx)
{
    if (lx > rx)
        return;
    if (tl == lx && tr == rx)
    {
        if (r[posx] == 0)
            r[posx] = ++z;
        ubdy(1, n, ly, ry, r[posx]);
        return;
    }
    int m = (tl + tr) / 2;
    ubdx(tl, m, lx, min(m, rx), ly, ry, posx * 2);
    ubdx(m + 1, tr, max(m + 1, lx), rx, ly, ry, posx * 2 + 1);
}

int qryy(int tl, int tr, int y, int posy)
{
    if (posy == 0)
        return 0;
    if (tl == tr)
        return s[posy];
    int m = (tl + tr) / 2;
    if (y <= m)
        return qryy(tl, m, y, sl[posy]) + s[posy];
    return qryy(m + 1, tr, y, sr[posy]) + s[posy];
}

int qryx(int tl, int tr, int x, int y, int posx)
{
    if (tl == tr)
        return qryy(1, n, y, r[posx]);
    int m = (tl + tr) / 2;
    if (x <= m)
        return qryx(tl, m, x, y, posx * 2) + qryy(1, n, y, r[posx]);
    return qryx(m + 1, tr, x, y, posx * 2 + 1) + qryy(1, n, y, r[posx]);
}

void pre()
{
    b.clear();

    vector<int> s;
    for (int i = 1; i <= n; ++i)
    {
        while (!s.empty() && a[s.back()] <= a[i])
            s.pop_back();
        s.push_back(i);

        int l = 0, r = sz(s) - 1;
        ul[i] = 0;
        while (l <= r)
        {
            int m = (l + r) / 2;
            if (a[s[m]] - d >= a[i])
            {
                ul[i] = s[m];
                l = m + 1;
            }
            else
            {
                r = m - 1;
            }
        }
    }
    s.clear();
    for (int i = n; i >= 1; --i)
    {
        while (!s.empty() && a[s.back()] <= a[i])
            s.pop_back();
        s.push_back(i);

        int l = 0, r = sz(s) - 1;
        ur[i] = n + 1;
        while (l <= r)
        {
            int m = (l + r) / 2;
            if (a[s[m]] - d >= a[i])
            {
                ur[i] = s[m];
                l = m + 1;
            }
            else
                r = m - 1;
        }
    }

    for (int i = 1; i <= n; ++i)
    {
        ul[i]++;
        ur[i]--;
    }

    for (int i = 1; i <= n; ++i)
    {
        b.push_back(m_p(m_p(ur[i] - ul[i] + 1, i), m_p(ul[i], ur[i])));
    }
    sort(all(b));
    set<int> t;
    t.insert(0);
    t.insert(n + 1);
    for (int ii = 0; ii < n; ++ii)
    {
        int i = b[ii].fi.se;
        t.insert(i);
        auto it = t.find(i);
        --it;
        if (ur[*it] < ul[i])
            b[ii].fi.fi = 1;
        else
            b[ii].fi.fi = *it + 1;
        b[ii].fi.se = i;
        ++it;
        ++it;
        b[ii].se.fi = i;
        if (ur[i] < ul[*it])
            b[ii].se.se = n;
        else
            b[ii].se.se = *it - 1;
    }

    for (int i = 0; i < n; ++i)
    {
        ubdx(1, n, b[i].fi.fi, b[i].fi.se, b[i].se.fi, b[i].se.se, 1);
    }
}

int x;
void init(int N, std::vector<int> H)
{
    n = N;
    for (int i = 1; i <= n; ++i)
        a[i] = H[i - 1];

    x = 1;
    while (x < n && a[x] < a[x + 1])
        ++x;
    for (int i = x + 1; i <= n; ++i)
    {
        if (!(a[i] < a[i - 1]))
        {
            x = 0;
            break;
        }
    }
}

int max_towers(int L, int R, int D)
{
    ++L;
    ++R;
    if (x)
    {
        if (L < x && x < R)
        {
            if (a[L] <= a[x] - D && a[R] <= a[x] - D)
                return 2;
        }
        return 1;
    }
    if (b.empty())
    {
        d = D;
        pre();
    }

    return qryx(1, n, L, R, 1);
}

/*
7 1
10 20 30 60 50 30 10
0 4 1

7 3
10 20 60 40 50 30 70
1 5 10
2 2 100
0 6 17
*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 996 KB Output is correct
2 Correct 590 ms 1508 KB Output is correct
3 Correct 704 ms 1444 KB Output is correct
4 Correct 822 ms 1476 KB Output is correct
5 Correct 631 ms 1352 KB Output is correct
6 Correct 761 ms 1476 KB Output is correct
7 Correct 592 ms 1488 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Correct 2 ms 1104 KB Output is correct
4 Correct 2 ms 1232 KB Output is correct
5 Correct 2 ms 1232 KB Output is correct
6 Correct 2 ms 1232 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 2 ms 1008 KB Output is correct
11 Correct 2 ms 1232 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 1232 KB Output is correct
16 Correct 2 ms 1232 KB Output is correct
17 Correct 3 ms 1232 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 2 ms 1232 KB Output is correct
21 Correct 3 ms 1232 KB Output is correct
22 Correct 3 ms 1232 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 1232 KB Output is correct
27 Correct 2 ms 1232 KB Output is correct
28 Correct 3 ms 1232 KB Output is correct
29 Correct 2 ms 1232 KB Output is correct
30 Correct 2 ms 1232 KB Output is correct
31 Correct 2 ms 1232 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 2 ms 1028 KB Output is correct
35 Correct 2 ms 1232 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Correct 2 ms 1104 KB Output is correct
4 Correct 2 ms 1232 KB Output is correct
5 Correct 2 ms 1232 KB Output is correct
6 Correct 2 ms 1232 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 2 ms 1008 KB Output is correct
11 Correct 2 ms 1232 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 1232 KB Output is correct
16 Correct 2 ms 1232 KB Output is correct
17 Correct 3 ms 1232 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 2 ms 1232 KB Output is correct
21 Correct 3 ms 1232 KB Output is correct
22 Correct 3 ms 1232 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 1232 KB Output is correct
27 Correct 2 ms 1232 KB Output is correct
28 Correct 3 ms 1232 KB Output is correct
29 Correct 2 ms 1232 KB Output is correct
30 Correct 2 ms 1232 KB Output is correct
31 Correct 2 ms 1232 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 2 ms 1028 KB Output is correct
35 Correct 2 ms 1232 KB Output is correct
36 Correct 87 ms 42040 KB Output is correct
37 Correct 109 ms 62568 KB Output is correct
38 Correct 127 ms 64928 KB Output is correct
39 Correct 100 ms 61164 KB Output is correct
40 Correct 134 ms 67024 KB Output is correct
41 Correct 123 ms 65464 KB Output is correct
42 Correct 133 ms 67532 KB Output is correct
43 Correct 14 ms 1488 KB Output is correct
44 Correct 15 ms 1488 KB Output is correct
45 Correct 81 ms 47160 KB Output is correct
46 Correct 132 ms 74312 KB Output is correct
47 Correct 146 ms 66516 KB Output is correct
48 Correct 131 ms 67620 KB Output is correct
49 Correct 135 ms 67640 KB Output is correct
50 Correct 9 ms 1352 KB Output is correct
51 Correct 82 ms 47336 KB Output is correct
52 Correct 148 ms 66364 KB Output is correct
53 Correct 128 ms 67580 KB Output is correct
54 Correct 141 ms 67596 KB Output is correct
55 Correct 14 ms 1488 KB Output is correct
56 Correct 79 ms 47268 KB Output is correct
57 Correct 120 ms 61012 KB Output is correct
58 Correct 141 ms 64244 KB Output is correct
59 Correct 133 ms 65472 KB Output is correct
60 Correct 131 ms 67644 KB Output is correct
61 Correct 140 ms 67000 KB Output is correct
62 Correct 131 ms 66056 KB Output is correct
63 Correct 136 ms 67140 KB Output is correct
64 Correct 8 ms 1456 KB Output is correct
65 Correct 9 ms 1488 KB Output is correct
66 Correct 92 ms 59320 KB Output is correct
67 Correct 124 ms 74972 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 835 ms 65964 KB Output is correct
2 Correct 1126 ms 66304 KB Output is correct
3 Correct 1037 ms 66512 KB Output is correct
4 Correct 995 ms 67640 KB Output is correct
5 Correct 816 ms 67620 KB Output is correct
6 Correct 1008 ms 67640 KB Output is correct
7 Correct 858 ms 67636 KB Output is correct
8 Correct 617 ms 1488 KB Output is correct
9 Correct 755 ms 1488 KB Output is correct
10 Correct 849 ms 47196 KB Output is correct
11 Correct 935 ms 66580 KB Output is correct
12 Correct 666 ms 1356 KB Output is correct
13 Correct 678 ms 1488 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 143 ms 66396 KB Output is correct
18 Correct 129 ms 67564 KB Output is correct
19 Correct 128 ms 67560 KB Output is correct
20 Correct 8 ms 1476 KB Output is correct
21 Correct 82 ms 47344 KB Output is correct
22 Correct 143 ms 66360 KB Output is correct
23 Correct 130 ms 67596 KB Output is correct
24 Correct 134 ms 67548 KB Output is correct
25 Correct 9 ms 1488 KB Output is correct
26 Correct 85 ms 47212 KB Output is correct
27 Correct 2 ms 1232 KB Output is correct
28 Correct 2 ms 1232 KB Output is correct
29 Correct 2 ms 1232 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 2 ms 1232 KB Output is correct
33 Correct 2 ms 1232 KB Output is correct
34 Correct 2 ms 1356 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 1 ms 976 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 226 ms 14152 KB 2nd lines differ - on the 1st token, expected: '7063', found: '7197'
2 Halted 0 ms 0 KB -

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Correct 2 ms 1104 KB Output is correct
4 Correct 2 ms 1232 KB Output is correct
5 Correct 2 ms 1232 KB Output is correct
6 Correct 2 ms 1232 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 2 ms 1008 KB Output is correct
11 Correct 2 ms 1232 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 1232 KB Output is correct
16 Correct 2 ms 1232 KB Output is correct
17 Correct 3 ms 1232 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 976 KB Output is correct
20 Correct 2 ms 1232 KB Output is correct
21 Correct 3 ms 1232 KB Output is correct
22 Correct 3 ms 1232 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 976 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 1232 KB Output is correct
27 Correct 2 ms 1232 KB Output is correct
28 Correct 3 ms 1232 KB Output is correct
29 Correct 2 ms 1232 KB Output is correct
30 Correct 2 ms 1232 KB Output is correct
31 Correct 2 ms 1232 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 2 ms 1028 KB Output is correct
35 Correct 2 ms 1232 KB Output is correct
36 Correct 87 ms 42040 KB Output is correct
37 Correct 109 ms 62568 KB Output is correct
38 Correct 127 ms 64928 KB Output is correct
39 Correct 100 ms 61164 KB Output is correct
40 Correct 134 ms 67024 KB Output is correct
41 Correct 123 ms 65464 KB Output is correct
42 Correct 133 ms 67532 KB Output is correct
43 Correct 14 ms 1488 KB Output is correct
44 Correct 15 ms 1488 KB Output is correct
45 Correct 81 ms 47160 KB Output is correct
46 Correct 132 ms 74312 KB Output is correct
47 Correct 146 ms 66516 KB Output is correct
48 Correct 131 ms 67620 KB Output is correct
49 Correct 135 ms 67640 KB Output is correct
50 Correct 9 ms 1352 KB Output is correct
51 Correct 82 ms 47336 KB Output is correct
52 Correct 148 ms 66364 KB Output is correct
53 Correct 128 ms 67580 KB Output is correct
54 Correct 141 ms 67596 KB Output is correct
55 Correct 14 ms 1488 KB Output is correct
56 Correct 79 ms 47268 KB Output is correct
57 Correct 120 ms 61012 KB Output is correct
58 Correct 141 ms 64244 KB Output is correct
59 Correct 133 ms 65472 KB Output is correct
60 Correct 131 ms 67644 KB Output is correct
61 Correct 140 ms 67000 KB Output is correct
62 Correct 131 ms 66056 KB Output is correct
63 Correct 136 ms 67140 KB Output is correct
64 Correct 8 ms 1456 KB Output is correct
65 Correct 9 ms 1488 KB Output is correct
66 Correct 92 ms 59320 KB Output is correct
67 Correct 124 ms 74972 KB Output is correct
68 Correct 835 ms 65964 KB Output is correct
69 Correct 1126 ms 66304 KB Output is correct
70 Correct 1037 ms 66512 KB Output is correct
71 Correct 995 ms 67640 KB Output is correct
72 Correct 816 ms 67620 KB Output is correct
73 Correct 1008 ms 67640 KB Output is correct
74 Correct 858 ms 67636 KB Output is correct
75 Correct 617 ms 1488 KB Output is correct
76 Correct 755 ms 1488 KB Output is correct
77 Correct 849 ms 47196 KB Output is correct
78 Correct 935 ms 66580 KB Output is correct
79 Correct 666 ms 1356 KB Output is correct
80 Correct 678 ms 1488 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 143 ms 66396 KB Output is correct
85 Correct 129 ms 67564 KB Output is correct
86 Correct 128 ms 67560 KB Output is correct
87 Correct 8 ms 1476 KB Output is correct
88 Correct 82 ms 47344 KB Output is correct
89 Correct 143 ms 66360 KB Output is correct
90 Correct 130 ms 67596 KB Output is correct
91 Correct 134 ms 67548 KB Output is correct
92 Correct 9 ms 1488 KB Output is correct
93 Correct 85 ms 47212 KB Output is correct
94 Correct 2 ms 1232 KB Output is correct
95 Correct 2 ms 1232 KB Output is correct
96 Correct 2 ms 1232 KB Output is correct
97 Correct 1 ms 336 KB Output is correct
98 Correct 1 ms 976 KB Output is correct
99 Correct 2 ms 1232 KB Output is correct
100 Correct 2 ms 1232 KB Output is correct
101 Correct 2 ms 1356 KB Output is correct
102 Correct 0 ms 208 KB Output is correct
103 Correct 1 ms 976 KB Output is correct
104 Correct 786 ms 57956 KB Output is correct
105 Correct 1010 ms 65208 KB Output is correct
106 Correct 943 ms 63524 KB Output is correct
107 Correct 916 ms 66264 KB Output is correct
108 Correct 888 ms 61648 KB Output is correct
109 Correct 1041 ms 66024 KB Output is correct
110 Correct 1043 ms 67636 KB Output is correct
111 Correct 680 ms 1488 KB Output is correct
112 Correct 617 ms 1488 KB Output is correct
113 Correct 809 ms 71264 KB Output is correct
114 Correct 1077 ms 70988 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 996 KB Output is correct
2 Correct 590 ms 1508 KB Output is correct
3 Correct 704 ms 1444 KB Output is correct
4 Correct 822 ms 1476 KB Output is correct
5 Correct 631 ms 1352 KB Output is correct
6 Correct 761 ms 1476 KB Output is correct
7 Correct 592 ms 1488 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 2 ms 1232 KB Output is correct
13 Correct 2 ms 1104 KB Output is correct
14 Correct 2 ms 1232 KB Output is correct
15 Correct 2 ms 1232 KB Output is correct
16 Correct 2 ms 1232 KB Output is correct
17 Correct 2 ms 1104 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 1008 KB Output is correct
21 Correct 2 ms 1232 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 2 ms 1232 KB Output is correct
26 Correct 2 ms 1232 KB Output is correct
27 Correct 3 ms 1232 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 976 KB Output is correct
30 Correct 2 ms 1232 KB Output is correct
31 Correct 3 ms 1232 KB Output is correct
32 Correct 3 ms 1232 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 976 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 2 ms 1232 KB Output is correct
37 Correct 2 ms 1232 KB Output is correct
38 Correct 3 ms 1232 KB Output is correct
39 Correct 2 ms 1232 KB Output is correct
40 Correct 2 ms 1232 KB Output is correct
41 Correct 2 ms 1232 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 2 ms 1028 KB Output is correct
45 Correct 2 ms 1232 KB Output is correct
46 Correct 87 ms 42040 KB Output is correct
47 Correct 109 ms 62568 KB Output is correct
48 Correct 127 ms 64928 KB Output is correct
49 Correct 100 ms 61164 KB Output is correct
50 Correct 134 ms 67024 KB Output is correct
51 Correct 123 ms 65464 KB Output is correct
52 Correct 133 ms 67532 KB Output is correct
53 Correct 14 ms 1488 KB Output is correct
54 Correct 15 ms 1488 KB Output is correct
55 Correct 81 ms 47160 KB Output is correct
56 Correct 132 ms 74312 KB Output is correct
57 Correct 146 ms 66516 KB Output is correct
58 Correct 131 ms 67620 KB Output is correct
59 Correct 135 ms 67640 KB Output is correct
60 Correct 9 ms 1352 KB Output is correct
61 Correct 82 ms 47336 KB Output is correct
62 Correct 148 ms 66364 KB Output is correct
63 Correct 128 ms 67580 KB Output is correct
64 Correct 141 ms 67596 KB Output is correct
65 Correct 14 ms 1488 KB Output is correct
66 Correct 79 ms 47268 KB Output is correct
67 Correct 120 ms 61012 KB Output is correct
68 Correct 141 ms 64244 KB Output is correct
69 Correct 133 ms 65472 KB Output is correct
70 Correct 131 ms 67644 KB Output is correct
71 Correct 140 ms 67000 KB Output is correct
72 Correct 131 ms 66056 KB Output is correct
73 Correct 136 ms 67140 KB Output is correct
74 Correct 8 ms 1456 KB Output is correct
75 Correct 9 ms 1488 KB Output is correct
76 Correct 92 ms 59320 KB Output is correct
77 Correct 124 ms 74972 KB Output is correct
78 Correct 835 ms 65964 KB Output is correct
79 Correct 1126 ms 66304 KB Output is correct
80 Correct 1037 ms 66512 KB Output is correct
81 Correct 995 ms 67640 KB Output is correct
82 Correct 816 ms 67620 KB Output is correct
83 Correct 1008 ms 67640 KB Output is correct
84 Correct 858 ms 67636 KB Output is correct
85 Correct 617 ms 1488 KB Output is correct
86 Correct 755 ms 1488 KB Output is correct
87 Correct 849 ms 47196 KB Output is correct
88 Correct 935 ms 66580 KB Output is correct
89 Correct 666 ms 1356 KB Output is correct
90 Correct 678 ms 1488 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 1 ms 208 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 143 ms 66396 KB Output is correct
95 Correct 129 ms 67564 KB Output is correct
96 Correct 128 ms 67560 KB Output is correct
97 Correct 8 ms 1476 KB Output is correct
98 Correct 82 ms 47344 KB Output is correct
99 Correct 143 ms 66360 KB Output is correct
100 Correct 130 ms 67596 KB Output is correct
101 Correct 134 ms 67548 KB Output is correct
102 Correct 9 ms 1488 KB Output is correct
103 Correct 85 ms 47212 KB Output is correct
104 Correct 2 ms 1232 KB Output is correct
105 Correct 2 ms 1232 KB Output is correct
106 Correct 2 ms 1232 KB Output is correct
107 Correct 1 ms 336 KB Output is correct
108 Correct 1 ms 976 KB Output is correct
109 Correct 2 ms 1232 KB Output is correct
110 Correct 2 ms 1232 KB Output is correct
111 Correct 2 ms 1356 KB Output is correct
112 Correct 0 ms 208 KB Output is correct
113 Correct 1 ms 976 KB Output is correct
114 Incorrect 226 ms 14152 KB 2nd lines differ - on the 1st token, expected: '7063', found: '7197'
115 Halted 0 ms 0 KB -