답안 #516359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
516359	2022-01-21T08:16:57 Z	qwerasdfzxcl	Monochrome Points (JOI20_monochrome)	C++14	100 / 100	1342 ms	8636 KB

monochrome

#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
const ll INF = 1e18;
struct Seg{
    int tree[800800], sz;
    void init(int n){
        sz = n;
        fill(tree, tree+sz*2, 0);
    }
    void update(int p, int x){
        for (tree[p+=sz]+=x;p>1;p>>=1) tree[p>>1] = tree[p] + tree[p^1];
    }
    int query(int l, int r){
        int ret = 0;
        for (l+=sz, r+=sz;l<r;l>>=1, r>>=1){
            if (l&1) ret += tree[l++];
            if (r&1) ret += tree[--r];
        }
        return ret;
    }
}tree;
char a[400400];
int B[200200], W[200200], arr[400400];
vector<pair<int, int>> E;

ll calc(int n){
    for (auto &p:E){
        if (p.first > p.second) swap(p.first, p.second);
        arr[p.first] = -1;
        arr[p.second] = p.first;
    }
    tree.init(n+1);

    ll ret = 0;
    for (int i=1;i<=n;i++){
        if (arr[i]==-1) tree.update(i, 1);
        else{
            tree.update(arr[i], -1);
            ret += tree.query(arr[i]+1, i);
        }
    }
    return ret;
}

ll calc2(int n, int z){
    E.clear();
    int pt = z;
    for (int i=1;i<=n/2;i++){
        E.emplace_back(B[i], W[pt]);
        pt++;
        if (pt>n/2) pt -= n/2;
    }

    return calc(n);
}

int main(){
    int n;
    scanf("%d", &n);
    scanf("%s", a+1);
    n *= 2;

    int cb = 0, cw = 0;
    for (int i=1;i<=n;i++){
        if (a[i]=='B') B[++cb] = i;
        else W[++cw] = i;
    }

    ll ans = 0;

    if (n<=4000){
        for (int z=1;z<=n/2;z++){
            ans = max(ans, calc2(n, z));
        }
    }

    else{
        int l = 1, r = n/2;
        while(r-l>=4){
            int m1 = (l*2+r)/3, m2 = (l+r*2)/3;
            if (calc2(n, m1)<calc2(n, m2)) l = m1+1;
            else r = m2-1;
        }

        for (int z=l;z<=r;z++) ans = max(ans, calc2(n, z));
    }

    printf("%lld\n", ans);
    return 0;
}

Compilation message

monochrome.cpp: In function 'int main()':
monochrome.cpp:61:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
monochrome.cpp:62:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |     scanf("%s", a+1);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

#	결과	메모리	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	204 KB	Output is correct
6	Correct	204 KB	Output is correct
7	Correct	204 KB	Output is correct
8	Correct	204 KB	Output is correct
9	Correct	204 KB	Output is correct
10	Correct	204 KB	Output is correct
11	Correct	204 KB	Output is correct
12	Correct	204 KB	Output is correct
13	Correct	204 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	8 ms	332 KB	Output is correct
15	Correct	8 ms	336 KB	Output is correct
16	Correct	7 ms	332 KB	Output is correct
17	Correct	8 ms	332 KB	Output is correct
18	Correct	5 ms	332 KB	Output is correct
19	Correct	5 ms	332 KB	Output is correct
20	Correct	6 ms	332 KB	Output is correct
21	Correct	5 ms	332 KB	Output is correct
22	Correct	6 ms	332 KB	Output is correct
23	Correct	3 ms	204 KB	Output is correct
24	Correct	5 ms	332 KB	Output is correct
25	Correct	4 ms	332 KB	Output is correct
26	Correct	5 ms	332 KB	Output is correct
27	Correct	6 ms	332 KB	Output is correct
28	Correct	6 ms	332 KB	Output is correct
29	Correct	5 ms	336 KB	Output is correct
30	Correct	5 ms	332 KB	Output is correct
31	Correct	6 ms	332 KB	Output is correct
32	Correct	6 ms	336 KB	Output is correct
33	Correct	6 ms	332 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	8 ms	332 KB	Output is correct
15	Correct	8 ms	336 KB	Output is correct
16	Correct	7 ms	332 KB	Output is correct
17	Correct	8 ms	332 KB	Output is correct
18	Correct	5 ms	332 KB	Output is correct
19	Correct	5 ms	332 KB	Output is correct
20	Correct	6 ms	332 KB	Output is correct
21	Correct	5 ms	332 KB	Output is correct
22	Correct	6 ms	332 KB	Output is correct
23	Correct	3 ms	204 KB	Output is correct
24	Correct	5 ms	332 KB	Output is correct
25	Correct	4 ms	332 KB	Output is correct
26	Correct	5 ms	332 KB	Output is correct
27	Correct	6 ms	332 KB	Output is correct
28	Correct	6 ms	332 KB	Output is correct
29	Correct	5 ms	336 KB	Output is correct
30	Correct	5 ms	332 KB	Output is correct
31	Correct	6 ms	332 KB	Output is correct
32	Correct	6 ms	336 KB	Output is correct
33	Correct	6 ms	332 KB	Output is correct
34	Correct	385 ms	392 KB	Output is correct
35	Correct	375 ms	400 KB	Output is correct
36	Correct	362 ms	392 KB	Output is correct
37	Correct	336 ms	332 KB	Output is correct
38	Correct	228 ms	388 KB	Output is correct
39	Correct	276 ms	396 KB	Output is correct
40	Correct	254 ms	396 KB	Output is correct
41	Correct	260 ms	392 KB	Output is correct
42	Correct	356 ms	400 KB	Output is correct
43	Correct	290 ms	396 KB	Output is correct
44	Correct	284 ms	392 KB	Output is correct
45	Correct	281 ms	332 KB	Output is correct
46	Correct	297 ms	396 KB	Output is correct
47	Correct	312 ms	412 KB	Output is correct
48	Correct	276 ms	332 KB	Output is correct
49	Correct	243 ms	384 KB	Output is correct
50	Correct	268 ms	396 KB	Output is correct
51	Correct	270 ms	332 KB	Output is correct
52	Correct	275 ms	396 KB	Output is correct

Subtask #4
65.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	8 ms	332 KB	Output is correct
15	Correct	8 ms	336 KB	Output is correct
16	Correct	7 ms	332 KB	Output is correct
17	Correct	8 ms	332 KB	Output is correct
18	Correct	5 ms	332 KB	Output is correct
19	Correct	5 ms	332 KB	Output is correct
20	Correct	6 ms	332 KB	Output is correct
21	Correct	5 ms	332 KB	Output is correct
22	Correct	6 ms	332 KB	Output is correct
23	Correct	3 ms	204 KB	Output is correct
24	Correct	5 ms	332 KB	Output is correct
25	Correct	4 ms	332 KB	Output is correct
26	Correct	5 ms	332 KB	Output is correct
27	Correct	6 ms	332 KB	Output is correct
28	Correct	6 ms	332 KB	Output is correct
29	Correct	5 ms	336 KB	Output is correct
30	Correct	5 ms	332 KB	Output is correct
31	Correct	6 ms	332 KB	Output is correct
32	Correct	6 ms	336 KB	Output is correct
33	Correct	6 ms	332 KB	Output is correct
34	Correct	385 ms	392 KB	Output is correct
35	Correct	375 ms	400 KB	Output is correct
36	Correct	362 ms	392 KB	Output is correct
37	Correct	336 ms	332 KB	Output is correct
38	Correct	228 ms	388 KB	Output is correct
39	Correct	276 ms	396 KB	Output is correct
40	Correct	254 ms	396 KB	Output is correct
41	Correct	260 ms	392 KB	Output is correct
42	Correct	356 ms	400 KB	Output is correct
43	Correct	290 ms	396 KB	Output is correct
44	Correct	284 ms	392 KB	Output is correct
45	Correct	281 ms	332 KB	Output is correct
46	Correct	297 ms	396 KB	Output is correct
47	Correct	312 ms	412 KB	Output is correct
48	Correct	276 ms	332 KB	Output is correct
49	Correct	243 ms	384 KB	Output is correct
50	Correct	268 ms	396 KB	Output is correct
51	Correct	270 ms	332 KB	Output is correct
52	Correct	275 ms	396 KB	Output is correct
53	Correct	1342 ms	8636 KB	Output is correct
54	Correct	1334 ms	8636 KB	Output is correct
55	Correct	1274 ms	8252 KB	Output is correct
56	Correct	1286 ms	8320 KB	Output is correct
57	Correct	983 ms	8380 KB	Output is correct
58	Correct	995 ms	8636 KB	Output is correct
59	Correct	1008 ms	8252 KB	Output is correct
60	Correct	1026 ms	8252 KB	Output is correct
61	Correct	1102 ms	8380 KB	Output is correct
62	Correct	1150 ms	8380 KB	Output is correct
63	Correct	1235 ms	8252 KB	Output is correct
64	Correct	1027 ms	8252 KB	Output is correct
65	Correct	1099 ms	7868 KB	Output is correct
66	Correct	1098 ms	8124 KB	Output is correct
67	Correct	1113 ms	8252 KB	Output is correct
68	Correct	1053 ms	7868 KB	Output is correct
69	Correct	1008 ms	8508 KB	Output is correct
70	Correct	916 ms	7880 KB	Output is correct
71	Correct	989 ms	8636 KB	Output is correct
72	Correct	991 ms	8636 KB	Output is correct
73	Correct	1050 ms	8636 KB	Output is correct

답안 #516359

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 21.0 / 21.0

Subtask #3 10.0 / 10.0

Subtask #4 65.0 / 65.0

Subtask #1
4.0 / 4.0

Subtask #2
21.0 / 21.0

Subtask #3
10.0 / 10.0

Subtask #4
65.0 / 65.0