oj.uz

답안 #864984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
864984 2023-10-23T21:21:57 Z danikoynov 새 집 (APIO18_new_home) C++14
80 / 100
 5000 ms 886820 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 * 12], tree_right[maxn * 12];
    int pt_lf[12 * maxn], bs_lf[12 * maxn];
    int pt_rf[12 * maxn], bs_rf[12 * 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 50 ms 244560 KB Output is correct
2 Correct 50 ms 244560 KB Output is correct
3 Correct 52 ms 244892 KB Output is correct
4 Correct 51 ms 244564 KB Output is correct
5 Correct 50 ms 244564 KB Output is correct
6 Correct 51 ms 244816 KB Output is correct
7 Correct 52 ms 245128 KB Output is correct
8 Correct 53 ms 245076 KB Output is correct
9 Correct 52 ms 245072 KB Output is correct
10 Correct 53 ms 245072 KB Output is correct
11 Correct 51 ms 244816 KB Output is correct
12 Correct 53 ms 244828 KB Output is correct
13 Correct 51 ms 244920 KB Output is correct
14 Correct 51 ms 244828 KB Output is correct
15 Correct 52 ms 244996 KB Output is correct
16 Correct 53 ms 245072 KB Output is correct
17 Correct 51 ms 244888 KB Output is correct
18 Correct 51 ms 245076 KB Output is correct
19 Correct 53 ms 245076 KB Output is correct
20 Correct 51 ms 244816 KB Output is correct
21 Correct 51 ms 245184 KB Output is correct
22 Correct 51 ms 245072 KB Output is correct
23 Correct 52 ms 245072 KB Output is correct
24 Correct 51 ms 245080 KB Output is correct
25 Correct 52 ms 244816 KB Output is correct
26 Correct 51 ms 244792 KB Output is correct
27 Correct 52 ms 244572 KB Output is correct
28 Correct 52 ms 244816 KB Output is correct
29 Correct 52 ms 244828 KB Output is correct
30 Correct 53 ms 244860 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 244560 KB Output is correct
2 Correct 50 ms 244560 KB Output is correct
3 Correct 52 ms 244892 KB Output is correct
4 Correct 51 ms 244564 KB Output is correct
5 Correct 50 ms 244564 KB Output is correct
6 Correct 51 ms 244816 KB Output is correct
7 Correct 52 ms 245128 KB Output is correct
8 Correct 53 ms 245076 KB Output is correct
9 Correct 52 ms 245072 KB Output is correct
10 Correct 53 ms 245072 KB Output is correct
11 Correct 51 ms 244816 KB Output is correct
12 Correct 53 ms 244828 KB Output is correct
13 Correct 51 ms 244920 KB Output is correct
14 Correct 51 ms 244828 KB Output is correct
15 Correct 52 ms 244996 KB Output is correct
16 Correct 53 ms 245072 KB Output is correct
17 Correct 51 ms 244888 KB Output is correct
18 Correct 51 ms 245076 KB Output is correct
19 Correct 53 ms 245076 KB Output is correct
20 Correct 51 ms 244816 KB Output is correct
21 Correct 51 ms 245184 KB Output is correct
22 Correct 51 ms 245072 KB Output is correct
23 Correct 52 ms 245072 KB Output is correct
24 Correct 51 ms 245080 KB Output is correct
25 Correct 52 ms 244816 KB Output is correct
26 Correct 51 ms 244792 KB Output is correct
27 Correct 52 ms 244572 KB Output is correct
28 Correct 52 ms 244816 KB Output is correct
29 Correct 52 ms 244828 KB Output is correct
30 Correct 53 ms 244860 KB Output is correct
31 Correct 812 ms 345464 KB Output is correct
32 Correct 87 ms 250392 KB Output is correct
33 Correct 734 ms 344504 KB Output is correct
34 Correct 763 ms 342876 KB Output is correct
35 Correct 800 ms 343604 KB Output is correct
36 Correct 800 ms 345784 KB Output is correct
37 Correct 588 ms 336004 KB Output is correct
38 Correct 583 ms 335292 KB Output is correct
39 Correct 514 ms 322444 KB Output is correct
40 Correct 530 ms 325512 KB Output is correct
41 Correct 575 ms 316748 KB Output is correct
42 Correct 566 ms 318164 KB Output is correct
43 Correct 75 ms 251084 KB Output is correct
44 Correct 558 ms 315948 KB Output is correct
45 Correct 542 ms 311664 KB Output is correct
46 Correct 445 ms 302456 KB Output is correct
47 Correct 333 ms 299192 KB Output is correct
48 Correct 324 ms 297052 KB Output is correct
49 Correct 374 ms 305428 KB Output is correct
50 Correct 448 ms 314856 KB Output is correct
51 Correct 383 ms 300892 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1773 ms 642516 KB Output is correct
2 Correct 1735 ms 609156 KB Output is correct
3 Correct 1960 ms 757360 KB Output is correct
4 Correct 1888 ms 655792 KB Output is correct
5 Correct 1664 ms 590880 KB Output is correct
6 Correct 1779 ms 637812 KB Output is correct
7 Correct 1946 ms 778888 KB Output is correct
8 Correct 1853 ms 689308 KB Output is correct
9 Correct 1949 ms 615092 KB Output is correct
10 Correct 1898 ms 632144 KB Output is correct
11 Correct 1569 ms 626996 KB Output is correct
12 Correct 1705 ms 611760 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4286 ms 683912 KB Output is correct
2 Correct 192 ms 267508 KB Output is correct
3 Correct 3908 ms 702828 KB Output is correct
4 Correct 3038 ms 806892 KB Output is correct
5 Correct 3632 ms 684192 KB Output is correct
6 Correct 3508 ms 680940 KB Output is correct
7 Correct 3815 ms 690704 KB Output is correct
8 Correct 3864 ms 697772 KB Output is correct
9 Correct 2922 ms 803504 KB Output is correct
10 Correct 3502 ms 683016 KB Output is correct
11 Correct 4238 ms 702028 KB Output is correct
12 Correct 4010 ms 707376 KB Output is correct
13 Correct 2474 ms 631232 KB Output is correct
14 Correct 2415 ms 618280 KB Output is correct
15 Correct 2741 ms 658860 KB Output is correct
16 Correct 2968 ms 682008 KB Output is correct
17 Correct 2815 ms 662296 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 244560 KB Output is correct
2 Correct 50 ms 244560 KB Output is correct
3 Correct 52 ms 244892 KB Output is correct
4 Correct 51 ms 244564 KB Output is correct
5 Correct 50 ms 244564 KB Output is correct
6 Correct 51 ms 244816 KB Output is correct
7 Correct 52 ms 245128 KB Output is correct
8 Correct 53 ms 245076 KB Output is correct
9 Correct 52 ms 245072 KB Output is correct
10 Correct 53 ms 245072 KB Output is correct
11 Correct 51 ms 244816 KB Output is correct
12 Correct 53 ms 244828 KB Output is correct
13 Correct 51 ms 244920 KB Output is correct
14 Correct 51 ms 244828 KB Output is correct
15 Correct 52 ms 244996 KB Output is correct
16 Correct 53 ms 245072 KB Output is correct
17 Correct 51 ms 244888 KB Output is correct
18 Correct 51 ms 245076 KB Output is correct
19 Correct 53 ms 245076 KB Output is correct
20 Correct 51 ms 244816 KB Output is correct
21 Correct 51 ms 245184 KB Output is correct
22 Correct 51 ms 245072 KB Output is correct
23 Correct 52 ms 245072 KB Output is correct
24 Correct 51 ms 245080 KB Output is correct
25 Correct 52 ms 244816 KB Output is correct
26 Correct 51 ms 244792 KB Output is correct
27 Correct 52 ms 244572 KB Output is correct
28 Correct 52 ms 244816 KB Output is correct
29 Correct 52 ms 244828 KB Output is correct
30 Correct 53 ms 244860 KB Output is correct
31 Correct 812 ms 345464 KB Output is correct
32 Correct 87 ms 250392 KB Output is correct
33 Correct 734 ms 344504 KB Output is correct
34 Correct 763 ms 342876 KB Output is correct
35 Correct 800 ms 343604 KB Output is correct
36 Correct 800 ms 345784 KB Output is correct
37 Correct 588 ms 336004 KB Output is correct
38 Correct 583 ms 335292 KB Output is correct
39 Correct 514 ms 322444 KB Output is correct
40 Correct 530 ms 325512 KB Output is correct
41 Correct 575 ms 316748 KB Output is correct
42 Correct 566 ms 318164 KB Output is correct
43 Correct 75 ms 251084 KB Output is correct
44 Correct 558 ms 315948 KB Output is correct
45 Correct 542 ms 311664 KB Output is correct
46 Correct 445 ms 302456 KB Output is correct
47 Correct 333 ms 299192 KB Output is correct
48 Correct 324 ms 297052 KB Output is correct
49 Correct 374 ms 305428 KB Output is correct
50 Correct 448 ms 314856 KB Output is correct
51 Correct 383 ms 300892 KB Output is correct
52 Correct 625 ms 359284 KB Output is correct
53 Correct 590 ms 360564 KB Output is correct
54 Correct 678 ms 344760 KB Output is correct
55 Correct 546 ms 333760 KB Output is correct
56 Correct 542 ms 339512 KB Output is correct
57 Correct 560 ms 323004 KB Output is correct
58 Correct 561 ms 334644 KB Output is correct
59 Correct 650 ms 341584 KB Output is correct
60 Correct 577 ms 323356 KB Output is correct
61 Correct 201 ms 292804 KB Output is correct
62 Correct 606 ms 364372 KB Output is correct
63 Correct 640 ms 344704 KB Output is correct
64 Correct 617 ms 341644 KB Output is correct
65 Correct 598 ms 332280 KB Output is correct
66 Correct 613 ms 321196 KB Output is correct
67 Correct 165 ms 269624 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 244560 KB Output is correct
2 Correct 50 ms 244560 KB Output is correct
3 Correct 52 ms 244892 KB Output is correct
4 Correct 51 ms 244564 KB Output is correct
5 Correct 50 ms 244564 KB Output is correct
6 Correct 51 ms 244816 KB Output is correct
7 Correct 52 ms 245128 KB Output is correct
8 Correct 53 ms 245076 KB Output is correct
9 Correct 52 ms 245072 KB Output is correct
10 Correct 53 ms 245072 KB Output is correct
11 Correct 51 ms 244816 KB Output is correct
12 Correct 53 ms 244828 KB Output is correct
13 Correct 51 ms 244920 KB Output is correct
14 Correct 51 ms 244828 KB Output is correct
15 Correct 52 ms 244996 KB Output is correct
16 Correct 53 ms 245072 KB Output is correct
17 Correct 51 ms 244888 KB Output is correct
18 Correct 51 ms 245076 KB Output is correct
19 Correct 53 ms 245076 KB Output is correct
20 Correct 51 ms 244816 KB Output is correct
21 Correct 51 ms 245184 KB Output is correct
22 Correct 51 ms 245072 KB Output is correct
23 Correct 52 ms 245072 KB Output is correct
24 Correct 51 ms 245080 KB Output is correct
25 Correct 52 ms 244816 KB Output is correct
26 Correct 51 ms 244792 KB Output is correct
27 Correct 52 ms 244572 KB Output is correct
28 Correct 52 ms 244816 KB Output is correct
29 Correct 52 ms 244828 KB Output is correct
30 Correct 53 ms 244860 KB Output is correct
31 Correct 812 ms 345464 KB Output is correct
32 Correct 87 ms 250392 KB Output is correct
33 Correct 734 ms 344504 KB Output is correct
34 Correct 763 ms 342876 KB Output is correct
35 Correct 800 ms 343604 KB Output is correct
36 Correct 800 ms 345784 KB Output is correct
37 Correct 588 ms 336004 KB Output is correct
38 Correct 583 ms 335292 KB Output is correct
39 Correct 514 ms 322444 KB Output is correct
40 Correct 530 ms 325512 KB Output is correct
41 Correct 575 ms 316748 KB Output is correct
42 Correct 566 ms 318164 KB Output is correct
43 Correct 75 ms 251084 KB Output is correct
44 Correct 558 ms 315948 KB Output is correct
45 Correct 542 ms 311664 KB Output is correct
46 Correct 445 ms 302456 KB Output is correct
47 Correct 333 ms 299192 KB Output is correct
48 Correct 324 ms 297052 KB Output is correct
49 Correct 374 ms 305428 KB Output is correct
50 Correct 448 ms 314856 KB Output is correct
51 Correct 383 ms 300892 KB Output is correct
52 Correct 1773 ms 642516 KB Output is correct
53 Correct 1735 ms 609156 KB Output is correct
54 Correct 1960 ms 757360 KB Output is correct
55 Correct 1888 ms 655792 KB Output is correct
56 Correct 1664 ms 590880 KB Output is correct
57 Correct 1779 ms 637812 KB Output is correct
58 Correct 1946 ms 778888 KB Output is correct
59 Correct 1853 ms 689308 KB Output is correct
60 Correct 1949 ms 615092 KB Output is correct
61 Correct 1898 ms 632144 KB Output is correct
62 Correct 1569 ms 626996 KB Output is correct
63 Correct 1705 ms 611760 KB Output is correct
64 Correct 4286 ms 683912 KB Output is correct
65 Correct 192 ms 267508 KB Output is correct
66 Correct 3908 ms 702828 KB Output is correct
67 Correct 3038 ms 806892 KB Output is correct
68 Correct 3632 ms 684192 KB Output is correct
69 Correct 3508 ms 680940 KB Output is correct
70 Correct 3815 ms 690704 KB Output is correct
71 Correct 3864 ms 697772 KB Output is correct
72 Correct 2922 ms 803504 KB Output is correct
73 Correct 3502 ms 683016 KB Output is correct
74 Correct 4238 ms 702028 KB Output is correct
75 Correct 4010 ms 707376 KB Output is correct
76 Correct 2474 ms 631232 KB Output is correct
77 Correct 2415 ms 618280 KB Output is correct
78 Correct 2741 ms 658860 KB Output is correct
79 Correct 2968 ms 682008 KB Output is correct
80 Correct 2815 ms 662296 KB Output is correct
81 Correct 625 ms 359284 KB Output is correct
82 Correct 590 ms 360564 KB Output is correct
83 Correct 678 ms 344760 KB Output is correct
84 Correct 546 ms 333760 KB Output is correct
85 Correct 542 ms 339512 KB Output is correct
86 Correct 560 ms 323004 KB Output is correct
87 Correct 561 ms 334644 KB Output is correct
88 Correct 650 ms 341584 KB Output is correct
89 Correct 577 ms 323356 KB Output is correct
90 Correct 201 ms 292804 KB Output is correct
91 Correct 606 ms 364372 KB Output is correct
92 Correct 640 ms 344704 KB Output is correct
93 Correct 617 ms 341644 KB Output is correct
94 Correct 598 ms 332280 KB Output is correct
95 Correct 613 ms 321196 KB Output is correct
96 Correct 165 ms 269624 KB Output is correct
97 Correct 4061 ms 886820 KB Output is correct
98 Correct 208 ms 269048 KB Output is correct
99 Execution timed out 5107 ms 739164 KB Time limit exceeded
100 Halted 0 ms 0 KB -