oj.uz

Submission #979291

# Submission time Handle Problem Language Result Execution time Memory
979291 2024-05-10T13:14:19 Z canadavid1 Radio Towers (IOI22_towers) C++17
41 / 100
 604 ms 6528 KB 
#include "towers.h"

#include <vector>
#include <numeric>
#include <algorithm>
#include <set>


template<int comb(int,int)>
struct SegmentTree
{
private:
    std::vector<int> data;
    struct SegTreeReference
    {
    private:
        const int pos;
        SegmentTree& t;
    public:
        SegTreeReference(int pos,SegmentTree& t) : pos(pos), t(t) {}
        int operator=(int val)
        {
            t.assign(pos,val);
            return val;
        }
        operator int() const {return t.data[t.data.size()/2+pos];}
    };
public:
    SegmentTree() : data(0) {}
    SegmentTree(int num) : data(num*2,0) {}
    SegmentTree(const std::vector<int>& vec) : data(vec.size()*2)
    {
        
        for(int i = 0; i < vec.size(); i++) data[vec.size()+i] = vec[i];
        for(int i = vec.size()-1; i > 0; i--)
            data[i] = comb(data[2*i],data[2*i+1]);
    }
    void assign(int pos, int val)
    {
        data[pos] = val;
        pos >>= 1;
        for(;pos>0;pos>>=1)
            data[pos] = comb(data[2*pos],data[2*pos+1]);
        
    }
    SegTreeReference operator[](int pos)
    {
        return SegTreeReference(pos,*this);
    }
    int query(int l, int r)
    {
        l += data.size()/2;
        r += data.size()/2;
        int o = 0;
        bool f = 0;
        while(l < r)
        {
            if(l&1) if(f) o = comb(o,data[l++]); else {f=1;o=data[l++];};
            if(r&1) if(f) o = comb(o,data[--r]); else {f=1;o=data[--r];};
            l>>=1;
            r>>=1;
        }
        return o;
    }
    
};
int add(int a, int b) {return a+b;}
int max(int a, int b) {return std::max(a,b);}
std::vector<int> H;
std::vector<int> m;
SegmentTree<add> st;
SegmentTree<max> m_st;
int mn;
void init(int N, std::vector<int> _H) {
    for(auto i : _H)
    {
        if(H.size() && H.back()==i)
        {
            m.push_back(H.size()-1);
        }
        else
        {
            m.push_back(H.size());
            H.push_back(i);
        }
    }
    std::vector<int> minima(H.size());
    for(int i = 1; i < H.size()-1;i++)
        minima[i] = H[i-1] > H[i] && H[i] < H[i+1];
        // annoying if range is 2I1(1112I1)
    // WLOG take the leftmost in an equal range
    st = decltype(st)(minima);
    m_st = decltype(m_st)(H);
    for(mn=0;mn+1<N&&H[mn+1]>H[mn];mn++);
}
int ct = 0;
int max_towers(int L, int R, int D) {
    L = m[L];
    R = m[R];
    if(L==R) return 1;
    if(D==1)
    {
        auto a = st.query(L+1,R);
        if(L+1 < H.size() && H[L]<H[L+1]) a++;
        if(R > 0 && H[R]<H[R-1]) a++;
        return a;
    }
    if(++ct>1)
    {
        if(L >= mn || R <= mn) return 1;
        auto a = H[L];
        auto b = H[R];
        auto c = H[mn];
        if(a <= c-D && b <= c-D) return 2;
        return 1;
    }
    std::vector<int> idx_sorted(H.size());
    SegmentTree<max> st(H);
    std::iota(idx_sorted.begin(),idx_sorted.end(),0);
    std::sort(idx_sorted.begin(),idx_sorted.end(),[](auto a, auto b) {return H[a] < H[b];});
    std::set<int> included;
    for(auto i : idx_sorted)
    {
        if(i < L || i > R) continue;
        auto p = included.lower_bound(i);
        if(p!=included.begin())
        {
            auto l = *std::prev(p);
            l++;
            if(l==i) continue;
            if (st.query(l,i)-D < H[i]) continue;
        }
        if(p!=included.end())
        {
            auto r = *p;
            if(r==i+1) continue;
            if(st.query(i+1,r)-D < H[i]) continue;
        }
        // bool inv = false;
        // for(auto j : included)
        // {
        //     auto l = std::min(i,j);
        //     l++;
        //     auto r = std::max(i,j);
        //     if(l==r) {inv = true;break;}
        //     auto c = st.query(l,r);
        //     if(H[i] > c-D || H[j] > c-D) {inv = true;break;}
        // }
        included.insert(i);
    }
    return included.size();
}


/*
    WLOG all leased towers are local minima or endpoints
    DONE s1: "concave": lease extrema if possible
    DONE s2: N <= 1000, Q=1: choose towers from smallest to largest
    DONE s23: Q = 1
    DONE s4: D = 1
        take any which is a local minima
    s46: D fixed -> scheduling problem (each tower excludes a certain area)
        constrained: won't have ([)] - matched parens
            whichever is taller is the outer paren
        tree of ranges
    s5: L,R is entire range

    WLOG use smallest tower
    use next smallest that works
        need to quickly check if it works (logn time)
        or not (subtask 2)
    repeat
*/

Compilation message

towers.cpp: In member function 'int SegmentTree<comb>::query(int, int)':
towers.cpp:58:15: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   58 |             if(l&1) if(f) o = comb(o,data[l++]); else {f=1;o=data[l++];};
      |               ^
towers.cpp:59:15: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   59 |             if(r&1) if(f) o = comb(o,data[--r]); else {f=1;o=data[--r];};
      |               ^
towers.cpp: In function 'void init(int, std::vector<int>)':
towers.cpp:88:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for(int i = 1; i < H.size()-1;i++)
      |                    ~~^~~~~~~~~~~~
towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:104:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |         if(L+1 < H.size() && H[L]<H[L+1]) a++;
      |            ~~~~^~~~~~~~~~
towers.cpp: In instantiation of 'SegmentTree<comb>::SegmentTree(const std::vector<int>&) [with int (* comb)(int, int) = add]':
towers.cpp:92:29:   required from here
towers.cpp:34:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for(int i = 0; i < vec.size(); i++) data[vec.size()+i] = vec[i];
      |                        ~~^~~~~~~~~~~~
towers.cpp: In instantiation of 'SegmentTree<comb>::SegmentTree(const std::vector<int>&) [with int (* comb)(int, int) = max]':
towers.cpp:93:28:   required from here
towers.cpp:34:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 2620 KB Output is correct
2 Correct 572 ms 4416 KB Output is correct
3 Correct 555 ms 4164 KB Output is correct
4 Correct 562 ms 4284 KB Output is correct
5 Correct 558 ms 4244 KB Output is correct
6 Correct 577 ms 4008 KB Output is correct
7 Correct 542 ms 4196 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 19 ms 3160 KB Output is correct
37 Correct 26 ms 4244 KB Output is correct
38 Correct 23 ms 4504 KB Output is correct
39 Correct 22 ms 4248 KB Output is correct
40 Correct 26 ms 4500 KB Output is correct
41 Correct 33 ms 5236 KB Output is correct
42 Correct 22 ms 4232 KB Output is correct
43 Correct 16 ms 4244 KB Output is correct
44 Correct 13 ms 4244 KB Output is correct
45 Correct 13 ms 4244 KB Output is correct
46 Correct 12 ms 4248 KB Output is correct
47 Correct 11 ms 4008 KB Output is correct
48 Correct 10 ms 4044 KB Output is correct
49 Correct 15 ms 4008 KB Output is correct
50 Correct 15 ms 4012 KB Output is correct
51 Correct 11 ms 4008 KB Output is correct
52 Correct 11 ms 4012 KB Output is correct
53 Correct 11 ms 4016 KB Output is correct
54 Correct 11 ms 4008 KB Output is correct
55 Correct 10 ms 4012 KB Output is correct
56 Correct 11 ms 4044 KB Output is correct
57 Correct 34 ms 4604 KB Output is correct
58 Correct 41 ms 5272 KB Output is correct
59 Correct 39 ms 5380 KB Output is correct
60 Correct 45 ms 6528 KB Output is correct
61 Correct 41 ms 6068 KB Output is correct
62 Correct 38 ms 5696 KB Output is correct
63 Correct 42 ms 6296 KB Output is correct
64 Correct 21 ms 4284 KB Output is correct
65 Correct 20 ms 4248 KB Output is correct
66 Correct 19 ms 4252 KB Output is correct
67 Correct 19 ms 4252 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 417 ms 4044 KB Output is correct
2 Correct 567 ms 4008 KB Output is correct
3 Correct 604 ms 4008 KB Output is correct
4 Correct 551 ms 4012 KB Output is correct
5 Correct 549 ms 4008 KB Output is correct
6 Correct 504 ms 4000 KB Output is correct
7 Correct 571 ms 4004 KB Output is correct
8 Correct 587 ms 4012 KB Output is correct
9 Correct 536 ms 4152 KB Output is correct
10 Correct 561 ms 4004 KB Output is correct
11 Correct 551 ms 4008 KB Output is correct
12 Correct 531 ms 4184 KB Output is correct
13 Correct 535 ms 4012 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 11 ms 4200 KB Output is correct
18 Correct 12 ms 4008 KB Output is correct
19 Correct 14 ms 4260 KB Output is correct
20 Correct 13 ms 4036 KB Output is correct
21 Correct 15 ms 4004 KB Output is correct
22 Correct 11 ms 4008 KB Output is correct
23 Correct 10 ms 4016 KB Output is correct
24 Correct 12 ms 4008 KB Output is correct
25 Correct 11 ms 4016 KB Output is correct
26 Correct 10 ms 4008 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 19 ms 3160 KB Output is correct
37 Correct 26 ms 4244 KB Output is correct
38 Correct 23 ms 4504 KB Output is correct
39 Correct 22 ms 4248 KB Output is correct
40 Correct 26 ms 4500 KB Output is correct
41 Correct 33 ms 5236 KB Output is correct
42 Correct 22 ms 4232 KB Output is correct
43 Correct 16 ms 4244 KB Output is correct
44 Correct 13 ms 4244 KB Output is correct
45 Correct 13 ms 4244 KB Output is correct
46 Correct 12 ms 4248 KB Output is correct
47 Correct 11 ms 4008 KB Output is correct
48 Correct 10 ms 4044 KB Output is correct
49 Correct 15 ms 4008 KB Output is correct
50 Correct 15 ms 4012 KB Output is correct
51 Correct 11 ms 4008 KB Output is correct
52 Correct 11 ms 4012 KB Output is correct
53 Correct 11 ms 4016 KB Output is correct
54 Correct 11 ms 4008 KB Output is correct
55 Correct 10 ms 4012 KB Output is correct
56 Correct 11 ms 4044 KB Output is correct
57 Correct 34 ms 4604 KB Output is correct
58 Correct 41 ms 5272 KB Output is correct
59 Correct 39 ms 5380 KB Output is correct
60 Correct 45 ms 6528 KB Output is correct
61 Correct 41 ms 6068 KB Output is correct
62 Correct 38 ms 5696 KB Output is correct
63 Correct 42 ms 6296 KB Output is correct
64 Correct 21 ms 4284 KB Output is correct
65 Correct 20 ms 4248 KB Output is correct
66 Correct 19 ms 4252 KB Output is correct
67 Correct 19 ms 4252 KB Output is correct
68 Correct 417 ms 4044 KB Output is correct
69 Correct 567 ms 4008 KB Output is correct
70 Correct 604 ms 4008 KB Output is correct
71 Correct 551 ms 4012 KB Output is correct
72 Correct 549 ms 4008 KB Output is correct
73 Correct 504 ms 4000 KB Output is correct
74 Correct 571 ms 4004 KB Output is correct
75 Correct 587 ms 4012 KB Output is correct
76 Correct 536 ms 4152 KB Output is correct
77 Correct 561 ms 4004 KB Output is correct
78 Correct 551 ms 4008 KB Output is correct
79 Correct 531 ms 4184 KB Output is correct
80 Correct 535 ms 4012 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 11 ms 4200 KB Output is correct
85 Correct 12 ms 4008 KB Output is correct
86 Correct 14 ms 4260 KB Output is correct
87 Correct 13 ms 4036 KB Output is correct
88 Correct 15 ms 4004 KB Output is correct
89 Correct 11 ms 4008 KB Output is correct
90 Correct 10 ms 4016 KB Output is correct
91 Correct 12 ms 4008 KB Output is correct
92 Correct 11 ms 4016 KB Output is correct
93 Correct 10 ms 4008 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 0 ms 344 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 0 ms 344 KB Output is correct
98 Correct 0 ms 344 KB Output is correct
99 Correct 1 ms 344 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 0 ms 344 KB Output is correct
102 Correct 0 ms 344 KB Output is correct
103 Correct 1 ms 344 KB Output is correct
104 Incorrect 445 ms 4108 KB 2nd lines differ - on the 1st token, expected: '18702', found: '1'
105 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 2620 KB Output is correct
2 Correct 572 ms 4416 KB Output is correct
3 Correct 555 ms 4164 KB Output is correct
4 Correct 562 ms 4284 KB Output is correct
5 Correct 558 ms 4244 KB Output is correct
6 Correct 577 ms 4008 KB Output is correct
7 Correct 542 ms 4196 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 424 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 19 ms 3160 KB Output is correct
47 Correct 26 ms 4244 KB Output is correct
48 Correct 23 ms 4504 KB Output is correct
49 Correct 22 ms 4248 KB Output is correct
50 Correct 26 ms 4500 KB Output is correct
51 Correct 33 ms 5236 KB Output is correct
52 Correct 22 ms 4232 KB Output is correct
53 Correct 16 ms 4244 KB Output is correct
54 Correct 13 ms 4244 KB Output is correct
55 Correct 13 ms 4244 KB Output is correct
56 Correct 12 ms 4248 KB Output is correct
57 Correct 11 ms 4008 KB Output is correct
58 Correct 10 ms 4044 KB Output is correct
59 Correct 15 ms 4008 KB Output is correct
60 Correct 15 ms 4012 KB Output is correct
61 Correct 11 ms 4008 KB Output is correct
62 Correct 11 ms 4012 KB Output is correct
63 Correct 11 ms 4016 KB Output is correct
64 Correct 11 ms 4008 KB Output is correct
65 Correct 10 ms 4012 KB Output is correct
66 Correct 11 ms 4044 KB Output is correct
67 Correct 34 ms 4604 KB Output is correct
68 Correct 41 ms 5272 KB Output is correct
69 Correct 39 ms 5380 KB Output is correct
70 Correct 45 ms 6528 KB Output is correct
71 Correct 41 ms 6068 KB Output is correct
72 Correct 38 ms 5696 KB Output is correct
73 Correct 42 ms 6296 KB Output is correct
74 Correct 21 ms 4284 KB Output is correct
75 Correct 20 ms 4248 KB Output is correct
76 Correct 19 ms 4252 KB Output is correct
77 Correct 19 ms 4252 KB Output is correct
78 Correct 417 ms 4044 KB Output is correct
79 Correct 567 ms 4008 KB Output is correct
80 Correct 604 ms 4008 KB Output is correct
81 Correct 551 ms 4012 KB Output is correct
82 Correct 549 ms 4008 KB Output is correct
83 Correct 504 ms 4000 KB Output is correct
84 Correct 571 ms 4004 KB Output is correct
85 Correct 587 ms 4012 KB Output is correct
86 Correct 536 ms 4152 KB Output is correct
87 Correct 561 ms 4004 KB Output is correct
88 Correct 551 ms 4008 KB Output is correct
89 Correct 531 ms 4184 KB Output is correct
90 Correct 535 ms 4012 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 11 ms 4200 KB Output is correct
95 Correct 12 ms 4008 KB Output is correct
96 Correct 14 ms 4260 KB Output is correct
97 Correct 13 ms 4036 KB Output is correct
98 Correct 15 ms 4004 KB Output is correct
99 Correct 11 ms 4008 KB Output is correct
100 Correct 10 ms 4016 KB Output is correct
101 Correct 12 ms 4008 KB Output is correct
102 Correct 11 ms 4016 KB Output is correct
103 Correct 10 ms 4008 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 0 ms 344 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 1 ms 344 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 1 ms 344 KB Output is correct
114 Incorrect 184 ms 1652 KB 2nd lines differ - on the 1st token, expected: '7063', found: '1'
115 Halted 0 ms 0 KB -