답안 #442813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442813	2021-07-09T07:46:30 Z	zaneyu	Monochrome Points (JOI20_monochrome)	C++14	100 / 100	56 ms	3044 KB

monochrome

/*input
16
WWWBWBBBBWWBWWBWWBBWWBBBWBBBWWBW
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+9;
const ld PI=acos(-1);
const ld eps=1e-3;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=2e5+5;
const int maxlg=__lg(maxn)+2;
int n;
vector<int> v1,v2;
ll cnt(int a){
    ll cur=0;
    REP(i,n){
        int x=v1[i],y=v2[(i+a)%n];
        cur+=min(abs(x-y),2*n-abs(x-y))-1;
    }
    return cur/2;
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n;
    REP(i,2*n){
        char c;
        cin>>c;
        if(c=='B') v1.pb(i);
        else v2.pb(i);
    }
    ll a=cnt(0),b=cnt(n-1);
    ll ans=max(a,b);
    int l=1,r=n-2;
    if(a<b){    
        while(l<r){
            int mid=(l+r)/2;
            ll x=cnt(mid);
            if(x<=a){
                l=mid+1;
                continue;
            }
            ll y=cnt(mid+1);
            if(x<y) l=mid+1;
            else r=mid;
        }
        MXTO(ans,cnt(l));
    }
    else{
        while(l<r){
            int mid=(l+r)/2;
            ll x=cnt(mid);
            if(x<=b){
                r=mid-1;
                continue;
            }
            ll y=cnt(mid+1);
            if(x<y) l=mid+1;
            else r=mid;
        }
        MXTO(ans,cnt(l));
    }
    cout<<ans;
}

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	312 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
65.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	312 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	312 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	320 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	312 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	1 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	1 ms	332 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	1 ms	332 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	312 KB	Output is correct
52	Correct	1 ms	312 KB	Output is correct
53	Correct	56 ms	2476 KB	Output is correct
54	Correct	53 ms	2368 KB	Output is correct
55	Correct	49 ms	2368 KB	Output is correct
56	Correct	51 ms	2384 KB	Output is correct
57	Correct	47 ms	2464 KB	Output is correct
58	Correct	52 ms	2504 KB	Output is correct
59	Correct	47 ms	2368 KB	Output is correct
60	Correct	49 ms	2372 KB	Output is correct
61	Correct	47 ms	2336 KB	Output is correct
62	Correct	51 ms	2492 KB	Output is correct
63	Correct	50 ms	2368 KB	Output is correct
64	Correct	47 ms	2888 KB	Output is correct
65	Correct	46 ms	2368 KB	Output is correct
66	Correct	44 ms	2900 KB	Output is correct
67	Correct	43 ms	2900 KB	Output is correct
68	Correct	45 ms	2900 KB	Output is correct
69	Correct	49 ms	2624 KB	Output is correct
70	Correct	46 ms	2256 KB	Output is correct
71	Correct	30 ms	3008 KB	Output is correct
72	Correct	30 ms	3044 KB	Output is correct
73	Correct	48 ms	2480 KB	Output is correct

답안 #442813

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