oj.uz

Submission #774784

# Submission time Handle Problem Language Result Execution time Memory
774784 2023-07-06T03:20:34 Z Magikarp4000 Radio Towers (IOI22_towers) C++17
60 / 100
 1072 ms 13992 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long

struct Node {
    int ma,mi,pos;
};

const int MAXN = 1e5+5;
int n,l,r,d;
int h[MAXN], le[MAXN], ri[MAXN], p[MAXN];
bool done, z[MAXN];
Node st[MAXN*4+10];
set<int> s;

void update(int s, int tl, int tr, int idx, int val) {
    if (tl == tr) {
        st[s].ma = st[s].mi = val;
        st[s].pos = tl;
    }
    else {
        int tm = (tl+tr)/2;
        if (idx <= tm) update(s*2,tl,tm,idx,val);
        else update(s*2+1,tm+1,tr,idx,val);
        st[s].ma = max(st[s*2].ma, st[s*2+1].ma);
        st[s].pos = st[s*2].ma > st[s*2+1].ma ? st[s*2].pos : st[s*2+1].pos;
        st[s].mi = min(st[s*2].mi, st[s*2+1].mi);
    }
}

PII query(int s, int tl, int tr, int l, int r, int tp) {
    // tp is type of query
    // 0: range min
    // 1: index of range max
    if (l <= tl && r >= tr) {
        return tp == 1 ? make_pair(st[s].ma, st[s].pos) : make_pair(st[s].mi, -1LL);
    }
    else {
        int tm = (tl+tr)/2;
        PII cur = {LLINF,-1};
        if (tp == 1) cur = {-LLINF,-1};
        if (l <= tm) cur = query(s*2,tl,tm,l,r,tp);
        if (r > tm) {
            PII ncur = query(s*2+1,tm+1,tr,l,r,tp);
            if (tp == 0) {
                if (ncur.F < cur.F) cur = ncur;
            }
            else {
                if (ncur.F > cur.F) cur = ncur;
            }
        }
        return cur;
    }
}

void precalc() {
    FOR(i,0,n) update(1,0,n-1,i,h[i]);
    PQ<PII> pq;
    FOR(i,0,n) {
        while (!pq.empty() && -pq.top().F <= h[i]-d) {
            ri[pq.top().S] = i;
            pq.pop();
        }
        pq.push({-h[i],i});
    }
    while (!pq.empty()) {
        ri[pq.top().S] = n;
        pq.pop();
    }
    FORR(i,n-1,-1) {
        while (!pq.empty() && -pq.top().F <= h[i]-d) {
            le[pq.top().S] = i;
            pq.pop();
        }
        pq.push({-h[i],i});
    }
    while (!pq.empty()) {
        le[pq.top().S] = -1;
        pq.pop();
    }
    vector<PII> v;
    FOR(i,0,n) v.PB({h[i],i});
    int vn = v.size();
    sort(ALL(v));
    s.insert(-LLINF);
    s.insert(LLINF);
    FOR(i,0,vn) {
        int idx = v[i].S;
        auto it = s.lower_bound(idx);
        auto it1 = it;
        it1--;
        if (le[idx] > (*it1) && ri[idx] < (*it)) s.insert(idx);
    }
    FORX(u,s) {
        if (u == LLINF || u == -LLINF) continue;
        p[u+1]++;
        z[u] = 1;
    }
    FOR(i,1,n+1) p[i] += p[i-1];
    // FOR(i,0,n) cout << z[i] << " ";
    // cout << ln;
}

void init(int32_t N, std::vector<int32_t> H) {
    n = N;
    FOR(i,0,n) h[i] = H[i]*1LL;
}

int32_t max_towers(int32_t L, int32_t R, int32_t D) {
    l = L, r = R, d = D;
    if (!done) {
        precalc();
        done = 1;
    }
    if (l == r) return 1;
    int res = p[r+1]-p[l];
    int a = *s.lower_bound(l);
    if (a == LLINF) a = n;
    if (a > l+1) {
        int idx = query(1,0,n-1,l,a-1,1).S;
        if (idx > l) {
            int x = query(1,0,n-1,l,idx-1,0).F;
            if (x <= h[idx]-d) res++;
        }
    }
    auto it = s.upper_bound(r);
    it--;
    int b = *it;
    if (b == -LLINF) b = -1;
    if (b < r-1) {
        int idx = query(1,0,n-1,b+1,r,1).S;
        if (idx < r) {
            int x = query(1,0,n-1,idx+1,r,0).F;
            if (x <= h[idx]-d) res++;
        }
    }
    if (a > r && res == 0) return 1;
    return res;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 7320 KB Output is correct
2 Correct 928 ms 13744 KB Output is correct
3 Correct 783 ms 13712 KB Output is correct
4 Correct 704 ms 13724 KB Output is correct
5 Correct 905 ms 13840 KB Output is correct
6 Correct 803 ms 13772 KB Output is correct
7 Correct 995 ms 13752 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 484 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 476 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 2 ms 528 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 2 ms 464 KB Output is correct
30 Correct 2 ms 464 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 41 ms 7740 KB Output is correct
37 Correct 68 ms 13364 KB Output is correct
38 Correct 69 ms 13108 KB Output is correct
39 Correct 66 ms 13744 KB Output is correct
40 Correct 71 ms 13916 KB Output is correct
41 Correct 73 ms 13448 KB Output is correct
42 Correct 63 ms 13884 KB Output is correct
43 Correct 51 ms 13768 KB Output is correct
44 Correct 45 ms 13784 KB Output is correct
45 Correct 44 ms 13840 KB Output is correct
46 Correct 45 ms 13588 KB Output is correct
47 Correct 58 ms 13112 KB Output is correct
48 Correct 60 ms 13880 KB Output is correct
49 Correct 62 ms 13940 KB Output is correct
50 Correct 38 ms 13844 KB Output is correct
51 Correct 48 ms 13692 KB Output is correct
52 Correct 58 ms 13112 KB Output is correct
53 Correct 60 ms 13876 KB Output is correct
54 Correct 60 ms 13960 KB Output is correct
55 Correct 40 ms 13736 KB Output is correct
56 Correct 40 ms 13660 KB Output is correct
57 Correct 68 ms 12960 KB Output is correct
58 Correct 72 ms 13184 KB Output is correct
59 Correct 68 ms 13180 KB Output is correct
60 Correct 64 ms 13956 KB Output is correct
61 Correct 72 ms 13896 KB Output is correct
62 Correct 72 ms 13592 KB Output is correct
63 Correct 76 ms 13988 KB Output is correct
64 Correct 52 ms 13780 KB Output is correct
65 Correct 45 ms 13752 KB Output is correct
66 Correct 45 ms 13588 KB Output is correct
67 Correct 44 ms 13820 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 13064 KB Output is correct
2 Correct 1060 ms 13196 KB Output is correct
3 Correct 868 ms 13200 KB Output is correct
4 Correct 786 ms 13868 KB Output is correct
5 Correct 896 ms 13972 KB Output is correct
6 Correct 848 ms 13972 KB Output is correct
7 Correct 932 ms 13956 KB Output is correct
8 Correct 792 ms 13760 KB Output is correct
9 Correct 805 ms 13736 KB Output is correct
10 Correct 820 ms 13336 KB Output is correct
11 Correct 821 ms 13484 KB Output is correct
12 Correct 814 ms 13724 KB Output is correct
13 Correct 818 ms 13844 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 61 ms 13180 KB Output is correct
18 Correct 76 ms 13992 KB Output is correct
19 Correct 67 ms 13952 KB Output is correct
20 Correct 40 ms 13840 KB Output is correct
21 Correct 45 ms 13736 KB Output is correct
22 Correct 58 ms 13200 KB Output is correct
23 Correct 60 ms 13928 KB Output is correct
24 Correct 66 ms 13876 KB Output is correct
25 Correct 39 ms 13724 KB Output is correct
26 Correct 39 ms 13668 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 564 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 1 ms 464 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 261 ms 3468 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 336 KB Output is correct
2 Correct 1 ms 484 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 476 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 2 ms 528 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 2 ms 464 KB Output is correct
30 Correct 2 ms 464 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 41 ms 7740 KB Output is correct
37 Correct 68 ms 13364 KB Output is correct
38 Correct 69 ms 13108 KB Output is correct
39 Correct 66 ms 13744 KB Output is correct
40 Correct 71 ms 13916 KB Output is correct
41 Correct 73 ms 13448 KB Output is correct
42 Correct 63 ms 13884 KB Output is correct
43 Correct 51 ms 13768 KB Output is correct
44 Correct 45 ms 13784 KB Output is correct
45 Correct 44 ms 13840 KB Output is correct
46 Correct 45 ms 13588 KB Output is correct
47 Correct 58 ms 13112 KB Output is correct
48 Correct 60 ms 13880 KB Output is correct
49 Correct 62 ms 13940 KB Output is correct
50 Correct 38 ms 13844 KB Output is correct
51 Correct 48 ms 13692 KB Output is correct
52 Correct 58 ms 13112 KB Output is correct
53 Correct 60 ms 13876 KB Output is correct
54 Correct 60 ms 13960 KB Output is correct
55 Correct 40 ms 13736 KB Output is correct
56 Correct 40 ms 13660 KB Output is correct
57 Correct 68 ms 12960 KB Output is correct
58 Correct 72 ms 13184 KB Output is correct
59 Correct 68 ms 13180 KB Output is correct
60 Correct 64 ms 13956 KB Output is correct
61 Correct 72 ms 13896 KB Output is correct
62 Correct 72 ms 13592 KB Output is correct
63 Correct 76 ms 13988 KB Output is correct
64 Correct 52 ms 13780 KB Output is correct
65 Correct 45 ms 13752 KB Output is correct
66 Correct 45 ms 13588 KB Output is correct
67 Correct 44 ms 13820 KB Output is correct
68 Correct 540 ms 13064 KB Output is correct
69 Correct 1060 ms 13196 KB Output is correct
70 Correct 868 ms 13200 KB Output is correct
71 Correct 786 ms 13868 KB Output is correct
72 Correct 896 ms 13972 KB Output is correct
73 Correct 848 ms 13972 KB Output is correct
74 Correct 932 ms 13956 KB Output is correct
75 Correct 792 ms 13760 KB Output is correct
76 Correct 805 ms 13736 KB Output is correct
77 Correct 820 ms 13336 KB Output is correct
78 Correct 821 ms 13484 KB Output is correct
79 Correct 814 ms 13724 KB Output is correct
80 Correct 818 ms 13844 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 592 KB Output is correct
83 Correct 1 ms 464 KB Output is correct
84 Correct 61 ms 13180 KB Output is correct
85 Correct 76 ms 13992 KB Output is correct
86 Correct 67 ms 13952 KB Output is correct
87 Correct 40 ms 13840 KB Output is correct
88 Correct 45 ms 13736 KB Output is correct
89 Correct 58 ms 13200 KB Output is correct
90 Correct 60 ms 13928 KB Output is correct
91 Correct 66 ms 13876 KB Output is correct
92 Correct 39 ms 13724 KB Output is correct
93 Correct 39 ms 13668 KB Output is correct
94 Correct 1 ms 464 KB Output is correct
95 Correct 1 ms 464 KB Output is correct
96 Correct 1 ms 464 KB Output is correct
97 Correct 1 ms 592 KB Output is correct
98 Correct 1 ms 464 KB Output is correct
99 Correct 1 ms 464 KB Output is correct
100 Correct 1 ms 464 KB Output is correct
101 Correct 1 ms 564 KB Output is correct
102 Correct 1 ms 464 KB Output is correct
103 Correct 1 ms 464 KB Output is correct
104 Correct 675 ms 12472 KB Output is correct
105 Correct 942 ms 13184 KB Output is correct
106 Correct 779 ms 13116 KB Output is correct
107 Correct 885 ms 13632 KB Output is correct
108 Correct 919 ms 13624 KB Output is correct
109 Correct 864 ms 13640 KB Output is correct
110 Correct 793 ms 13972 KB Output is correct
111 Correct 802 ms 13832 KB Output is correct
112 Correct 819 ms 13828 KB Output is correct
113 Correct 1072 ms 13624 KB Output is correct
114 Correct 812 ms 13332 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 7320 KB Output is correct
2 Correct 928 ms 13744 KB Output is correct
3 Correct 783 ms 13712 KB Output is correct
4 Correct 704 ms 13724 KB Output is correct
5 Correct 905 ms 13840 KB Output is correct
6 Correct 803 ms 13772 KB Output is correct
7 Correct 995 ms 13752 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 484 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 476 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 0 ms 336 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 2 ms 528 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 2 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 464 KB Output is correct
37 Correct 1 ms 464 KB Output is correct
38 Correct 1 ms 464 KB Output is correct
39 Correct 2 ms 464 KB Output is correct
40 Correct 2 ms 464 KB Output is correct
41 Correct 1 ms 464 KB Output is correct
42 Correct 1 ms 592 KB Output is correct
43 Correct 1 ms 464 KB Output is correct
44 Correct 1 ms 592 KB Output is correct
45 Correct 1 ms 464 KB Output is correct
46 Correct 41 ms 7740 KB Output is correct
47 Correct 68 ms 13364 KB Output is correct
48 Correct 69 ms 13108 KB Output is correct
49 Correct 66 ms 13744 KB Output is correct
50 Correct 71 ms 13916 KB Output is correct
51 Correct 73 ms 13448 KB Output is correct
52 Correct 63 ms 13884 KB Output is correct
53 Correct 51 ms 13768 KB Output is correct
54 Correct 45 ms 13784 KB Output is correct
55 Correct 44 ms 13840 KB Output is correct
56 Correct 45 ms 13588 KB Output is correct
57 Correct 58 ms 13112 KB Output is correct
58 Correct 60 ms 13880 KB Output is correct
59 Correct 62 ms 13940 KB Output is correct
60 Correct 38 ms 13844 KB Output is correct
61 Correct 48 ms 13692 KB Output is correct
62 Correct 58 ms 13112 KB Output is correct
63 Correct 60 ms 13876 KB Output is correct
64 Correct 60 ms 13960 KB Output is correct
65 Correct 40 ms 13736 KB Output is correct
66 Correct 40 ms 13660 KB Output is correct
67 Correct 68 ms 12960 KB Output is correct
68 Correct 72 ms 13184 KB Output is correct
69 Correct 68 ms 13180 KB Output is correct
70 Correct 64 ms 13956 KB Output is correct
71 Correct 72 ms 13896 KB Output is correct
72 Correct 72 ms 13592 KB Output is correct
73 Correct 76 ms 13988 KB Output is correct
74 Correct 52 ms 13780 KB Output is correct
75 Correct 45 ms 13752 KB Output is correct
76 Correct 45 ms 13588 KB Output is correct
77 Correct 44 ms 13820 KB Output is correct
78 Correct 540 ms 13064 KB Output is correct
79 Correct 1060 ms 13196 KB Output is correct
80 Correct 868 ms 13200 KB Output is correct
81 Correct 786 ms 13868 KB Output is correct
82 Correct 896 ms 13972 KB Output is correct
83 Correct 848 ms 13972 KB Output is correct
84 Correct 932 ms 13956 KB Output is correct
85 Correct 792 ms 13760 KB Output is correct
86 Correct 805 ms 13736 KB Output is correct
87 Correct 820 ms 13336 KB Output is correct
88 Correct 821 ms 13484 KB Output is correct
89 Correct 814 ms 13724 KB Output is correct
90 Correct 818 ms 13844 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 1 ms 592 KB Output is correct
93 Correct 1 ms 464 KB Output is correct
94 Correct 61 ms 13180 KB Output is correct
95 Correct 76 ms 13992 KB Output is correct
96 Correct 67 ms 13952 KB Output is correct
97 Correct 40 ms 13840 KB Output is correct
98 Correct 45 ms 13736 KB Output is correct
99 Correct 58 ms 13200 KB Output is correct
100 Correct 60 ms 13928 KB Output is correct
101 Correct 66 ms 13876 KB Output is correct
102 Correct 39 ms 13724 KB Output is correct
103 Correct 39 ms 13668 KB Output is correct
104 Correct 1 ms 464 KB Output is correct
105 Correct 1 ms 464 KB Output is correct
106 Correct 1 ms 464 KB Output is correct
107 Correct 1 ms 592 KB Output is correct
108 Correct 1 ms 464 KB Output is correct
109 Correct 1 ms 464 KB Output is correct
110 Correct 1 ms 464 KB Output is correct
111 Correct 1 ms 564 KB Output is correct
112 Correct 1 ms 464 KB Output is correct
113 Correct 1 ms 464 KB Output is correct
114 Incorrect 261 ms 3468 KB 2nd lines differ - on the 1st token, expected: '7063', found: '7197'
115 Halted 0 ms 0 KB -