oj.uz

답안 #906813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
906813 2024-01-15T03:22:55 Z bachhoangxuan Monochrome Points (JOI20_monochrome) C++17
100 / 100
 1124 ms 15664 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int bit[2*maxn];

void solve(){
    int n;cin >> n;
    vector<int> b,w;
    for(int i=0;i<2*n;i++){
        char c;cin >> c;
        if(c=='B') b.push_back(i);
        else w.push_back(i);
    }
    auto query = [&](int x){
        if(x<=0) return 0LL;
        int res=0;
        for(int i=x;i>=1;i-=(i&(-i))) res+=bit[i];
        return res;
    };
    auto update = [&](int x){
        for(int i=x;i<=2*n;i+=(i&(-i))) bit[i]++;
    };
    auto cal = [&](int k){
        for(int i=1;i<=2*n;i++) bit[i]=0;
        vector<pii> p;
        for(int i=0;i<n;i++){
            int l=b[i],r=w[(i+k)%n];
            if(l>r) swap(l,r);
            p.push_back({l,r});
        }
        sort(p.begin(),p.end());
        int ans=0;
        for(auto &[l,r]:p){
            ans+=query(r)-query(l-1);
            update(r);
        }
        return ans;
    };
    int l=0,r=n-2,res=0;
    while(l<=r){
        int mid=(l+r)>>1;
        int f1=cal(mid),f2=cal(mid+1);
        res=max({res,f1,f2});
        if(f1<f2) l=mid+1;
        else r=mid-1;
    }
    cout << res << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 496 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 4 ms 604 KB Output is correct
35 Correct 4 ms 604 KB Output is correct
36 Correct 4 ms 600 KB Output is correct
37 Correct 3 ms 348 KB Output is correct
38 Correct 3 ms 348 KB Output is correct
39 Correct 3 ms 344 KB Output is correct
40 Correct 3 ms 348 KB Output is correct
41 Correct 3 ms 600 KB Output is correct
42 Correct 4 ms 856 KB Output is correct
43 Correct 3 ms 344 KB Output is correct
44 Correct 4 ms 344 KB Output is correct
45 Correct 3 ms 348 KB Output is correct
46 Correct 3 ms 348 KB Output is correct
47 Correct 3 ms 348 KB Output is correct
48 Correct 3 ms 488 KB Output is correct
49 Correct 3 ms 348 KB Output is correct
50 Correct 2 ms 348 KB Output is correct
51 Correct 3 ms 348 KB Output is correct
52 Correct 3 ms 348 KB Output is correct
53 Correct 1016 ms 13968 KB Output is correct
54 Correct 1036 ms 14596 KB Output is correct
55 Correct 924 ms 13904 KB Output is correct
56 Correct 861 ms 14636 KB Output is correct
57 Correct 747 ms 14240 KB Output is correct
58 Correct 798 ms 14880 KB Output is correct
59 Correct 862 ms 14124 KB Output is correct
60 Correct 738 ms 13980 KB Output is correct
61 Correct 890 ms 15208 KB Output is correct
62 Correct 835 ms 15340 KB Output is correct
63 Correct 871 ms 14028 KB Output is correct
64 Correct 802 ms 14040 KB Output is correct
65 Correct 924 ms 14764 KB Output is correct
66 Correct 654 ms 13924 KB Output is correct
67 Correct 693 ms 14600 KB Output is correct
68 Correct 852 ms 14108 KB Output is correct
69 Correct 745 ms 15184 KB Output is correct
70 Correct 841 ms 13540 KB Output is correct
71 Correct 642 ms 15664 KB Output is correct
72 Correct 1018 ms 14748 KB Output is correct
73 Correct 1124 ms 14652 KB Output is correct