oj.uz

Submission #514086

# Submission time Handle Problem Language Result Execution time Memory
514086 2022-01-18T03:22:54 Z czhang2718 Monochrome Points (JOI20_monochrome) C++17
100 / 100
 107 ms 10180 KB 
#include "bits/stdc++.h"
using namespace std;

const int N=400001;
#define all(x) x.begin(), x.end()

int n;
string s;
long long ps[N];
int ind[N];
vector<int> black, white;

void solve(int i){
  // cout << "solve " << i << '\n';
  auto add=[&](int l, int r, int v){
    // cout << l << "-" << r << " add " << v << '\n';
    if(r<l) r+=n;
    ps[l]+=v;
    ps[r+1]-=v;
  };

  if(s[i]=='B'){
    auto pain=[&](int j)->int{
      return (ind[i]-j+n)%n;
    };
    // (i, i+m) 
    int cw1=*lower_bound(all(white), i);
    int cw2=*--upper_bound(all(white), i+n);
    if(cw1-i<=n){
      int l=ind[cw1%(2*n)], r=ind[cw2%(2*n)];
      add(pain(r), pain(l), -i);
      if(i>=n && cw2>=2*n){
        int k=*white.begin();
        add(pain(r), pain(ind[k]), 2*n);
      }
    }

    // (i+m ,i+n)
    if(upper_bound(all(white), i+n)==white.end()) return;
    int cc1=*upper_bound(all(white), i+n);
    int cc2=*--lower_bound(all(white), i+2*n);
    if(cc1<i+2*n){
      int l=ind[cc1%(2*n)], r=ind[cc2%(2*n)];
      add(pain(r), pain(l), i);
      if(i<n-1 && cc1<2*n){
        int k=*--lower_bound(all(white), 2*n);
        add(pain(ind[k]), pain(l), 2*n);
      }
    }
  } 
  else{
    auto pain=[&](int j)->int{
      return (j-ind[i]+n)%n;
    };
    // (i, i+m) 
    int cw1=*lower_bound(all(black), i);
    int cw2=*--lower_bound(all(black), i+n);
    // cout << cw1 << " " << cw2 << "\n";
    if(cw1-i<n){
      int l=ind[cw1%(2*n)], r=ind[cw2%(2*n)];
      add(pain(l), pain(r), -i);
    }

    // (i+m ,i+n)
    int cc1=*lower_bound(all(black), i+n);
    int cc2=*--lower_bound(all(black), i+2*n);
    if(cc1<i+2*n){
      int l=ind[cc1%(2*n)], r=ind[cc2%(2*n)];
      add(pain(l), pain(r), i);
    }
  }
}

int main(){
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> s;
  s+=s;
  int w=0, b=0;
  for(int i=0; i<2*n; i++){
    if(s[i]=='W'){
      ind[i]=w;
      w++;
    }
    else{
      ind[i]=b;
      b++;
    }
  }
  for(int i=0; i<4*n; i++){
    if(s[i%(2*n)]=='W') white.push_back(i);
    else black.push_back(i);
  }
  for(int i=0; i<2*n; i++) solve(i);
  for(int i=1; i<2*n; i++) ps[i]+=ps[i-1];
    
  long long ans=0;
  for(int i=0; i<n; i++){
    // cout << ps[i]+ps[i+n]-n << "\n";
    ans=max(ans, ps[i]+ps[i+n]);
  }
  cout << (ans-n)/2;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 324 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 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 324 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 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 312 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 324 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 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 312 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 2 ms 312 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 2 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 2 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 320 KB Output is correct
48 Correct 1 ms 324 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 332 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 324 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 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 312 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 2 ms 312 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 2 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 2 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 320 KB Output is correct
48 Correct 1 ms 324 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 332 KB Output is correct
53 Correct 104 ms 10104 KB Output is correct
54 Correct 107 ms 10104 KB Output is correct
55 Correct 100 ms 9712 KB Output is correct
56 Correct 100 ms 9832 KB Output is correct
57 Correct 74 ms 9748 KB Output is correct
58 Correct 58 ms 9792 KB Output is correct
59 Correct 48 ms 9660 KB Output is correct
60 Correct 68 ms 9788 KB Output is correct
61 Correct 75 ms 9880 KB Output is correct
62 Correct 76 ms 9972 KB Output is correct
63 Correct 83 ms 9772 KB Output is correct
64 Correct 97 ms 9168 KB Output is correct
65 Correct 95 ms 9308 KB Output is correct
66 Correct 86 ms 8936 KB Output is correct
67 Correct 81 ms 8988 KB Output is correct
68 Correct 79 ms 8544 KB Output is correct
69 Correct 73 ms 9912 KB Output is correct
70 Correct 61 ms 8912 KB Output is correct
71 Correct 81 ms 9416 KB Output is correct
72 Correct 88 ms 9376 KB Output is correct
73 Correct 93 ms 10180 KB Output is correct