oj.uz

답안 #864981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
864981 2023-10-23T21:18:16 Z danikoynov 새 집 (APIO18_new_home) C++14
47 / 100
 4276 ms 1048576 KB 
    #include<bits/stdc++.h>
    #define endl '\n'
        
    using namespace std;
    typedef long long ll;
        
    const int maxn = 3e5 + 10, inf = 1e9;
        
    struct store
    {
        int x, t, a, b;
    }s[maxn];
        
    struct query
    {
        int l, y, idx;
    }task[maxn];
        
    int n, k, q;
    int readInt () {
        bool minus = false;
        int result = 0;
        char ch;
        ch = getchar();
        while (true) {
            if (ch == '-') break;
            if (ch >= '0' && ch <= '9') break;
            ch = getchar();
        }
        if (ch == '-') minus = true; else result = ch-'0';
        while (true) {
            ch = getchar();
            if (ch < '0' || ch > '9') break;
            result = result*10 + (ch - '0');
        }
        if (minus)
            return -result;
        else
            return result;
    }
    void input()
    {
        n = readInt();
        k = readInt();
        q = readInt();
        ///cin >> n >> k >> q;
        for (int i = 1; i <= n; i ++)
        {
            s[i].x = readInt();
            s[i].t = readInt();
            s[i].a = readInt();
            s[i].b = readInt();
            ///        cin >> s[i].x >> s[i].t >> s[i].a >> s[i].b;
        }
        
        for (int i = 1; i <= q; i ++)
        {
                task[i].l = readInt();
                task[i].y = readInt();
                task[i].idx = i;
            ///cin >> task[i].l >> task[i].y, task[i].idx = i;
        }
    }
        
     
        
    bool cmp_query(query &t1, query &t2)
    {
        return t1.l < t2.l;
    }
        
    struct event
    {
        int type, cor, add, arrive;
        
        event(int _type, int _cor, int _add, int _arrive)
        {
            type = _type;
            cor = _cor;
            add = _add;
            arrive = _arrive;
        }
    };
        
    bool cmp_event(event &e1, event &e2)
    {
        if (e1.arrive != e2.arrive)
            return e1.arrive < e2.arrive;
        
        if (e1.add != e2.add)
            return e1.add < e2.add;
        
        return e1.cor < e2.cor; /// could have dublicates
    }
        
     
        
    multiset < int > act[maxn];
    
    struct interval_ray
    {
        int s, e;
        pair < int, int > ray;
        
        interval_ray(int _s, int _e, pair < int, int > _ray)
        {
            s = _s;
            e = _e;
            ray = _ray;
        }
     
        interval_ray(int &_s, int &_e, pair < int, int > &_ray)
        {
            s = _s;
            e = _e;
            ray = _ray;
        }
    };
     
    vector < interval_ray > seg_left, seg_right;
    
    unordered_map < int, int > cnt[maxn];
    unordered_map < int, int > ray_right[maxn], ray_left[maxn];
    vector < int > dat;
    void make_left_segment(int start, int finish, int timer, int type)
    {
        ///cout << "left " << start << " " << finish << " " << timer << endl;
        seg_left.push_back(interval_ray(ray_left[type][start], timer - 1, {start, finish}));
        ray_left[type][start] = 0;
    }
        
    void make_right_segment(int start, int finish, int timer, int type)
    {
        seg_right.push_back(interval_ray(ray_right[type][start], timer - 1, {start, finish}));
        ray_right[type][start] = 0;
    }
        
    void add_event(int type, int cor, int timer)
    {
        cnt[type][cor] ++;
        if (cnt[type][cor] > 1)
            return;

        multiset < int > :: iterator it = act[type].upper_bound(cor);
        int aft = *it;
        int bef = *prev(it);
        
        if (bef == -inf && aft == inf)
        {
            
            make_right_segment(-inf, inf, timer, type);
            ray_left[type][cor] = timer;
            ray_right[type][cor] = timer;
        }
        else
        if (bef == - inf)
        {
            make_left_segment(aft, -inf, timer, type);
            int mid = (cor + aft) / 2;
            ray_right[type][cor] = timer;
            ray_left[type][aft] = timer;
            ray_left[type][cor] = timer;
        }
        else
        if (aft == inf)
        {
            make_right_segment(bef, inf, timer, type);
            int mid = (bef + cor) / 2;
            ray_left[type][cor] = timer;
            ray_right[type][bef] = timer;
            ray_right[type][cor] = timer;
        }
        else
        {
            int mid = (bef + aft) / 2;
            make_right_segment(bef, mid, timer, type);
            make_left_segment(aft, mid + 1, timer, type);
            assert(ray_right[type][cor] == 0);
            assert(ray_left[type][aft] == 0);
            int mid_left = (bef + cor) / 2;
            ray_right[type][bef] = timer;
            ray_left[type][cor] = timer;
            int mid_right = (cor + aft) / 2;
            ray_right[type][cor] = timer;
            ray_left[type][aft] = timer;
        }
        
        act[type].insert(cor);
    }
        
        
    void remove_event(int type, int cor, int timer)
    {
        cnt[type][cor] --;
        if (cnt[type][cor] > 0)
            return;
        multiset < int > :: iterator it = act[type].find(cor);
        int aft = *next(it);
        int bef = *prev(it);
        
        if (bef == -inf && aft == inf)
        {
            ///cout << "reverse " << timer << endl;
        
            make_left_segment(cor, -inf, timer, type);
            make_right_segment(cor, +inf, timer, type);
            ray_right[type][-inf] = timer;
        
        }
        else
        if (bef == -inf)
        {
        
            ///cout << "step " << timer << endl;
            make_left_segment(cor, -inf, timer, type);
            int mid = (cor + aft) / 2;
            make_right_segment(cor, mid, timer, type);
            make_left_segment(aft, mid + 1, timer, type);
            ray_left[type][aft] = timer;
        
        
        }
        else
        if (aft == inf)
        {
        
            make_right_segment(cor, inf, timer, type);
            int mid = (bef + cor) / 2;
            make_left_segment(cor, mid + 1, timer, type);
            make_right_segment(bef, mid, timer, type);
            ray_right[type][bef] = timer;
        }
        else
        {
            int mid = (bef + aft) / 2;
            ///assert((ray_right[type][{bef, mid}]) == 0);
            ///assert((ray_left[type][{aft, mid + 1}]) == 0);
        
            int mid_left = (bef + cor) / 2;
            make_right_segment(bef, mid_left, timer, type);
            make_left_segment(cor, mid_left + 1, timer, type);
            int mid_right = (aft + cor) / 2;
            make_right_segment(cor, mid_right, timer, type);
            make_left_segment(aft, mid_right + 1, timer, type);
        
                    ray_right[type][bef] = timer;
            ray_left[type][aft] = timer;
        
        }
        
        act[type].erase(it);
    }
        
    int ans[maxn];
        
    vector < pair < int, int > > tree_left[maxn * 32], tree_right[maxn * 32];
    int pt_lf[32 * maxn], bs_lf[32 * maxn];
    int pt_rf[32 * maxn], bs_rf[32 * maxn];
        
    bool cmp_ray_second(interval_ray r1, interval_ray r2)
    {
        return r1.ray.second < r2.ray.second;
    }

    void update_range(int root, int left, int right, int qleft, int qright, pair < int, int > &ray, int type)
    {
        if (left > qright || right < qleft)
            return;
        
        if (left >= qleft && right <= qright)
        {
            if (type == -1)
                tree_left[root].push_back(ray);
            else
                tree_right[root].push_back(ray);
            return;
        }
        
        int mid = (left + right) / 2;
        update_range(root * 2, left, mid, qleft, qright, ray, type);
        update_range(root * 2 + 1, mid + 1, right, qleft, qright, ray, type);
        
    }
        
    unordered_map < int, int > event_times;
        
    void answer_queries()
    {
        sort(task + 1, task + q + 1, cmp_query);
        
        vector < event > events;
        for (int i = 1; i <= n; i ++)
        {
            events.push_back(event(s[i].t, s[i].x, 1, s[i].a));
            events.push_back(event(s[i].t, s[i].x, -1, s[i].b + 1));
        }
        
        sort(events.begin(), events.end(), cmp_event);
        
        for (int i = 1; i <= k; i ++)
        {
            act[i].insert(-inf);
            act[i].insert(inf);
            ray_right[i][-inf] = 1;
        }
        
        
        int cnt = 0;
        dat.push_back(1);
        dat.push_back(0);
        
        for (event cur : events)
        {
            ///dat.push_back(cur.arrive - 1);
            dat.push_back(cur.arrive);
            ///cout << "event " << cur.arrive << " " << cur.add << " " << cur.cor << " " << cur.type << endl;
            if (cur.add == 1)
                add_event(cur.type, cur.cor, cur.arrive);
            else
                remove_event(cur.type, cur.cor, cur.arrive);
        }
        
        dat.push_back(inf - 1);
        dat.push_back(inf);
        
        for (int i = 1; i <= q; i ++)
            dat.push_back(task[i].y);
        
        sort(dat.begin(), dat.end());
        cnt ++;
        event_times[dat[0]] = cnt;
        for (int i = 1; i < dat.size(); i ++)
        {
            if (dat[i] == dat[i - 1])
                continue;
            cnt ++;
            event_times[dat[i]] = cnt;
        }
        
        
        for (int i = 1; i <= k; i ++)
            for (auto it : ray_right[i])
            {
                if (it.second != 0)
                    make_right_segment(it.first, inf, inf, i);
            }
        
        
        sort(seg_right.begin(), seg_right.end(), cmp_ray_second);
        sort(seg_left.begin(), seg_left.end(), cmp_ray_second);
        for (interval_ray cur : seg_left)
        {
            update_range(1, 1, cnt, event_times[cur.s], event_times[cur.e + 1] - 1, cur.ray, -1);

        }
        
        for (interval_ray cur : seg_right)
        {
            update_range(1, 1, cnt, event_times[cur.s], event_times[cur.e + 1] - 1, cur.ray, 1);
        }
        
        
        for (int i = 1; i <= 4 * cnt; i ++)
        {
            pt_rf[i] = (int)(tree_right[i].size()) - 1;
            bs_rf[i] = inf;
        
            pt_lf[i] = 0;
            bs_lf[i] = -inf;

        }
        
        for (int i = q; i > 0; i --)
        {
            int longest = 0;
            int pos = event_times[task[i].y];
            int root = 1, left = 1, right = cnt;
        
            while(true)
            {
        
                while(pt_rf[root] >= 0 && task[i].l <= tree_right[root][pt_rf[root]].second)
                {
                    bs_rf[root] = min(bs_rf[root], tree_right[root][pt_rf[root]].first);
                    pt_rf[root] --;
                }
                longest = max(longest, task[i].l - bs_rf[root]);
        
        
                if (left == right)
                    break;
        
                int mid = (left + right) / 2;
                if (pos <= mid)
                {
                    root *= 2;
                    right = mid;
                }
                else
                {
                    root = root * 2 + 1;
                    left = mid + 1;
                }
            }
        
            ans[task[i].idx] = max(ans[task[i].idx], longest);
        }
        
        for (int i = 1; i <= q; i ++)
        {
            int longest = 0;
            int pos = event_times[task[i].y];
            int root = 1, left = 1, right = cnt;
            while(true)
            {
                ///cout << "step " << root << " " << left << " " << right << endl;
                while(pt_lf[root] < tree_left[root].size() && tree_left[root][pt_lf[root]].second <= task[i].l)
                {
                    bs_lf[root] = max(bs_lf[root], tree_left[root][pt_lf[root]].first);
                    pt_lf[root] ++;
                }
                longest = max(longest, bs_lf[root] - task[i].l);
                /**for (interval_ray cur : tree_left[root])
                {
                    if (task[i].l >= cur.ray.second)
                        longest = max(longest, cur.ray.first - task[i].l);
                }*/
        
        
                if (left == right)
                    break;
        
                int mid = (left + right) / 2;
                if (pos <= mid)
                {
                    root *= 2;
                    right = mid;
                }
                else
                {
                    root = root * 2 + 1;
                    left = mid + 1;
                }
            }
        
            ans[task[i].idx] = max(ans[task[i].idx], longest);
        }
        
        for (int i = 1; i <= q; i ++)
        {
            if (ans[i] > 2e8)
                cout << -1 << endl;
            else
                cout << ans[i] << endl;
        }
    }
    void solve()
    {
        input();
        answer_queries();
    }
        
    void speed()
    {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout.tie(NULL);
    }
    int main()
    {
        
        speed();
        solve();
        return 0;
    }
        
    /**
    2 1 2
    3 1 1 3
    5 1 3 4
    3 3
    3 4
        
        
        
        
    4 2 4
    3 1 1 10
    9 2 2 4
    7 2 5 7
    4 1 8 10
    5 3
    5 6
    5 9
    1 10
        
    2 1 3
    1 1 1 4
    1 1 2 6
    1 3
    1 5
    1 7
        
    1 1 1
    100000000 1 1 1
    1 1
        
        
        
    */

Compilation message

new_home.cpp: In function 'void add_event(int, int, int)':
new_home.cpp:159:17: warning: unused variable 'mid' [-Wunused-variable]
  159 |             int mid = (cor + aft) / 2;
      |                 ^~~
new_home.cpp:168:17: warning: unused variable 'mid' [-Wunused-variable]
  168 |             int mid = (bef + cor) / 2;
      |                 ^~~
new_home.cpp:180:17: warning: unused variable 'mid_left' [-Wunused-variable]
  180 |             int mid_left = (bef + cor) / 2;
      |                 ^~~~~~~~
new_home.cpp:183:17: warning: unused variable 'mid_right' [-Wunused-variable]
  183 |             int mid_right = (cor + aft) / 2;
      |                 ^~~~~~~~~
new_home.cpp: In function 'void remove_event(int, int, int)':
new_home.cpp:235:17: warning: unused variable 'mid' [-Wunused-variable]
  235 |             int mid = (bef + aft) / 2;
      |                 ^~~
new_home.cpp: In function 'void answer_queries()':
new_home.cpp:332:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  332 |         for (int i = 1; i < dat.size(); i ++)
      |                         ~~^~~~~~~~~~~~
new_home.cpp:417:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  417 |                 while(pt_lf[root] < tree_left[root].size() && tree_left[root][pt_lf[root]].second <= task[i].l)
      |                       ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 525740 KB Output is correct
2 Correct 108 ms 525728 KB Output is correct
3 Correct 110 ms 525652 KB Output is correct
4 Correct 108 ms 525652 KB Output is correct
5 Correct 110 ms 525796 KB Output is correct
6 Correct 109 ms 526016 KB Output is correct
7 Correct 112 ms 526164 KB Output is correct
8 Correct 110 ms 526204 KB Output is correct
9 Correct 113 ms 526492 KB Output is correct
10 Correct 111 ms 526184 KB Output is correct
11 Correct 109 ms 525904 KB Output is correct
12 Correct 111 ms 526100 KB Output is correct
13 Correct 113 ms 526264 KB Output is correct
14 Correct 109 ms 525880 KB Output is correct
15 Correct 110 ms 526184 KB Output is correct
16 Correct 112 ms 526208 KB Output is correct
17 Correct 113 ms 526164 KB Output is correct
18 Correct 110 ms 526164 KB Output is correct
19 Correct 111 ms 526160 KB Output is correct
20 Correct 110 ms 525944 KB Output is correct
21 Correct 108 ms 526044 KB Output is correct
22 Correct 111 ms 526344 KB Output is correct
23 Correct 110 ms 526024 KB Output is correct
24 Correct 114 ms 526164 KB Output is correct
25 Correct 110 ms 525904 KB Output is correct
26 Correct 110 ms 526048 KB Output is correct
27 Correct 108 ms 525908 KB Output is correct
28 Correct 108 ms 525860 KB Output is correct
29 Correct 108 ms 525908 KB Output is correct
30 Correct 111 ms 525892 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 525740 KB Output is correct
2 Correct 108 ms 525728 KB Output is correct
3 Correct 110 ms 525652 KB Output is correct
4 Correct 108 ms 525652 KB Output is correct
5 Correct 110 ms 525796 KB Output is correct
6 Correct 109 ms 526016 KB Output is correct
7 Correct 112 ms 526164 KB Output is correct
8 Correct 110 ms 526204 KB Output is correct
9 Correct 113 ms 526492 KB Output is correct
10 Correct 111 ms 526184 KB Output is correct
11 Correct 109 ms 525904 KB Output is correct
12 Correct 111 ms 526100 KB Output is correct
13 Correct 113 ms 526264 KB Output is correct
14 Correct 109 ms 525880 KB Output is correct
15 Correct 110 ms 526184 KB Output is correct
16 Correct 112 ms 526208 KB Output is correct
17 Correct 113 ms 526164 KB Output is correct
18 Correct 110 ms 526164 KB Output is correct
19 Correct 111 ms 526160 KB Output is correct
20 Correct 110 ms 525944 KB Output is correct
21 Correct 108 ms 526044 KB Output is correct
22 Correct 111 ms 526344 KB Output is correct
23 Correct 110 ms 526024 KB Output is correct
24 Correct 114 ms 526164 KB Output is correct
25 Correct 110 ms 525904 KB Output is correct
26 Correct 110 ms 526048 KB Output is correct
27 Correct 108 ms 525908 KB Output is correct
28 Correct 108 ms 525860 KB Output is correct
29 Correct 108 ms 525908 KB Output is correct
30 Correct 111 ms 525892 KB Output is correct
31 Correct 895 ms 619780 KB Output is correct
32 Correct 139 ms 529656 KB Output is correct
33 Correct 811 ms 623172 KB Output is correct
34 Correct 823 ms 619964 KB Output is correct
35 Correct 880 ms 620220 KB Output is correct
36 Correct 851 ms 620832 KB Output is correct
37 Correct 644 ms 613564 KB Output is correct
38 Correct 633 ms 612028 KB Output is correct
39 Correct 565 ms 600628 KB Output is correct
40 Correct 586 ms 601548 KB Output is correct
41 Correct 636 ms 593532 KB Output is correct
42 Correct 620 ms 595124 KB Output is correct
43 Correct 135 ms 530120 KB Output is correct
44 Correct 622 ms 593020 KB Output is correct
45 Correct 611 ms 588548 KB Output is correct
46 Correct 543 ms 579724 KB Output is correct
47 Correct 390 ms 578172 KB Output is correct
48 Correct 382 ms 576124 KB Output is correct
49 Correct 449 ms 582528 KB Output is correct
50 Correct 502 ms 591736 KB Output is correct
51 Correct 451 ms 580076 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1824 ms 920236 KB Output is correct
2 Correct 1799 ms 905392 KB Output is correct
3 Runtime error 1191 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4276 ms 971264 KB Output is correct
2 Correct 251 ms 549152 KB Output is correct
3 Correct 3921 ms 984196 KB Output is correct
4 Runtime error 2013 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 525740 KB Output is correct
2 Correct 108 ms 525728 KB Output is correct
3 Correct 110 ms 525652 KB Output is correct
4 Correct 108 ms 525652 KB Output is correct
5 Correct 110 ms 525796 KB Output is correct
6 Correct 109 ms 526016 KB Output is correct
7 Correct 112 ms 526164 KB Output is correct
8 Correct 110 ms 526204 KB Output is correct
9 Correct 113 ms 526492 KB Output is correct
10 Correct 111 ms 526184 KB Output is correct
11 Correct 109 ms 525904 KB Output is correct
12 Correct 111 ms 526100 KB Output is correct
13 Correct 113 ms 526264 KB Output is correct
14 Correct 109 ms 525880 KB Output is correct
15 Correct 110 ms 526184 KB Output is correct
16 Correct 112 ms 526208 KB Output is correct
17 Correct 113 ms 526164 KB Output is correct
18 Correct 110 ms 526164 KB Output is correct
19 Correct 111 ms 526160 KB Output is correct
20 Correct 110 ms 525944 KB Output is correct
21 Correct 108 ms 526044 KB Output is correct
22 Correct 111 ms 526344 KB Output is correct
23 Correct 110 ms 526024 KB Output is correct
24 Correct 114 ms 526164 KB Output is correct
25 Correct 110 ms 525904 KB Output is correct
26 Correct 110 ms 526048 KB Output is correct
27 Correct 108 ms 525908 KB Output is correct
28 Correct 108 ms 525860 KB Output is correct
29 Correct 108 ms 525908 KB Output is correct
30 Correct 111 ms 525892 KB Output is correct
31 Correct 895 ms 619780 KB Output is correct
32 Correct 139 ms 529656 KB Output is correct
33 Correct 811 ms 623172 KB Output is correct
34 Correct 823 ms 619964 KB Output is correct
35 Correct 880 ms 620220 KB Output is correct
36 Correct 851 ms 620832 KB Output is correct
37 Correct 644 ms 613564 KB Output is correct
38 Correct 633 ms 612028 KB Output is correct
39 Correct 565 ms 600628 KB Output is correct
40 Correct 586 ms 601548 KB Output is correct
41 Correct 636 ms 593532 KB Output is correct
42 Correct 620 ms 595124 KB Output is correct
43 Correct 135 ms 530120 KB Output is correct
44 Correct 622 ms 593020 KB Output is correct
45 Correct 611 ms 588548 KB Output is correct
46 Correct 543 ms 579724 KB Output is correct
47 Correct 390 ms 578172 KB Output is correct
48 Correct 382 ms 576124 KB Output is correct
49 Correct 449 ms 582528 KB Output is correct
50 Correct 502 ms 591736 KB Output is correct
51 Correct 451 ms 580076 KB Output is correct
52 Correct 677 ms 635756 KB Output is correct
53 Correct 639 ms 637668 KB Output is correct
54 Correct 744 ms 621940 KB Output is correct
55 Correct 614 ms 609788 KB Output is correct
56 Correct 604 ms 617588 KB Output is correct
57 Correct 603 ms 599296 KB Output is correct
58 Correct 619 ms 612468 KB Output is correct
59 Correct 637 ms 619896 KB Output is correct
60 Correct 637 ms 600140 KB Output is correct
61 Correct 259 ms 571844 KB Output is correct
62 Correct 683 ms 641288 KB Output is correct
63 Correct 679 ms 621748 KB Output is correct
64 Correct 695 ms 619380 KB Output is correct
65 Correct 676 ms 609396 KB Output is correct
66 Correct 637 ms 598156 KB Output is correct
67 Correct 227 ms 546912 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 525740 KB Output is correct
2 Correct 108 ms 525728 KB Output is correct
3 Correct 110 ms 525652 KB Output is correct
4 Correct 108 ms 525652 KB Output is correct
5 Correct 110 ms 525796 KB Output is correct
6 Correct 109 ms 526016 KB Output is correct
7 Correct 112 ms 526164 KB Output is correct
8 Correct 110 ms 526204 KB Output is correct
9 Correct 113 ms 526492 KB Output is correct
10 Correct 111 ms 526184 KB Output is correct
11 Correct 109 ms 525904 KB Output is correct
12 Correct 111 ms 526100 KB Output is correct
13 Correct 113 ms 526264 KB Output is correct
14 Correct 109 ms 525880 KB Output is correct
15 Correct 110 ms 526184 KB Output is correct
16 Correct 112 ms 526208 KB Output is correct
17 Correct 113 ms 526164 KB Output is correct
18 Correct 110 ms 526164 KB Output is correct
19 Correct 111 ms 526160 KB Output is correct
20 Correct 110 ms 525944 KB Output is correct
21 Correct 108 ms 526044 KB Output is correct
22 Correct 111 ms 526344 KB Output is correct
23 Correct 110 ms 526024 KB Output is correct
24 Correct 114 ms 526164 KB Output is correct
25 Correct 110 ms 525904 KB Output is correct
26 Correct 110 ms 526048 KB Output is correct
27 Correct 108 ms 525908 KB Output is correct
28 Correct 108 ms 525860 KB Output is correct
29 Correct 108 ms 525908 KB Output is correct
30 Correct 111 ms 525892 KB Output is correct
31 Correct 895 ms 619780 KB Output is correct
32 Correct 139 ms 529656 KB Output is correct
33 Correct 811 ms 623172 KB Output is correct
34 Correct 823 ms 619964 KB Output is correct
35 Correct 880 ms 620220 KB Output is correct
36 Correct 851 ms 620832 KB Output is correct
37 Correct 644 ms 613564 KB Output is correct
38 Correct 633 ms 612028 KB Output is correct
39 Correct 565 ms 600628 KB Output is correct
40 Correct 586 ms 601548 KB Output is correct
41 Correct 636 ms 593532 KB Output is correct
42 Correct 620 ms 595124 KB Output is correct
43 Correct 135 ms 530120 KB Output is correct
44 Correct 622 ms 593020 KB Output is correct
45 Correct 611 ms 588548 KB Output is correct
46 Correct 543 ms 579724 KB Output is correct
47 Correct 390 ms 578172 KB Output is correct
48 Correct 382 ms 576124 KB Output is correct
49 Correct 449 ms 582528 KB Output is correct
50 Correct 502 ms 591736 KB Output is correct
51 Correct 451 ms 580076 KB Output is correct
52 Correct 1824 ms 920236 KB Output is correct
53 Correct 1799 ms 905392 KB Output is correct
54 Runtime error 1191 ms 1048576 KB Execution killed with signal 9
55 Halted 0 ms 0 KB -