답안 #491595

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491595	2021-12-03T12:30:58 Z	blue	Diversity (CEOI21_diversity)	C++17	64 / 100	7000 ms	71080 KB

diversity

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int maxN = 300'000;
const int maxQ = 50'000;

const int Sp = 300'000; //******

struct fenwick_tree
{
    vector<long long> BIT = vector<long long>(1+Sp, 0);

    void add(int L, int i, long long v)
    {
        for(int j = i; j <= Sp; j += j&-j)
            BIT[j] += v;
    }

    int rangesum(int L, int i)
    {
        long long res = 0;
        for(int j = i; j >= 1; j -= j&-j)
            res += BIT[j];

        return res;
    }
};

struct segtree
{
    int l;
    int r;
    long long lp = 0;
    long long sm = 0;

    segtree* left = NULL;
    segtree* right = NULL;

    segtree()
    {
        ;
    }

    segtree(int L, int R)
    {
        l = L;
        r = R;
        if(l == r) return;
        int m = (l+r)/2;
        left = new segtree(l, m);
        right = new segtree(m+1, r);
    }

    void add(int L, int R, long long V)
    {
        if(R < L) return;
        if(R < l || r < L) return;
        else if(L <= l && r <= R)
        {
            lp += V;
            sm += (r-l+1)*V;
        }
        else
        {
            sm += V*(min(R,r) - max(L,l) + 1);
            left->add(L, R, V);
            right->add(L, R, V);
        }
    }

    long long rangesum(int L, int R)
    {
        if(R < L) return 0;
        if(R < l || r < L) return 0;
        else if(L <= l && r <= R)
        {
            return sm;
        }
        else
        {
            return lp*(min(R,r) - max(L,l) + 1) + left->rangesum(L, R) + right->rangesum(L, R);
        }
    }
};





vector<int> a(1+maxN);
vector<int> l(1+maxQ), r(1+maxQ);

int L = 1;
int R = 0;

fenwick_tree ST;
segtree ST2(1, Sp);
segtree ST3(1, Sp);

vector<int> species_size(1+Sp);
vector<int> species_rank(1+Sp); //1 = center, S = edge
vector<int> rank_species(1+Sp);

vector<int> rank_pos(1+Sp);
vector<int> pos_rank(1+Sp);

vector<int> size_lowrank(1+maxN, -1), size_highrank(1+maxN, -1);

long long curr_ans = 0;

void add(int A)
{
    // cerr << "add " << A << '\n';
    int curr_size = species_size[A];
    // cerr << "curr_size = " << curr_size << '\n';
    int B = rank_species[ size_lowrank[ curr_size ] ];



    swap(rank_species[ species_rank[A] ], rank_species[ species_rank[B] ]);
    swap(species_rank[A], species_rank[B]);
    long long T = species_size[A];
    long long P = ST.rangesum(1, rank_pos[species_rank[A]] - 1);
    long long S = R-L+1 - P - T;

    curr_ans += ((T+1)*(T+2)/2) - (T*(T+1)/2);
    curr_ans += 2*P + 2*S;
    curr_ans += ST2.rangesum(1, rank_pos[species_rank[A]] - 2);
    curr_ans += ST3.rangesum(rank_pos[species_rank[A]] + 2, Sp);

    // cerr << "A = " << A << '\n';
    species_size[A]++;

    long long RP = rank_pos[ species_rank[A] ];
    ST.add(RP, RP, +1);
    ST2.add(RP, Sp, +1);
    ST3.add(1, RP, +1);

    if(size_lowrank[curr_size+1] > size_highrank[curr_size+1])
    {
        // cerr << "creating new\n";
        size_lowrank[curr_size+1] = size_highrank[curr_size+1] = size_lowrank[curr_size];
        size_lowrank[curr_size]++;
    }
    else
    {
        // cerr << "expanding old\n";
        size_highrank[curr_size+1]++;
        size_lowrank[curr_size]++;
    }
}

void remove(int A)
{
    // cerr << "remove " << A << '\n';
    int curr_size = species_size[A];
    int B = rank_species[ size_highrank[ curr_size ] ];

    swap(rank_species[ species_rank[A] ], rank_species[ species_rank[B] ]);
    swap(species_rank[A], species_rank[B]);

    species_size[A]--;
    int RP = rank_pos[ species_rank[A] ];
    ST.add(RP, RP, -1);
    ST2.add(RP, Sp, -1);
    ST3.add(1, RP, -1);

    long long T = species_size[A];
    long long P = ST.rangesum(1, rank_pos[species_rank[A]] - 1);
    long long S = R-L+1 - P - T;

    curr_ans -= ((T+1)*(T+2)/2) - (T*(T+1)/2);
    curr_ans -= 2*P + 2*S;
    curr_ans -= ST2.rangesum(1, rank_pos[species_rank[A]] - 2);
    curr_ans -= ST3.rangesum(rank_pos[species_rank[A]] + 2, Sp);

    if(size_lowrank[curr_size-1] > size_highrank[curr_size-1])
    {
        size_lowrank[curr_size-1] = size_highrank[curr_size-1] = size_highrank[curr_size];
        size_highrank[curr_size]--;
    }
    else
    {
        size_lowrank[curr_size-1]--;
        size_highrank[curr_size]--;
    }
}



int C;

const int rt = 300;


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N, Q;
    cin >> N >> Q;

    for(int i = 1; i <= N; i++) cin >> a[i];

    for(int j = 1; j <= Q; j++) cin >> l[j] >> r[j];

    vector<long long> answer(1+Q);

    vector<int> queries(Q);
    for(int j = 0; j < Q; j++) queries[j] = j+1;
    sort(queries.begin(), queries.end(), [] (int u, int v)
    {
        if(l[u] / rt != l[v] / rt) return l[u] / rt < l[v] / rt;
        else return r[u] < r[v];
    });

    L = 1;
    R = 0;

    for(int s = 1; s <= Sp; s++)
    {
        species_size[s] = 0;
        species_rank[s] = s;
        rank_species[s] = s;
    }

    C = (1+Sp)/2;
    if(Sp % 2 == 0)
        C++;

    vector<int> P(Sp);
    for(int i = 0; i < Sp; i++) P[i] = i+1;
    sort(P.begin(), P.end(), [] (int u, int v)
    {
        if(abs(u - C) != abs(v - C)) return abs(u - C) < abs(v - C);
        else return u < v;
    });

    for(int i = 1; i <= Sp; i++)
    {
        rank_pos[i] = P[i-1];
        pos_rank[ P[i-1] ] = i;
    }

    size_lowrank[0] = 1;
    size_highrank[0] = Sp;
    for(int i = 1; i <= N; i++)
    {
        size_lowrank[i] = -1;
        size_highrank[i] = -2;
    }

    L = l[queries[0]];
    R = L-1;

    for(int j: queries)
    {
        while(R < r[j])
        {
            add(a[R+1]);
            R++;
        }

        while(r[j] < R)
        {
            R--;
            remove(a[R+1]);
        }

        while(l[j] < L)
        {
            add(a[L-1]);
            L--;
        }

        while(L < l[j])
        {
            L++;
            remove(a[L-1]);
        }

        answer[j] = curr_ans;
    }

    for(int j = 1; j <= Q; j++) cout << answer[j] << '\n';
}

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	109 ms	69872 KB	Output is correct
2	Correct	103 ms	69968 KB	Output is correct
3	Correct	107 ms	69972 KB	Output is correct
4	Correct	108 ms	69912 KB	Output is correct
5	Correct	97 ms	69956 KB	Output is correct
6	Correct	97 ms	69856 KB	Output is correct
7	Correct	96 ms	69960 KB	Output is correct
8	Correct	100 ms	69864 KB	Output is correct
9	Correct	99 ms	69944 KB	Output is correct
10	Correct	97 ms	69956 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	111 ms	69844 KB	Output is correct
2	Correct	95 ms	69972 KB	Output is correct
3	Correct	101 ms	70056 KB	Output is correct
4	Correct	138 ms	69956 KB	Output is correct
5	Correct	189 ms	69952 KB	Output is correct
6	Correct	255 ms	69908 KB	Output is correct
7	Correct	242 ms	69984 KB	Output is correct
8	Correct	247 ms	69984 KB	Output is correct
9	Correct	231 ms	69864 KB	Output is correct
10	Correct	244 ms	69984 KB	Output is correct
11	Correct	243 ms	69980 KB	Output is correct
12	Correct	230 ms	69908 KB	Output is correct
13	Correct	240 ms	69944 KB	Output is correct
14	Correct	230 ms	69972 KB	Output is correct
15	Correct	230 ms	69972 KB	Output is correct

Subtask #3
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	111 ms	69844 KB	Output is correct
2	Correct	95 ms	69972 KB	Output is correct
3	Correct	101 ms	70056 KB	Output is correct
4	Correct	138 ms	69956 KB	Output is correct
5	Correct	189 ms	69952 KB	Output is correct
6	Correct	255 ms	69908 KB	Output is correct
7	Correct	242 ms	69984 KB	Output is correct
8	Correct	247 ms	69984 KB	Output is correct
9	Correct	231 ms	69864 KB	Output is correct
10	Correct	244 ms	69984 KB	Output is correct
11	Correct	243 ms	69980 KB	Output is correct
12	Correct	230 ms	69908 KB	Output is correct
13	Correct	240 ms	69944 KB	Output is correct
14	Correct	230 ms	69972 KB	Output is correct
15	Correct	230 ms	69972 KB	Output is correct
16	Correct	122 ms	69968 KB	Output is correct
17	Correct	112 ms	69976 KB	Output is correct
18	Correct	101 ms	69940 KB	Output is correct
19	Correct	149 ms	69972 KB	Output is correct
20	Correct	205 ms	69876 KB	Output is correct
21	Correct	256 ms	69956 KB	Output is correct
22	Correct	244 ms	69960 KB	Output is correct
23	Correct	248 ms	69968 KB	Output is correct
24	Correct	241 ms	69960 KB	Output is correct
25	Correct	234 ms	69956 KB	Output is correct
26	Correct	252 ms	69992 KB	Output is correct
27	Correct	241 ms	69956 KB	Output is correct
28	Correct	248 ms	70032 KB	Output is correct
29	Correct	279 ms	69968 KB	Output is correct
30	Correct	251 ms	69944 KB	Output is correct

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	111 ms	69844 KB	Output is correct
2	Correct	95 ms	69972 KB	Output is correct
3	Correct	101 ms	70056 KB	Output is correct
4	Correct	138 ms	69956 KB	Output is correct
5	Correct	189 ms	69952 KB	Output is correct
6	Correct	255 ms	69908 KB	Output is correct
7	Correct	242 ms	69984 KB	Output is correct
8	Correct	247 ms	69984 KB	Output is correct
9	Correct	231 ms	69864 KB	Output is correct
10	Correct	244 ms	69984 KB	Output is correct
11	Correct	243 ms	69980 KB	Output is correct
12	Correct	230 ms	69908 KB	Output is correct
13	Correct	240 ms	69944 KB	Output is correct
14	Correct	230 ms	69972 KB	Output is correct
15	Correct	230 ms	69972 KB	Output is correct
16	Correct	122 ms	69968 KB	Output is correct
17	Correct	112 ms	69976 KB	Output is correct
18	Correct	101 ms	69940 KB	Output is correct
19	Correct	149 ms	69972 KB	Output is correct
20	Correct	205 ms	69876 KB	Output is correct
21	Correct	256 ms	69956 KB	Output is correct
22	Correct	244 ms	69960 KB	Output is correct
23	Correct	248 ms	69968 KB	Output is correct
24	Correct	241 ms	69960 KB	Output is correct
25	Correct	234 ms	69956 KB	Output is correct
26	Correct	252 ms	69992 KB	Output is correct
27	Correct	241 ms	69956 KB	Output is correct
28	Correct	248 ms	70032 KB	Output is correct
29	Correct	279 ms	69968 KB	Output is correct
30	Correct	251 ms	69944 KB	Output is correct
31	Correct	105 ms	69972 KB	Output is correct
32	Correct	106 ms	69960 KB	Output is correct
33	Correct	108 ms	69972 KB	Output is correct
34	Correct	106 ms	69932 KB	Output is correct
35	Correct	151 ms	69884 KB	Output is correct
36	Correct	118 ms	69976 KB	Output is correct
37	Correct	123 ms	69876 KB	Output is correct
38	Correct	127 ms	70048 KB	Output is correct
39	Correct	160 ms	69976 KB	Output is correct
40	Correct	222 ms	69980 KB	Output is correct
41	Correct	301 ms	70080 KB	Output is correct
42	Correct	289 ms	70040 KB	Output is correct
43	Correct	319 ms	69976 KB	Output is correct
44	Correct	287 ms	69980 KB	Output is correct
45	Correct	307 ms	70084 KB	Output is correct
46	Correct	310 ms	70096 KB	Output is correct
47	Correct	325 ms	69968 KB	Output is correct
48	Correct	315 ms	70056 KB	Output is correct
49	Correct	303 ms	69976 KB	Output is correct
50	Correct	314 ms	70020 KB	Output is correct
51	Correct	313 ms	70084 KB	Output is correct
52	Correct	296 ms	70052 KB	Output is correct
53	Correct	316 ms	69956 KB	Output is correct
54	Correct	290 ms	69876 KB	Output is correct
55	Correct	299 ms	69980 KB	Output is correct
56	Correct	318 ms	69868 KB	Output is correct
57	Correct	349 ms	69980 KB	Output is correct
58	Correct	330 ms	69984 KB	Output is correct
59	Correct	326 ms	69980 KB	Output is correct
60	Correct	333 ms	69976 KB	Output is correct

Subtask #5
26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	109 ms	69872 KB	Output is correct
2	Correct	103 ms	69968 KB	Output is correct
3	Correct	107 ms	69972 KB	Output is correct
4	Correct	108 ms	69912 KB	Output is correct
5	Correct	97 ms	69956 KB	Output is correct
6	Correct	97 ms	69856 KB	Output is correct
7	Correct	96 ms	69960 KB	Output is correct
8	Correct	100 ms	69864 KB	Output is correct
9	Correct	99 ms	69944 KB	Output is correct
10	Correct	97 ms	69956 KB	Output is correct
11	Correct	111 ms	69844 KB	Output is correct
12	Correct	95 ms	69972 KB	Output is correct
13	Correct	101 ms	70056 KB	Output is correct
14	Correct	138 ms	69956 KB	Output is correct
15	Correct	189 ms	69952 KB	Output is correct
16	Correct	255 ms	69908 KB	Output is correct
17	Correct	242 ms	69984 KB	Output is correct
18	Correct	247 ms	69984 KB	Output is correct
19	Correct	231 ms	69864 KB	Output is correct
20	Correct	244 ms	69984 KB	Output is correct
21	Correct	243 ms	69980 KB	Output is correct
22	Correct	230 ms	69908 KB	Output is correct
23	Correct	240 ms	69944 KB	Output is correct
24	Correct	230 ms	69972 KB	Output is correct
25	Correct	230 ms	69972 KB	Output is correct
26	Correct	122 ms	69968 KB	Output is correct
27	Correct	112 ms	69976 KB	Output is correct
28	Correct	101 ms	69940 KB	Output is correct
29	Correct	149 ms	69972 KB	Output is correct
30	Correct	205 ms	69876 KB	Output is correct
31	Correct	256 ms	69956 KB	Output is correct
32	Correct	244 ms	69960 KB	Output is correct
33	Correct	248 ms	69968 KB	Output is correct
34	Correct	241 ms	69960 KB	Output is correct
35	Correct	234 ms	69956 KB	Output is correct
36	Correct	252 ms	69992 KB	Output is correct
37	Correct	241 ms	69956 KB	Output is correct
38	Correct	248 ms	70032 KB	Output is correct
39	Correct	279 ms	69968 KB	Output is correct
40	Correct	251 ms	69944 KB	Output is correct
41	Correct	105 ms	69972 KB	Output is correct
42	Correct	106 ms	69960 KB	Output is correct
43	Correct	108 ms	69972 KB	Output is correct
44	Correct	106 ms	69932 KB	Output is correct
45	Correct	151 ms	69884 KB	Output is correct
46	Correct	118 ms	69976 KB	Output is correct
47	Correct	123 ms	69876 KB	Output is correct
48	Correct	127 ms	70048 KB	Output is correct
49	Correct	160 ms	69976 KB	Output is correct
50	Correct	222 ms	69980 KB	Output is correct
51	Correct	301 ms	70080 KB	Output is correct
52	Correct	289 ms	70040 KB	Output is correct
53	Correct	319 ms	69976 KB	Output is correct
54	Correct	287 ms	69980 KB	Output is correct
55	Correct	307 ms	70084 KB	Output is correct
56	Correct	310 ms	70096 KB	Output is correct
57	Correct	325 ms	69968 KB	Output is correct
58	Correct	315 ms	70056 KB	Output is correct
59	Correct	303 ms	69976 KB	Output is correct
60	Correct	314 ms	70020 KB	Output is correct
61	Correct	313 ms	70084 KB	Output is correct
62	Correct	296 ms	70052 KB	Output is correct
63	Correct	316 ms	69956 KB	Output is correct
64	Correct	290 ms	69876 KB	Output is correct
65	Correct	299 ms	69980 KB	Output is correct
66	Correct	318 ms	69868 KB	Output is correct
67	Correct	349 ms	69980 KB	Output is correct
68	Correct	330 ms	69984 KB	Output is correct
69	Correct	326 ms	69980 KB	Output is correct
70	Correct	333 ms	69976 KB	Output is correct
71	Correct	188 ms	69884 KB	Output is correct
72	Correct	145 ms	69976 KB	Output is correct
73	Correct	152 ms	69972 KB	Output is correct
74	Correct	148 ms	69920 KB	Output is correct
75	Correct	139 ms	69852 KB	Output is correct
76	Correct	212 ms	69856 KB	Output is correct
77	Correct	182 ms	69976 KB	Output is correct
78	Correct	204 ms	69972 KB	Output is correct
79	Correct	192 ms	69856 KB	Output is correct
80	Correct	191 ms	69976 KB	Output is correct
81	Correct	299 ms	69992 KB	Output is correct
82	Correct	276 ms	69972 KB	Output is correct
83	Correct	285 ms	69972 KB	Output is correct
84	Correct	280 ms	69980 KB	Output is correct
85	Correct	344 ms	69984 KB	Output is correct
86	Correct	314 ms	69888 KB	Output is correct
87	Correct	287 ms	69980 KB	Output is correct
88	Correct	284 ms	69900 KB	Output is correct
89	Correct	274 ms	69976 KB	Output is correct
90	Correct	298 ms	69980 KB	Output is correct
91	Correct	357 ms	69976 KB	Output is correct
92	Correct	414 ms	69968 KB	Output is correct
93	Correct	390 ms	69976 KB	Output is correct
94	Correct	400 ms	69968 KB	Output is correct
95	Correct	367 ms	69968 KB	Output is correct
96	Correct	359 ms	69956 KB	Output is correct
97	Correct	356 ms	69976 KB	Output is correct
98	Correct	378 ms	69980 KB	Output is correct
99	Correct	356 ms	69968 KB	Output is correct
100	Correct	406 ms	69976 KB	Output is correct
101	Correct	368 ms	69984 KB	Output is correct
102	Correct	359 ms	69908 KB	Output is correct
103	Correct	336 ms	69952 KB	Output is correct
104	Correct	361 ms	69912 KB	Output is correct
105	Correct	350 ms	69956 KB	Output is correct
106	Correct	334 ms	69980 KB	Output is correct
107	Correct	340 ms	69976 KB	Output is correct
108	Correct	332 ms	69912 KB	Output is correct
109	Correct	354 ms	70092 KB	Output is correct
110	Correct	337 ms	69960 KB	Output is correct
111	Correct	336 ms	69976 KB	Output is correct
112	Correct	333 ms	69956 KB	Output is correct
113	Correct	350 ms	70012 KB	Output is correct
114	Correct	338 ms	69900 KB	Output is correct
115	Correct	326 ms	69980 KB	Output is correct

Subtask #6
0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	109 ms	69872 KB	Output is correct
2	Correct	103 ms	69968 KB	Output is correct
3	Correct	107 ms	69972 KB	Output is correct
4	Correct	108 ms	69912 KB	Output is correct
5	Correct	97 ms	69956 KB	Output is correct
6	Correct	97 ms	69856 KB	Output is correct
7	Correct	96 ms	69960 KB	Output is correct
8	Correct	100 ms	69864 KB	Output is correct
9	Correct	99 ms	69944 KB	Output is correct
10	Correct	97 ms	69956 KB	Output is correct
11	Correct	111 ms	69844 KB	Output is correct
12	Correct	95 ms	69972 KB	Output is correct
13	Correct	101 ms	70056 KB	Output is correct
14	Correct	138 ms	69956 KB	Output is correct
15	Correct	189 ms	69952 KB	Output is correct
16	Correct	255 ms	69908 KB	Output is correct
17	Correct	242 ms	69984 KB	Output is correct
18	Correct	247 ms	69984 KB	Output is correct
19	Correct	231 ms	69864 KB	Output is correct
20	Correct	244 ms	69984 KB	Output is correct
21	Correct	243 ms	69980 KB	Output is correct
22	Correct	230 ms	69908 KB	Output is correct
23	Correct	240 ms	69944 KB	Output is correct
24	Correct	230 ms	69972 KB	Output is correct
25	Correct	230 ms	69972 KB	Output is correct
26	Correct	122 ms	69968 KB	Output is correct
27	Correct	112 ms	69976 KB	Output is correct
28	Correct	101 ms	69940 KB	Output is correct
29	Correct	149 ms	69972 KB	Output is correct
30	Correct	205 ms	69876 KB	Output is correct
31	Correct	256 ms	69956 KB	Output is correct
32	Correct	244 ms	69960 KB	Output is correct
33	Correct	248 ms	69968 KB	Output is correct
34	Correct	241 ms	69960 KB	Output is correct
35	Correct	234 ms	69956 KB	Output is correct
36	Correct	252 ms	69992 KB	Output is correct
37	Correct	241 ms	69956 KB	Output is correct
38	Correct	248 ms	70032 KB	Output is correct
39	Correct	279 ms	69968 KB	Output is correct
40	Correct	251 ms	69944 KB	Output is correct
41	Correct	105 ms	69972 KB	Output is correct
42	Correct	106 ms	69960 KB	Output is correct
43	Correct	108 ms	69972 KB	Output is correct
44	Correct	106 ms	69932 KB	Output is correct
45	Correct	151 ms	69884 KB	Output is correct
46	Correct	118 ms	69976 KB	Output is correct
47	Correct	123 ms	69876 KB	Output is correct
48	Correct	127 ms	70048 KB	Output is correct
49	Correct	160 ms	69976 KB	Output is correct
50	Correct	222 ms	69980 KB	Output is correct
51	Correct	301 ms	70080 KB	Output is correct
52	Correct	289 ms	70040 KB	Output is correct
53	Correct	319 ms	69976 KB	Output is correct
54	Correct	287 ms	69980 KB	Output is correct
55	Correct	307 ms	70084 KB	Output is correct
56	Correct	310 ms	70096 KB	Output is correct
57	Correct	325 ms	69968 KB	Output is correct
58	Correct	315 ms	70056 KB	Output is correct
59	Correct	303 ms	69976 KB	Output is correct
60	Correct	314 ms	70020 KB	Output is correct
61	Correct	313 ms	70084 KB	Output is correct
62	Correct	296 ms	70052 KB	Output is correct
63	Correct	316 ms	69956 KB	Output is correct
64	Correct	290 ms	69876 KB	Output is correct
65	Correct	299 ms	69980 KB	Output is correct
66	Correct	318 ms	69868 KB	Output is correct
67	Correct	349 ms	69980 KB	Output is correct
68	Correct	330 ms	69984 KB	Output is correct
69	Correct	326 ms	69980 KB	Output is correct
70	Correct	333 ms	69976 KB	Output is correct
71	Correct	188 ms	69884 KB	Output is correct
72	Correct	145 ms	69976 KB	Output is correct
73	Correct	152 ms	69972 KB	Output is correct
74	Correct	148 ms	69920 KB	Output is correct
75	Correct	139 ms	69852 KB	Output is correct
76	Correct	212 ms	69856 KB	Output is correct
77	Correct	182 ms	69976 KB	Output is correct
78	Correct	204 ms	69972 KB	Output is correct
79	Correct	192 ms	69856 KB	Output is correct
80	Correct	191 ms	69976 KB	Output is correct
81	Correct	299 ms	69992 KB	Output is correct
82	Correct	276 ms	69972 KB	Output is correct
83	Correct	285 ms	69972 KB	Output is correct
84	Correct	280 ms	69980 KB	Output is correct
85	Correct	344 ms	69984 KB	Output is correct
86	Correct	314 ms	69888 KB	Output is correct
87	Correct	287 ms	69980 KB	Output is correct
88	Correct	284 ms	69900 KB	Output is correct
89	Correct	274 ms	69976 KB	Output is correct
90	Correct	298 ms	69980 KB	Output is correct
91	Correct	357 ms	69976 KB	Output is correct
92	Correct	414 ms	69968 KB	Output is correct
93	Correct	390 ms	69976 KB	Output is correct
94	Correct	400 ms	69968 KB	Output is correct
95	Correct	367 ms	69968 KB	Output is correct
96	Correct	359 ms	69956 KB	Output is correct
97	Correct	356 ms	69976 KB	Output is correct
98	Correct	378 ms	69980 KB	Output is correct
99	Correct	356 ms	69968 KB	Output is correct
100	Correct	406 ms	69976 KB	Output is correct
101	Correct	368 ms	69984 KB	Output is correct
102	Correct	359 ms	69908 KB	Output is correct
103	Correct	336 ms	69952 KB	Output is correct
104	Correct	361 ms	69912 KB	Output is correct
105	Correct	350 ms	69956 KB	Output is correct
106	Correct	334 ms	69980 KB	Output is correct
107	Correct	340 ms	69976 KB	Output is correct
108	Correct	332 ms	69912 KB	Output is correct
109	Correct	354 ms	70092 KB	Output is correct
110	Correct	337 ms	69960 KB	Output is correct
111	Correct	336 ms	69976 KB	Output is correct
112	Correct	333 ms	69956 KB	Output is correct
113	Correct	350 ms	70012 KB	Output is correct
114	Correct	338 ms	69900 KB	Output is correct
115	Correct	326 ms	69980 KB	Output is correct
116	Correct	2694 ms	70952 KB	Output is correct
117	Correct	2898 ms	70952 KB	Output is correct
118	Correct	6937 ms	71080 KB	Output is correct
119	Execution timed out	7052 ms	70672 KB	Time limit exceeded
120	Halted	0 ms	0 KB	-

답안 #491595

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 10.0 / 10.0

Subtask #3 8.0 / 8.0

Subtask #4 16.0 / 16.0

Subtask #5 26.0 / 26.0

Subtask #6 0 / 36.0

Subtask #1
4.0 / 4.0

Subtask #2
10.0 / 10.0

Subtask #3
8.0 / 8.0

Subtask #4
16.0 / 16.0

Subtask #5
26.0 / 26.0

Subtask #6
0 / 36.0