Submission #522877

#	Time	Username	Problem	Language	Result	Execution time	Memory
522877		Cross_Ratio	Monochrome Points (JOI20_monochrome)	C++14	100 / 100	1406 ms	8148 KiB

monochrome

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("avx2")
using namespace std;
struct SegTree {
    vector<long long int> seg;
    int MAX;
    void init(int N) {
        seg.resize(N+5);
        MAX = N+5;
    }
    void clear() {
        fill(seg.begin(),seg.end(),0);
    }
    long long int sum(int i) {
        long long int ans = 0;
        while(i>0) {
            //cout << i << ' ' << ans << '\n';
            ans += seg[i];
            i -= (i&-i);
        }
        return ans;
    }
    void Edit(int i, long long int a) {
        i++;
        while(i<MAX) {
            //cout << i << '\n';
            seg[i] += a;
            i += (i & -i);
        }
    }
    long long int sum(int s, int e) {
        return sum(e)-sum(s);
    }
};
SegTree tree;
vector<int> V;
long long int simulate() {
    //cout << "simul\n";
    tree.clear();
    vector<int> used;
    used.resize(V.size()/2);
    fill(used.begin(),used.end(),-1);
    long long int ans = 0;
    int i;
    for(i=0;i<V.size();i++) {
        if(used[V[i]] != -1) {
            ans += tree.sum(used[V[i]]+1, i);
            tree.Edit(used[V[i]],-1);
        }
        else {
            tree.Edit(i, 1);
            used[V[i]] = i;
        }
    }
    return ans;
}
signed main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int N;
    string s2;
    cin >> N >> s2;
    tree.init(2*N);
    int i, j, k;
    vector<int> A, B;
    for(i=0;i<2*N;i++) {
        if(s2[i]=='B') A.push_back(i);
        else B.push_back(i);
    }
    V.resize(s2.length());
    for(i=0;i<A.size();i++) V[A[i]] = i;
    long long int ans = -1;
    int s = 0, e = N - 1;
    while(e-s>=3) {
        int l = (2*s+e)/3;
        int r = (s+2*e)/3;
        for(int j = l; j < l + N; j++) {
            V[B[j%N]] = j-l;
        }
        long long int v1 = simulate();
        for(int j = r; j < r + N; j++) {
            V[B[j%N]] = j-r;
        }
        long long int v2 = simulate();
        if(v1<v2) s = l;
        else e = r;
    }
    for(i=s;i<=e;i++) {
        for(int j = i; j < i + N; j++) {
            V[B[j%N]] = j-i;
        }
        ans = max(ans, simulate());
    }
    cout << ans;
}

Compilation message (stderr)

monochrome.cpp: In function 'long long int simulate()':
monochrome.cpp:48:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(i=0;i<V.size();i++) {
      |             ~^~~~~~~~~
monochrome.cpp: In function 'int main()':
monochrome.cpp:75:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(i=0;i<A.size();i++) V[A[i]] = i;
      |             ~^~~~~~~~~
monochrome.cpp:68:12: warning: unused variable 'j' [-Wunused-variable]
   68 |     int i, j, k;
      |            ^
monochrome.cpp:68:15: warning: unused variable 'k' [-Wunused-variable]
   68 |     int i, j, k;
      |               ^

• Subtask 1: 4 / 4
• Subtask 2: 21 / 21
• Subtask 3: 10 / 10
• Subtask 4: 65 / 65