답안 #49720 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49720	2018-06-02T10:10:08 Z	gs13105	새 집 (APIO18_new_home)	C++17	80 / 100	5000 ms	448032 KB

new_home

//#pragma GCC optimize ("O3")

#include <cstdio>
#include <cassert>
#include <algorithm>
#include <vector>
#include <map>
#include <iterator>

using namespace std;

const int INF = 100000000;

static char buf[33554432];
static int fio_idx = 0;
static inline int _readInt() {
    int x = 0;
    int c = buf[fio_idx++];
    if(c <= 32) c = buf[fio_idx++];
    while(c > 32) x = 10 * x + (c - '0'), c = buf[fio_idx++];
    return x;
}

int n, k, q, bp;

int com[524288];
int c_sz;
inline int idx(int x)
{
    return lower_bound(com, com + c_sz, x) - com;
}

struct eve
{
    int t, x, d;
    bool operator <(const eve &e) const
    {
        return t != e.t ? t < e.t : d > e.d;
    }
};

struct pos
{
    int c, l, lt, r, rt;
};

eve arr[1048576];
map<int, pos> loc[524288];

struct seg
{
    int t1, t2, x, y;
    bool operator <(const seg &e) const
    {
        return x < e.x;
    }
};

seg sor0[1048576];
seg sor1[1048576];
int s_sz0, s_sz1;
inline void add_seg(const int &t1, const int &t2, const int &x, const int &y)
{
    if(t1 > t2 || x == y)
        return;

    int nt1 = bp + idx(t1);
    int nt2 = bp + idx(t2 + 1) - 1;
    if(nt1 > nt2)
        return;

    if(y < x)
        sor0[s_sz0++] = { nt1, nt2, y, x };
    else
        sor1[s_sz1++] = { nt1, nt2, -y, -x };
}

struct ent
{
    // v0 : dec, v1 : inc, q : query
    // v : { x, y }
    // q : { x, i }
    vector<pair<int, int>> v0, v1;
    vector<pair<int, int>> q;
};

ent mem[1048576];

struct que
{
    int l, y, i;
    bool operator <(const que &x) const
    {
        return l < x.l;
    }
};

que inp[524288];
bool chk[524288];
int ans[524288];

int main()
{
    fread(buf, sizeof(buf[0]), sizeof(buf), stdin);
    n = _readInt();
    k = _readInt();
    q = _readInt();
    for(int i = 0; i < n; i++)
    {
        int x, t, a, b;
        x = _readInt();
        t = _readInt();
        a = _readInt();
        b = _readInt();
        arr[2 * i] = { a, x, t };
        arr[2 * i + 1] = { b, x, -t };
    }
    for(int i = 0; i < q; i++)
    {
        int l, y;
        l = _readInt();
        y = _readInt();
        inp[i] = { l, y, i };
        com[i] = y;
    }

    sort(com, com + q);
    c_sz = unique(com, com + q) - com;

    for(bp = 1; bp < c_sz; bp *= 2);

    sort(arr, arr + 2 * n);
    int cur, cnt = 0;
    for(int u = 0; u < 2 * n; u++)
    {
        eve &e = arr[u];
        if(e.d > 0)
        {
            if(loc[e.d].size() == 0)
            {
                cnt++;
                if(cnt == k)
                    cur = e.t;
            }

            auto it = loc[e.d].find(e.x);
            if(it != loc[e.d].end())
            {
                it->second.c++;
                continue;
            }

            it = loc[e.d].insert({ e.x,{ 1, 1, e.t, INF, e.t } }).first;
            pos &p = it->second;

            if(it != loc[e.d].begin())
            {
                int x = prev(it)->first;
                pos &q = prev(it)->second;

                add_seg(q.rt, e.t - 1, x, q.r);
                q.rt = e.t;
                q.r = (x + e.x) / 2;

                p.l = (x + e.x + 1) / 2;
            }

            if(next(it) != loc[e.d].end())
            {
                int x = next(it)->first;
                pos &q = next(it)->second;

                add_seg(q.lt, e.t - 1, x, q.l);
                q.lt = e.t;
                q.l = (x + e.x + 1) / 2;

                p.r = (x + e.x) / 2;
            }
        }
        else
        {
            e.d = -e.d;

            auto it = loc[e.d].find(e.x);
            pos &p = it->second;

            if(p.c > 1)
            {
                p.c--;
                continue;
            }

            add_seg(p.lt, e.t, e.x, p.l);
            add_seg(p.rt, e.t, e.x, p.r);

            if(it != loc[e.d].begin())
            {
                int x = prev(it)->first;
                pos &q = prev(it)->second;

                add_seg(q.rt, e.t, x, q.r);
                q.rt = e.t + 1;
                if(next(it) != loc[e.d].end())
                {
                    int y = next(it)->first;
                    q.r = (x + y) / 2;
                }
                else
                    q.r = INF;
            }

            if(next(it) != loc[e.d].end())
            {
                int x = next(it)->first;
                pos &q = next(it)->second;

                add_seg(q.lt, e.t, x, q.l);
                q.lt = e.t + 1;
                if(it != loc[e.d].begin())
                {
                    int y = prev(it)->first;
                    q.l = (y + x + 1) / 2;
                }
                else
                    q.l = 1;
            }

            loc[e.d].erase(it);

            if(loc[e.d].size() == 0)
            {
                if(cnt == k)
                {
                    int t1 = idx(cur);
                    int t2 = idx(e.t + 1) - 1;
                    for(int i = t1; i <= t2; i++)
                    {
                        assert(!chk[i]);
                        chk[i] = 1;
                    }
                }
                cnt--;
            }
        }
    }

    sort(inp, inp + q);
    for(int u = 0; u < q; u++)
    {
        que &e = inp[u];
        e.y = idx(e.y);
        if(chk[e.y])
        {
            e.y += bp;
            while(e.y)
            {
                mem[e.y].q.push_back({ e.l, e.i });
                e.y /= 2;
            }
        }
        else
            ans[e.i] = -1;
    }

    {
        sort(sor0, sor0 + s_sz0);
        for(int u = 0; u < s_sz0; u++)
        {
            seg &e = sor0[u];
            while(e.t1 < e.t2)
            {
                if(e.t1 % 2 == 1)
                {
                    mem[e.t1].v0.push_back({ e.x, e.y });
                    e.t1++;
                }
                if(e.t2 % 2 == 0)
                {
                    mem[e.t2].v0.push_back({ e.x, e.y });
                    e.t2--;
                }
                e.t1 /= 2;
                e.t2 /= 2;
            }
            if(e.t1 == e.t2)
                mem[e.t1].v0.push_back({ e.x, e.y });
        }
    }
    {
        sort(sor1, sor1 + s_sz1);
        for(int u = 0; u < s_sz1; u++)
        {
            seg &e = sor1[u];
            while(e.t1 < e.t2)
            {
                if(e.t1 % 2 == 1)
                {
                    mem[e.t1].v1.push_back({ e.x, e.y });
                    e.t1++;
                }
                if(e.t2 % 2 == 0)
                {
                    mem[e.t2].v1.push_back({ e.x, e.y });
                    e.t2--;
                }
                e.t1 /= 2;
                e.t2 /= 2;
            }
            if(e.t1 == e.t2)
                mem[e.t1].v1.push_back({ e.x, e.y });
        }
    }

    for(int x = 1; x <= bp + c_sz - 1; x++)
    {
        if(mem[x].q.empty())
            continue;

        int mx, p1, p2;
        if(!mem[x].v0.empty())
        {
            mx = p1 = p2 = 0;
            while(p2 < mem[x].q.size())
            {
                if(p1 != mem[x].v0.size() && mem[x].v0[p1].first <= mem[x].q[p2].first)
                {
                    mx = max(mx, mem[x].v0[p1].second);
                    p1++;
                }
                else
                {
                    ans[mem[x].q[p2].second] = max(ans[mem[x].q[p2].second], mx - mem[x].q[p2].first);
                    p2++;
                }
            }
        }
        if(!mem[x].v1.empty())
        {
            mx = -INF;
            p1 = 0;
            p2 = mem[x].q.size() - 1;
            while(p2 >= 0)
            {
                if(p1 != mem[x].v1.size() && mem[x].v1[p1].first <= -mem[x].q[p2].first)
                {
                    mx = max(mx, mem[x].v1[p1].second);
                    p1++;
                }
                else
                {
                    ans[mem[x].q[p2].second] = max(ans[mem[x].q[p2].second], mx + mem[x].q[p2].first);
                    p2--;
                }
            }
        }
    }

    for(int i = 0; i < q; i++)
        printf("%d\n", ans[i]);
    return 0;
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:323:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(p2 < mem[x].q.size())
                   ~~~^~~~~~~~~~~~~~~~~
new_home.cpp:325:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(p1 != mem[x].v0.size() && mem[x].v0[p1].first <= mem[x].q[p2].first)
                    ~~~^~~~~~~~~~~~~~~~~~~
new_home.cpp:344:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(p1 != mem[x].v1.size() && mem[x].v1[p1].first <= -mem[x].q[p2].first)
                    ~~~^~~~~~~~~~~~~~~~~~~
new_home.cpp:104:10: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     fread(buf, sizeof(buf[0]), sizeof(buf), stdin);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	85 ms	98808 KB	Output is correct
2	Correct	79 ms	98936 KB	Output is correct
3	Correct	79 ms	99120 KB	Output is correct
4	Correct	80 ms	99196 KB	Output is correct
5	Correct	79 ms	99196 KB	Output is correct
6	Correct	82 ms	99276 KB	Output is correct
7	Correct	85 ms	99276 KB	Output is correct
8	Correct	81 ms	99324 KB	Output is correct
9	Correct	80 ms	99324 KB	Output is correct
10	Correct	87 ms	99508 KB	Output is correct
11	Correct	84 ms	99528 KB	Output is correct
12	Correct	81 ms	99528 KB	Output is correct
13	Correct	81 ms	99528 KB	Output is correct
14	Correct	80 ms	99528 KB	Output is correct
15	Correct	84 ms	99528 KB	Output is correct
16	Correct	82 ms	99528 KB	Output is correct
17	Correct	82 ms	99528 KB	Output is correct
18	Correct	89 ms	99528 KB	Output is correct
19	Correct	81 ms	99528 KB	Output is correct
20	Correct	80 ms	99528 KB	Output is correct
21	Correct	102 ms	99528 KB	Output is correct
22	Correct	92 ms	99528 KB	Output is correct
23	Correct	84 ms	99528 KB	Output is correct
24	Correct	83 ms	99528 KB	Output is correct
25	Correct	82 ms	99528 KB	Output is correct
26	Correct	91 ms	99528 KB	Output is correct
27	Correct	86 ms	99528 KB	Output is correct
28	Correct	93 ms	99528 KB	Output is correct
29	Correct	86 ms	99528 KB	Output is correct
30	Correct	87 ms	99528 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	85 ms	98808 KB	Output is correct
2	Correct	79 ms	98936 KB	Output is correct
3	Correct	79 ms	99120 KB	Output is correct
4	Correct	80 ms	99196 KB	Output is correct
5	Correct	79 ms	99196 KB	Output is correct
6	Correct	82 ms	99276 KB	Output is correct
7	Correct	85 ms	99276 KB	Output is correct
8	Correct	81 ms	99324 KB	Output is correct
9	Correct	80 ms	99324 KB	Output is correct
10	Correct	87 ms	99508 KB	Output is correct
11	Correct	84 ms	99528 KB	Output is correct
12	Correct	81 ms	99528 KB	Output is correct
13	Correct	81 ms	99528 KB	Output is correct
14	Correct	80 ms	99528 KB	Output is correct
15	Correct	84 ms	99528 KB	Output is correct
16	Correct	82 ms	99528 KB	Output is correct
17	Correct	82 ms	99528 KB	Output is correct
18	Correct	89 ms	99528 KB	Output is correct
19	Correct	81 ms	99528 KB	Output is correct
20	Correct	80 ms	99528 KB	Output is correct
21	Correct	102 ms	99528 KB	Output is correct
22	Correct	92 ms	99528 KB	Output is correct
23	Correct	84 ms	99528 KB	Output is correct
24	Correct	83 ms	99528 KB	Output is correct
25	Correct	82 ms	99528 KB	Output is correct
26	Correct	91 ms	99528 KB	Output is correct
27	Correct	86 ms	99528 KB	Output is correct
28	Correct	93 ms	99528 KB	Output is correct
29	Correct	86 ms	99528 KB	Output is correct
30	Correct	87 ms	99528 KB	Output is correct
31	Correct	953 ms	168812 KB	Output is correct
32	Correct	117 ms	168812 KB	Output is correct
33	Correct	893 ms	168812 KB	Output is correct
34	Correct	848 ms	168812 KB	Output is correct
35	Correct	968 ms	169740 KB	Output is correct
36	Correct	982 ms	169940 KB	Output is correct
37	Correct	638 ms	169940 KB	Output is correct
38	Correct	591 ms	169940 KB	Output is correct
39	Correct	491 ms	169940 KB	Output is correct
40	Correct	550 ms	169940 KB	Output is correct
41	Correct	587 ms	169940 KB	Output is correct
42	Correct	528 ms	169940 KB	Output is correct
43	Correct	107 ms	169940 KB	Output is correct
44	Correct	551 ms	169940 KB	Output is correct
45	Correct	534 ms	169940 KB	Output is correct
46	Correct	435 ms	169940 KB	Output is correct
47	Correct	289 ms	169940 KB	Output is correct
48	Correct	272 ms	169940 KB	Output is correct
49	Correct	326 ms	169940 KB	Output is correct
50	Correct	364 ms	169940 KB	Output is correct
51	Correct	321 ms	169940 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1623 ms	252100 KB	Output is correct
2	Correct	1777 ms	253788 KB	Output is correct
3	Correct	1732 ms	253788 KB	Output is correct
4	Correct	1729 ms	253788 KB	Output is correct
5	Correct	2352 ms	273540 KB	Output is correct
6	Correct	1822 ms	273540 KB	Output is correct
7	Correct	1434 ms	273540 KB	Output is correct
8	Correct	1495 ms	273540 KB	Output is correct
9	Correct	1562 ms	276852 KB	Output is correct
10	Correct	1762 ms	276852 KB	Output is correct
11	Correct	983 ms	276852 KB	Output is correct
12	Correct	1144 ms	276852 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4634 ms	344668 KB	Output is correct
2	Correct	259 ms	344668 KB	Output is correct
3	Correct	4530 ms	365260 KB	Output is correct
4	Correct	930 ms	365260 KB	Output is correct
5	Correct	2318 ms	365260 KB	Output is correct
6	Correct	2207 ms	365260 KB	Output is correct
7	Correct	4759 ms	365260 KB	Output is correct
8	Correct	4994 ms	365260 KB	Output is correct
9	Correct	1618 ms	365260 KB	Output is correct
10	Correct	3182 ms	365260 KB	Output is correct
11	Correct	4127 ms	365260 KB	Output is correct
12	Correct	4843 ms	365400 KB	Output is correct
13	Correct	1670 ms	365400 KB	Output is correct
14	Correct	1673 ms	365400 KB	Output is correct
15	Correct	2178 ms	365400 KB	Output is correct
16	Correct	2149 ms	365400 KB	Output is correct
17	Correct	2209 ms	365400 KB	Output is correct

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	85 ms	98808 KB	Output is correct
2	Correct	79 ms	98936 KB	Output is correct
3	Correct	79 ms	99120 KB	Output is correct
4	Correct	80 ms	99196 KB	Output is correct
5	Correct	79 ms	99196 KB	Output is correct
6	Correct	82 ms	99276 KB	Output is correct
7	Correct	85 ms	99276 KB	Output is correct
8	Correct	81 ms	99324 KB	Output is correct
9	Correct	80 ms	99324 KB	Output is correct
10	Correct	87 ms	99508 KB	Output is correct
11	Correct	84 ms	99528 KB	Output is correct
12	Correct	81 ms	99528 KB	Output is correct
13	Correct	81 ms	99528 KB	Output is correct
14	Correct	80 ms	99528 KB	Output is correct
15	Correct	84 ms	99528 KB	Output is correct
16	Correct	82 ms	99528 KB	Output is correct
17	Correct	82 ms	99528 KB	Output is correct
18	Correct	89 ms	99528 KB	Output is correct
19	Correct	81 ms	99528 KB	Output is correct
20	Correct	80 ms	99528 KB	Output is correct
21	Correct	102 ms	99528 KB	Output is correct
22	Correct	92 ms	99528 KB	Output is correct
23	Correct	84 ms	99528 KB	Output is correct
24	Correct	83 ms	99528 KB	Output is correct
25	Correct	82 ms	99528 KB	Output is correct
26	Correct	91 ms	99528 KB	Output is correct
27	Correct	86 ms	99528 KB	Output is correct
28	Correct	93 ms	99528 KB	Output is correct
29	Correct	86 ms	99528 KB	Output is correct
30	Correct	87 ms	99528 KB	Output is correct
31	Correct	953 ms	168812 KB	Output is correct
32	Correct	117 ms	168812 KB	Output is correct
33	Correct	893 ms	168812 KB	Output is correct
34	Correct	848 ms	168812 KB	Output is correct
35	Correct	968 ms	169740 KB	Output is correct
36	Correct	982 ms	169940 KB	Output is correct
37	Correct	638 ms	169940 KB	Output is correct
38	Correct	591 ms	169940 KB	Output is correct
39	Correct	491 ms	169940 KB	Output is correct
40	Correct	550 ms	169940 KB	Output is correct
41	Correct	587 ms	169940 KB	Output is correct
42	Correct	528 ms	169940 KB	Output is correct
43	Correct	107 ms	169940 KB	Output is correct
44	Correct	551 ms	169940 KB	Output is correct
45	Correct	534 ms	169940 KB	Output is correct
46	Correct	435 ms	169940 KB	Output is correct
47	Correct	289 ms	169940 KB	Output is correct
48	Correct	272 ms	169940 KB	Output is correct
49	Correct	326 ms	169940 KB	Output is correct
50	Correct	364 ms	169940 KB	Output is correct
51	Correct	321 ms	169940 KB	Output is correct
52	Correct	344 ms	365400 KB	Output is correct
53	Correct	329 ms	365400 KB	Output is correct
54	Correct	564 ms	365400 KB	Output is correct
55	Correct	514 ms	365400 KB	Output is correct
56	Correct	495 ms	365400 KB	Output is correct
57	Correct	601 ms	365400 KB	Output is correct
58	Correct	496 ms	365400 KB	Output is correct
59	Correct	513 ms	365400 KB	Output is correct
60	Correct	611 ms	365400 KB	Output is correct
61	Correct	117 ms	365400 KB	Output is correct
62	Correct	325 ms	365400 KB	Output is correct
63	Correct	536 ms	365400 KB	Output is correct
64	Correct	516 ms	365400 KB	Output is correct
65	Correct	594 ms	365400 KB	Output is correct
66	Correct	698 ms	365400 KB	Output is correct
67	Correct	185 ms	365400 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	85 ms	98808 KB	Output is correct
2	Correct	79 ms	98936 KB	Output is correct
3	Correct	79 ms	99120 KB	Output is correct
4	Correct	80 ms	99196 KB	Output is correct
5	Correct	79 ms	99196 KB	Output is correct
6	Correct	82 ms	99276 KB	Output is correct
7	Correct	85 ms	99276 KB	Output is correct
8	Correct	81 ms	99324 KB	Output is correct
9	Correct	80 ms	99324 KB	Output is correct
10	Correct	87 ms	99508 KB	Output is correct
11	Correct	84 ms	99528 KB	Output is correct
12	Correct	81 ms	99528 KB	Output is correct
13	Correct	81 ms	99528 KB	Output is correct
14	Correct	80 ms	99528 KB	Output is correct
15	Correct	84 ms	99528 KB	Output is correct
16	Correct	82 ms	99528 KB	Output is correct
17	Correct	82 ms	99528 KB	Output is correct
18	Correct	89 ms	99528 KB	Output is correct
19	Correct	81 ms	99528 KB	Output is correct
20	Correct	80 ms	99528 KB	Output is correct
21	Correct	102 ms	99528 KB	Output is correct
22	Correct	92 ms	99528 KB	Output is correct
23	Correct	84 ms	99528 KB	Output is correct
24	Correct	83 ms	99528 KB	Output is correct
25	Correct	82 ms	99528 KB	Output is correct
26	Correct	91 ms	99528 KB	Output is correct
27	Correct	86 ms	99528 KB	Output is correct
28	Correct	93 ms	99528 KB	Output is correct
29	Correct	86 ms	99528 KB	Output is correct
30	Correct	87 ms	99528 KB	Output is correct
31	Correct	953 ms	168812 KB	Output is correct
32	Correct	117 ms	168812 KB	Output is correct
33	Correct	893 ms	168812 KB	Output is correct
34	Correct	848 ms	168812 KB	Output is correct
35	Correct	968 ms	169740 KB	Output is correct
36	Correct	982 ms	169940 KB	Output is correct
37	Correct	638 ms	169940 KB	Output is correct
38	Correct	591 ms	169940 KB	Output is correct
39	Correct	491 ms	169940 KB	Output is correct
40	Correct	550 ms	169940 KB	Output is correct
41	Correct	587 ms	169940 KB	Output is correct
42	Correct	528 ms	169940 KB	Output is correct
43	Correct	107 ms	169940 KB	Output is correct
44	Correct	551 ms	169940 KB	Output is correct
45	Correct	534 ms	169940 KB	Output is correct
46	Correct	435 ms	169940 KB	Output is correct
47	Correct	289 ms	169940 KB	Output is correct
48	Correct	272 ms	169940 KB	Output is correct
49	Correct	326 ms	169940 KB	Output is correct
50	Correct	364 ms	169940 KB	Output is correct
51	Correct	321 ms	169940 KB	Output is correct
52	Correct	1623 ms	252100 KB	Output is correct
53	Correct	1777 ms	253788 KB	Output is correct
54	Correct	1732 ms	253788 KB	Output is correct
55	Correct	1729 ms	253788 KB	Output is correct
56	Correct	2352 ms	273540 KB	Output is correct
57	Correct	1822 ms	273540 KB	Output is correct
58	Correct	1434 ms	273540 KB	Output is correct
59	Correct	1495 ms	273540 KB	Output is correct
60	Correct	1562 ms	276852 KB	Output is correct
61	Correct	1762 ms	276852 KB	Output is correct
62	Correct	983 ms	276852 KB	Output is correct
63	Correct	1144 ms	276852 KB	Output is correct
64	Correct	4634 ms	344668 KB	Output is correct
65	Correct	259 ms	344668 KB	Output is correct
66	Correct	4530 ms	365260 KB	Output is correct
67	Correct	930 ms	365260 KB	Output is correct
68	Correct	2318 ms	365260 KB	Output is correct
69	Correct	2207 ms	365260 KB	Output is correct
70	Correct	4759 ms	365260 KB	Output is correct
71	Correct	4994 ms	365260 KB	Output is correct
72	Correct	1618 ms	365260 KB	Output is correct
73	Correct	3182 ms	365260 KB	Output is correct
74	Correct	4127 ms	365260 KB	Output is correct
75	Correct	4843 ms	365400 KB	Output is correct
76	Correct	1670 ms	365400 KB	Output is correct
77	Correct	1673 ms	365400 KB	Output is correct
78	Correct	2178 ms	365400 KB	Output is correct
79	Correct	2149 ms	365400 KB	Output is correct
80	Correct	2209 ms	365400 KB	Output is correct
81	Correct	344 ms	365400 KB	Output is correct
82	Correct	329 ms	365400 KB	Output is correct
83	Correct	564 ms	365400 KB	Output is correct
84	Correct	514 ms	365400 KB	Output is correct
85	Correct	495 ms	365400 KB	Output is correct
86	Correct	601 ms	365400 KB	Output is correct
87	Correct	496 ms	365400 KB	Output is correct
88	Correct	513 ms	365400 KB	Output is correct
89	Correct	611 ms	365400 KB	Output is correct
90	Correct	117 ms	365400 KB	Output is correct
91	Correct	325 ms	365400 KB	Output is correct
92	Correct	536 ms	365400 KB	Output is correct
93	Correct	516 ms	365400 KB	Output is correct
94	Correct	594 ms	365400 KB	Output is correct
95	Correct	698 ms	365400 KB	Output is correct
96	Correct	185 ms	365400 KB	Output is correct
97	Correct	2052 ms	365400 KB	Output is correct
98	Correct	290 ms	365400 KB	Output is correct
99	Execution timed out	5055 ms	448032 KB	Time limit exceeded
100	Halted	0 ms	0 KB	-

답안 #49720

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 23.0 / 23.0

Subtask #5 35.0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
23.0 / 23.0

Subtask #5
35.0 / 35.0

Subtask #6
0 / 20.0