답안 #898706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
898706	2024-01-05T03:41:27 Z	gaga999	Joker (BOI20_joker)	C++17	100 / 100	1673 ms	15056 KB

Joker

#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 2e5 + 5, B = 450;
int u[N], v[N], l[N], r[N], ds[N << 1], ln = -1, n;
bool an[N];
pii rm[N << 1];
vector<int> qs[N];

int f(int x)
{
    return ds[x] < 0 ? x : f(ds[x]);
}

inline void mg(int i, int j)
{
    i = f(i), j = f(j);
    if (i != j)
    {
        if (ds[i] > ds[j])
            swap(i, j);
        rm[++ln] = mpr(j, ds[j]);
        ds[i] += ds[j], ds[j] = i;
    }
}

inline void undo(int p)
{
    while (ln > p)
        ds[ds[rm[ln].F]] -= rm[ln].S, ds[rm[ln].F] = rm[ln].S, ln--;
}

inline void add(int i)
{
    mg(u[i], v[i] + n), mg(v[i], u[i] + n);
}

signed main()
{
    int m, q;
    rd(n, m, q);
    for (int i = 1; i <= m; i++)
        rd(u[i], v[i]);
    for (int i = 0; i < q; i++)
    {
        rd(l[i], r[i]);
        qs[l[i] / B].pb(i);
    }
    init(ds, -1);
    for (int t = 0, cl = 0; cl <= m; t++, cl += B)
    {
        sort(iter(qs[t]), [&](int a, int b)
             { return r[a] > r[b]; });
        bool ok = 0;
        for (int i = 1; i < cl; i++)
        {
            if (ok)
                break;
            if (f(u[i]) == f(v[i]))
                ok = 1;
            else
                add(i);
        }
        int cr = m;
        for (int i : qs[t])
        {
            if (ok)
                an[i] = 1;
            else
            {
                while (cr > r[i])
                {
                    if (f(u[cr]) == f(v[cr]))
                        ok = 1;
                    else
                        add(cr--);
                    if (ok)
                        break;
                }
                if (ok)
                    an[i] = 1;
                else
                {
                    int pl = ln;
                    for (int j = max(1, cl); j < l[i]; j++)
                    {
                        if (f(v[j]) == f(u[j]))
                        {
                            an[i] = 1;
                            break;
                        }
                        add(j);
                    }
                    undo(pl);
                }
            }
        }
        init(ds, -1), ln = -1;
    }
    for (int i = 0; i < q; i++)
        puts(an[i] ? "YES" : "NO");
}

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	12888 KB	Output is correct
2	Correct	2 ms	12892 KB	Output is correct
3	Correct	2 ms	12908 KB	Output is correct
4	Correct	2 ms	12892 KB	Output is correct
5	Correct	2 ms	12892 KB	Output is correct
6	Correct	2 ms	12892 KB	Output is correct
7	Correct	2 ms	12892 KB	Output is correct
8	Correct	2 ms	12892 KB	Output is correct
9	Correct	2 ms	12892 KB	Output is correct
10	Correct	2 ms	12892 KB	Output is correct
11	Correct	2 ms	12892 KB	Output is correct
12	Correct	2 ms	12892 KB	Output is correct
13	Correct	2 ms	12932 KB	Output is correct
14	Correct	2 ms	12892 KB	Output is correct
15	Correct	2 ms	12892 KB	Output is correct
16	Correct	2 ms	12892 KB	Output is correct
17	Correct	2 ms	12900 KB	Output is correct
18	Correct	2 ms	12892 KB	Output is correct
19	Correct	2 ms	12892 KB	Output is correct
20	Correct	2 ms	12892 KB	Output is correct
21	Correct	2 ms	12892 KB	Output is correct
22	Correct	2 ms	12892 KB	Output is correct
23	Correct	2 ms	12892 KB	Output is correct
24	Correct	2 ms	12892 KB	Output is correct
25	Correct	2 ms	12888 KB	Output is correct
26	Correct	2 ms	12892 KB	Output is correct
27	Correct	2 ms	12892 KB	Output is correct
28	Correct	2 ms	12892 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	12888 KB	Output is correct
2	Correct	2 ms	12892 KB	Output is correct
3	Correct	2 ms	12908 KB	Output is correct
4	Correct	2 ms	12892 KB	Output is correct
5	Correct	2 ms	12892 KB	Output is correct
6	Correct	2 ms	12892 KB	Output is correct
7	Correct	2 ms	12892 KB	Output is correct
8	Correct	2 ms	12892 KB	Output is correct
9	Correct	2 ms	12892 KB	Output is correct
10	Correct	2 ms	12892 KB	Output is correct
11	Correct	2 ms	12892 KB	Output is correct
12	Correct	2 ms	12892 KB	Output is correct
13	Correct	2 ms	12932 KB	Output is correct
14	Correct	2 ms	12892 KB	Output is correct
15	Correct	2 ms	12892 KB	Output is correct
16	Correct	2 ms	12892 KB	Output is correct
17	Correct	2 ms	12900 KB	Output is correct
18	Correct	2 ms	12892 KB	Output is correct
19	Correct	2 ms	12892 KB	Output is correct
20	Correct	2 ms	12892 KB	Output is correct
21	Correct	2 ms	12892 KB	Output is correct
22	Correct	2 ms	12892 KB	Output is correct
23	Correct	2 ms	12892 KB	Output is correct
24	Correct	2 ms	12892 KB	Output is correct
25	Correct	2 ms	12888 KB	Output is correct
26	Correct	2 ms	12892 KB	Output is correct
27	Correct	2 ms	12892 KB	Output is correct
28	Correct	2 ms	12892 KB	Output is correct
29	Correct	6 ms	13144 KB	Output is correct
30	Correct	5 ms	12892 KB	Output is correct
31	Correct	4 ms	12892 KB	Output is correct
32	Correct	5 ms	12888 KB	Output is correct
33	Correct	3 ms	12892 KB	Output is correct
34	Correct	4 ms	12892 KB	Output is correct
35	Correct	5 ms	12976 KB	Output is correct
36	Correct	4 ms	12888 KB	Output is correct
37	Correct	5 ms	12888 KB	Output is correct
38	Correct	7 ms	12892 KB	Output is correct
39	Correct	5 ms	12892 KB	Output is correct
40	Correct	4 ms	12892 KB	Output is correct
41	Correct	4 ms	12892 KB	Output is correct
42	Correct	4 ms	12892 KB	Output is correct
43	Correct	3 ms	12892 KB	Output is correct
44	Correct	3 ms	12892 KB	Output is correct
45	Correct	3 ms	12892 KB	Output is correct
46	Correct	3 ms	12892 KB	Output is correct
47	Correct	4 ms	12908 KB	Output is correct
48	Correct	4 ms	12892 KB	Output is correct
49	Correct	4 ms	12976 KB	Output is correct
50	Correct	5 ms	12892 KB	Output is correct
51	Correct	5 ms	12892 KB	Output is correct
52	Correct	4 ms	12892 KB	Output is correct
53	Correct	5 ms	12892 KB	Output is correct
54	Correct	5 ms	12892 KB	Output is correct

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	12888 KB	Output is correct
2	Correct	2 ms	12892 KB	Output is correct
3	Correct	495 ms	14636 KB	Output is correct
4	Correct	681 ms	14636 KB	Output is correct
5	Correct	650 ms	14636 KB	Output is correct
6	Correct	564 ms	14640 KB	Output is correct
7	Correct	565 ms	14640 KB	Output is correct
8	Correct	1241 ms	14892 KB	Output is correct
9	Correct	1086 ms	14892 KB	Output is correct
10	Correct	728 ms	14788 KB	Output is correct
11	Correct	734 ms	14796 KB	Output is correct
12	Correct	582 ms	14788 KB	Output is correct
13	Correct	1330 ms	14536 KB	Output is correct
14	Correct	1245 ms	14640 KB	Output is correct
15	Correct	927 ms	14792 KB	Output is correct
16	Correct	737 ms	14796 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	12888 KB	Output is correct
2	Correct	2 ms	12892 KB	Output is correct
3	Correct	2 ms	12908 KB	Output is correct
4	Correct	2 ms	12892 KB	Output is correct
5	Correct	2 ms	12892 KB	Output is correct
6	Correct	2 ms	12892 KB	Output is correct
7	Correct	2 ms	12892 KB	Output is correct
8	Correct	2 ms	12892 KB	Output is correct
9	Correct	2 ms	12892 KB	Output is correct
10	Correct	2 ms	12892 KB	Output is correct
11	Correct	2 ms	12892 KB	Output is correct
12	Correct	2 ms	12892 KB	Output is correct
13	Correct	2 ms	12932 KB	Output is correct
14	Correct	2 ms	12892 KB	Output is correct
15	Correct	2 ms	12892 KB	Output is correct
16	Correct	2 ms	12892 KB	Output is correct
17	Correct	2 ms	12900 KB	Output is correct
18	Correct	2 ms	12892 KB	Output is correct
19	Correct	2 ms	12892 KB	Output is correct
20	Correct	2 ms	12892 KB	Output is correct
21	Correct	2 ms	12892 KB	Output is correct
22	Correct	2 ms	12892 KB	Output is correct
23	Correct	2 ms	12892 KB	Output is correct
24	Correct	2 ms	12892 KB	Output is correct
25	Correct	2 ms	12888 KB	Output is correct
26	Correct	2 ms	12892 KB	Output is correct
27	Correct	2 ms	12892 KB	Output is correct
28	Correct	2 ms	12892 KB	Output is correct
29	Correct	495 ms	14636 KB	Output is correct
30	Correct	681 ms	14636 KB	Output is correct
31	Correct	650 ms	14636 KB	Output is correct
32	Correct	564 ms	14640 KB	Output is correct
33	Correct	565 ms	14640 KB	Output is correct
34	Correct	1241 ms	14892 KB	Output is correct
35	Correct	1086 ms	14892 KB	Output is correct
36	Correct	728 ms	14788 KB	Output is correct
37	Correct	734 ms	14796 KB	Output is correct
38	Correct	582 ms	14788 KB	Output is correct
39	Correct	1330 ms	14536 KB	Output is correct
40	Correct	1245 ms	14640 KB	Output is correct
41	Correct	927 ms	14792 KB	Output is correct
42	Correct	737 ms	14796 KB	Output is correct
43	Correct	625 ms	14652 KB	Output is correct
44	Correct	836 ms	14628 KB	Output is correct
45	Correct	810 ms	14632 KB	Output is correct
46	Correct	681 ms	14652 KB	Output is correct
47	Correct	718 ms	14636 KB	Output is correct
48	Correct	1137 ms	14888 KB	Output is correct
49	Correct	728 ms	14888 KB	Output is correct
50	Correct	909 ms	15056 KB	Output is correct
51	Correct	848 ms	14532 KB	Output is correct
52	Correct	786 ms	14644 KB	Output is correct
53	Correct	1542 ms	14632 KB	Output is correct
54	Correct	1451 ms	14628 KB	Output is correct
55	Correct	1120 ms	14632 KB	Output is correct
56	Correct	925 ms	14648 KB	Output is correct

Subtask #5
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	12888 KB	Output is correct
2	Correct	2 ms	12892 KB	Output is correct
3	Correct	2 ms	12908 KB	Output is correct
4	Correct	2 ms	12892 KB	Output is correct
5	Correct	2 ms	12892 KB	Output is correct
6	Correct	2 ms	12892 KB	Output is correct
7	Correct	2 ms	12892 KB	Output is correct
8	Correct	2 ms	12892 KB	Output is correct
9	Correct	2 ms	12892 KB	Output is correct
10	Correct	2 ms	12892 KB	Output is correct
11	Correct	2 ms	12892 KB	Output is correct
12	Correct	2 ms	12892 KB	Output is correct
13	Correct	2 ms	12932 KB	Output is correct
14	Correct	2 ms	12892 KB	Output is correct
15	Correct	2 ms	12892 KB	Output is correct
16	Correct	2 ms	12892 KB	Output is correct
17	Correct	2 ms	12900 KB	Output is correct
18	Correct	2 ms	12892 KB	Output is correct
19	Correct	2 ms	12892 KB	Output is correct
20	Correct	2 ms	12892 KB	Output is correct
21	Correct	2 ms	12892 KB	Output is correct
22	Correct	2 ms	12892 KB	Output is correct
23	Correct	2 ms	12892 KB	Output is correct
24	Correct	2 ms	12892 KB	Output is correct
25	Correct	2 ms	12888 KB	Output is correct
26	Correct	2 ms	12892 KB	Output is correct
27	Correct	2 ms	12892 KB	Output is correct
28	Correct	2 ms	12892 KB	Output is correct
29	Correct	6 ms	13144 KB	Output is correct
30	Correct	5 ms	12892 KB	Output is correct
31	Correct	4 ms	12892 KB	Output is correct
32	Correct	5 ms	12888 KB	Output is correct
33	Correct	3 ms	12892 KB	Output is correct
34	Correct	4 ms	12892 KB	Output is correct
35	Correct	5 ms	12976 KB	Output is correct
36	Correct	4 ms	12888 KB	Output is correct
37	Correct	5 ms	12888 KB	Output is correct
38	Correct	7 ms	12892 KB	Output is correct
39	Correct	5 ms	12892 KB	Output is correct
40	Correct	4 ms	12892 KB	Output is correct
41	Correct	4 ms	12892 KB	Output is correct
42	Correct	4 ms	12892 KB	Output is correct
43	Correct	3 ms	12892 KB	Output is correct
44	Correct	3 ms	12892 KB	Output is correct
45	Correct	3 ms	12892 KB	Output is correct
46	Correct	3 ms	12892 KB	Output is correct
47	Correct	4 ms	12908 KB	Output is correct
48	Correct	4 ms	12892 KB	Output is correct
49	Correct	4 ms	12976 KB	Output is correct
50	Correct	5 ms	12892 KB	Output is correct
51	Correct	5 ms	12892 KB	Output is correct
52	Correct	4 ms	12892 KB	Output is correct
53	Correct	5 ms	12892 KB	Output is correct
54	Correct	5 ms	12892 KB	Output is correct
55	Correct	628 ms	13220 KB	Output is correct
56	Correct	1485 ms	13148 KB	Output is correct
57	Correct	628 ms	13220 KB	Output is correct
58	Correct	555 ms	13392 KB	Output is correct
59	Correct	1142 ms	13392 KB	Output is correct
60	Correct	1032 ms	13216 KB	Output is correct
61	Correct	805 ms	13216 KB	Output is correct
62	Correct	744 ms	13220 KB	Output is correct
63	Correct	1232 ms	13216 KB	Output is correct
64	Correct	1182 ms	13220 KB	Output is correct
65	Correct	953 ms	13240 KB	Output is correct

Subtask #6
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	12888 KB	Output is correct
2	Correct	2 ms	12892 KB	Output is correct
3	Correct	2 ms	12908 KB	Output is correct
4	Correct	2 ms	12892 KB	Output is correct
5	Correct	2 ms	12892 KB	Output is correct
6	Correct	2 ms	12892 KB	Output is correct
7	Correct	2 ms	12892 KB	Output is correct
8	Correct	2 ms	12892 KB	Output is correct
9	Correct	2 ms	12892 KB	Output is correct
10	Correct	2 ms	12892 KB	Output is correct
11	Correct	2 ms	12892 KB	Output is correct
12	Correct	2 ms	12892 KB	Output is correct
13	Correct	2 ms	12932 KB	Output is correct
14	Correct	2 ms	12892 KB	Output is correct
15	Correct	2 ms	12892 KB	Output is correct
16	Correct	2 ms	12892 KB	Output is correct
17	Correct	2 ms	12900 KB	Output is correct
18	Correct	2 ms	12892 KB	Output is correct
19	Correct	2 ms	12892 KB	Output is correct
20	Correct	2 ms	12892 KB	Output is correct
21	Correct	2 ms	12892 KB	Output is correct
22	Correct	2 ms	12892 KB	Output is correct
23	Correct	2 ms	12892 KB	Output is correct
24	Correct	2 ms	12892 KB	Output is correct
25	Correct	2 ms	12888 KB	Output is correct
26	Correct	2 ms	12892 KB	Output is correct
27	Correct	2 ms	12892 KB	Output is correct
28	Correct	2 ms	12892 KB	Output is correct
29	Correct	6 ms	13144 KB	Output is correct
30	Correct	5 ms	12892 KB	Output is correct
31	Correct	4 ms	12892 KB	Output is correct
32	Correct	5 ms	12888 KB	Output is correct
33	Correct	3 ms	12892 KB	Output is correct
34	Correct	4 ms	12892 KB	Output is correct
35	Correct	5 ms	12976 KB	Output is correct
36	Correct	4 ms	12888 KB	Output is correct
37	Correct	5 ms	12888 KB	Output is correct
38	Correct	7 ms	12892 KB	Output is correct
39	Correct	5 ms	12892 KB	Output is correct
40	Correct	4 ms	12892 KB	Output is correct
41	Correct	4 ms	12892 KB	Output is correct
42	Correct	4 ms	12892 KB	Output is correct
43	Correct	3 ms	12892 KB	Output is correct
44	Correct	3 ms	12892 KB	Output is correct
45	Correct	3 ms	12892 KB	Output is correct
46	Correct	3 ms	12892 KB	Output is correct
47	Correct	4 ms	12908 KB	Output is correct
48	Correct	4 ms	12892 KB	Output is correct
49	Correct	4 ms	12976 KB	Output is correct
50	Correct	5 ms	12892 KB	Output is correct
51	Correct	5 ms	12892 KB	Output is correct
52	Correct	4 ms	12892 KB	Output is correct
53	Correct	5 ms	12892 KB	Output is correct
54	Correct	5 ms	12892 KB	Output is correct
55	Correct	495 ms	14636 KB	Output is correct
56	Correct	681 ms	14636 KB	Output is correct
57	Correct	650 ms	14636 KB	Output is correct
58	Correct	564 ms	14640 KB	Output is correct
59	Correct	565 ms	14640 KB	Output is correct
60	Correct	1241 ms	14892 KB	Output is correct
61	Correct	1086 ms	14892 KB	Output is correct
62	Correct	728 ms	14788 KB	Output is correct
63	Correct	734 ms	14796 KB	Output is correct
64	Correct	582 ms	14788 KB	Output is correct
65	Correct	1330 ms	14536 KB	Output is correct
66	Correct	1245 ms	14640 KB	Output is correct
67	Correct	927 ms	14792 KB	Output is correct
68	Correct	737 ms	14796 KB	Output is correct
69	Correct	625 ms	14652 KB	Output is correct
70	Correct	836 ms	14628 KB	Output is correct
71	Correct	810 ms	14632 KB	Output is correct
72	Correct	681 ms	14652 KB	Output is correct
73	Correct	718 ms	14636 KB	Output is correct
74	Correct	1137 ms	14888 KB	Output is correct
75	Correct	728 ms	14888 KB	Output is correct
76	Correct	909 ms	15056 KB	Output is correct
77	Correct	848 ms	14532 KB	Output is correct
78	Correct	786 ms	14644 KB	Output is correct
79	Correct	1542 ms	14632 KB	Output is correct
80	Correct	1451 ms	14628 KB	Output is correct
81	Correct	1120 ms	14632 KB	Output is correct
82	Correct	925 ms	14648 KB	Output is correct
83	Correct	628 ms	13220 KB	Output is correct
84	Correct	1485 ms	13148 KB	Output is correct
85	Correct	628 ms	13220 KB	Output is correct
86	Correct	555 ms	13392 KB	Output is correct
87	Correct	1142 ms	13392 KB	Output is correct
88	Correct	1032 ms	13216 KB	Output is correct
89	Correct	805 ms	13216 KB	Output is correct
90	Correct	744 ms	13220 KB	Output is correct
91	Correct	1232 ms	13216 KB	Output is correct
92	Correct	1182 ms	13220 KB	Output is correct
93	Correct	953 ms	13240 KB	Output is correct
94	Correct	796 ms	14748 KB	Output is correct
95	Correct	1673 ms	14756 KB	Output is correct
96	Correct	942 ms	14764 KB	Output is correct
97	Correct	696 ms	14752 KB	Output is correct
98	Correct	712 ms	14748 KB	Output is correct
99	Correct	1254 ms	14996 KB	Output is correct
100	Correct	821 ms	15016 KB	Output is correct
101	Correct	941 ms	14744 KB	Output is correct
102	Correct	1030 ms	14932 KB	Output is correct
103	Correct	1016 ms	14744 KB	Output is correct
104	Correct	1556 ms	14928 KB	Output is correct
105	Correct	1330 ms	14928 KB	Output is correct
106	Correct	1222 ms	14728 KB	Output is correct
107	Correct	541 ms	14636 KB	Output is correct
108	Correct	994 ms	14828 KB	Output is correct
109	Correct	978 ms	14704 KB	Output is correct
110	Correct	991 ms	14932 KB	Output is correct
111	Correct	991 ms	14932 KB	Output is correct
112	Correct	1029 ms	14756 KB	Output is correct
113	Correct	989 ms	14752 KB	Output is correct
114	Correct	1002 ms	14932 KB	Output is correct
115	Correct	985 ms	14936 KB	Output is correct
116	Correct	1022 ms	14928 KB	Output is correct

답안 #898706

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 8.0 / 8.0

Subtask #3 25.0 / 25.0

Subtask #4 10.0 / 10.0

Subtask #5 22.0 / 22.0

Subtask #6 29.0 / 29.0

Subtask #1
6.0 / 6.0

Subtask #2
8.0 / 8.0

Subtask #3
25.0 / 25.0

Subtask #4
10.0 / 10.0

Subtask #5
22.0 / 22.0

Subtask #6
29.0 / 29.0