oj.uz

Submission #617199

# Submission time Handle Problem Language Result Execution time Memory
617199 2022-08-01T09:33:14 Z AmirElarbi Monochrome Points (JOI20_monochrome) C++14
35 / 100
 2000 ms 18556 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 2e9+5
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9;
const int nax = 2e5+5;
const int lg = 20;
ll st[nax*8];
int n;
void update(int v, int l, int r, int pos, int val){
    if(pos > r || pos < l) return;
    if(l == r){
        st[v] += val;
        return;
    }
    int md = (l+r)/2;
    update(v*2, l, md, pos, val);
    update(v*2+1, md+1, r, pos, val);
    st[v] = st[v*2]+st[v*2+1];
}
int query(int v, int l, int r, int i, int j){
    if(i > r || j < l) return 0;
    if(i <= l && r <= j) return st[v];
    int md = (l+r)/2;
    return query(v*2, l, md, i, j)+ query(v*2+1, md+1, r, i, j);
}
vi blck, wht;
ll test(int md){
    int res = 0;
    memset(st, 0, sizeof st);
    vii qr;
    for (int j = 0; j < n; ++j)
    {
        int ind = (j+md)%n;
        int a = blck[j], b = wht[ind];
        if(a > b) swap(a,b);
        qr.pb({a,b});
    }
    sort(qr.begin(), qr.end());
    reverse(qr.begin(), qr.end());
    for(auto x : qr){
        res += query(1,0,2*n-1, x.fi, x.se);
        update(1,0,2*n-1, x.fi, 1);
        update(1,0,2*n-1, x.se, -1);
    }
    return res;
}
int main() {
    optimise;
    cin >> n;
    string s;
    cin >> s;
    for (int i = 0; i < n*2; ++i)
    {
        if(s[i] == 'B') blck.pb(i);
        if(s[i] == 'W') wht.pb(i);
    }
    ll mx = 0;
    int l = 0, r = n-1;
    while (l < r)
    {
        int md = (l+r)/2;
        ll a = test(md+1), b = test(md);
        if(a > b){
            mx = max(mx, a);
            l = md+1;
        } else {
            mx = max(mx, b);
            r = md;
        }
    }
    cout << mx << endl;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 12756 KB Output is correct
3 Correct 10 ms 12844 KB Output is correct
4 Correct 9 ms 12836 KB Output is correct
5 Correct 10 ms 12732 KB Output is correct
6 Correct 9 ms 12756 KB Output is correct
7 Correct 12 ms 12756 KB Output is correct
8 Correct 12 ms 12756 KB Output is correct
9 Correct 12 ms 12840 KB Output is correct
10 Correct 13 ms 12756 KB Output is correct
11 Correct 15 ms 12840 KB Output is correct
12 Correct 12 ms 12848 KB Output is correct
13 Correct 13 ms 12884 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 12756 KB Output is correct
3 Correct 10 ms 12844 KB Output is correct
4 Correct 9 ms 12836 KB Output is correct
5 Correct 10 ms 12732 KB Output is correct
6 Correct 9 ms 12756 KB Output is correct
7 Correct 12 ms 12756 KB Output is correct
8 Correct 12 ms 12756 KB Output is correct
9 Correct 12 ms 12840 KB Output is correct
10 Correct 13 ms 12756 KB Output is correct
11 Correct 15 ms 12840 KB Output is correct
12 Correct 12 ms 12848 KB Output is correct
13 Correct 13 ms 12884 KB Output is correct
14 Correct 26 ms 12860 KB Output is correct
15 Correct 29 ms 12756 KB Output is correct
16 Correct 27 ms 12844 KB Output is correct
17 Correct 27 ms 12756 KB Output is correct
18 Correct 27 ms 12756 KB Output is correct
19 Correct 28 ms 12860 KB Output is correct
20 Correct 26 ms 12756 KB Output is correct
21 Correct 30 ms 12860 KB Output is correct
22 Correct 30 ms 12756 KB Output is correct
23 Correct 31 ms 12852 KB Output is correct
24 Correct 29 ms 12756 KB Output is correct
25 Correct 26 ms 12860 KB Output is correct
26 Correct 27 ms 12852 KB Output is correct
27 Correct 28 ms 12852 KB Output is correct
28 Correct 29 ms 12856 KB Output is correct
29 Correct 33 ms 12832 KB Output is correct
30 Correct 28 ms 12756 KB Output is correct
31 Correct 31 ms 12756 KB Output is correct
32 Correct 33 ms 12836 KB Output is correct
33 Correct 29 ms 12856 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 12756 KB Output is correct
3 Correct 10 ms 12844 KB Output is correct
4 Correct 9 ms 12836 KB Output is correct
5 Correct 10 ms 12732 KB Output is correct
6 Correct 9 ms 12756 KB Output is correct
7 Correct 12 ms 12756 KB Output is correct
8 Correct 12 ms 12756 KB Output is correct
9 Correct 12 ms 12840 KB Output is correct
10 Correct 13 ms 12756 KB Output is correct
11 Correct 15 ms 12840 KB Output is correct
12 Correct 12 ms 12848 KB Output is correct
13 Correct 13 ms 12884 KB Output is correct
14 Correct 26 ms 12860 KB Output is correct
15 Correct 29 ms 12756 KB Output is correct
16 Correct 27 ms 12844 KB Output is correct
17 Correct 27 ms 12756 KB Output is correct
18 Correct 27 ms 12756 KB Output is correct
19 Correct 28 ms 12860 KB Output is correct
20 Correct 26 ms 12756 KB Output is correct
21 Correct 30 ms 12860 KB Output is correct
22 Correct 30 ms 12756 KB Output is correct
23 Correct 31 ms 12852 KB Output is correct
24 Correct 29 ms 12756 KB Output is correct
25 Correct 26 ms 12860 KB Output is correct
26 Correct 27 ms 12852 KB Output is correct
27 Correct 28 ms 12852 KB Output is correct
28 Correct 29 ms 12856 KB Output is correct
29 Correct 33 ms 12832 KB Output is correct
30 Correct 28 ms 12756 KB Output is correct
31 Correct 31 ms 12756 KB Output is correct
32 Correct 33 ms 12836 KB Output is correct
33 Correct 29 ms 12856 KB Output is correct
34 Correct 59 ms 12884 KB Output is correct
35 Correct 60 ms 12884 KB Output is correct
36 Correct 52 ms 12884 KB Output is correct
37 Correct 53 ms 12884 KB Output is correct
38 Correct 52 ms 12884 KB Output is correct
39 Correct 58 ms 12884 KB Output is correct
40 Correct 51 ms 12864 KB Output is correct
41 Correct 50 ms 12888 KB Output is correct
42 Correct 52 ms 12884 KB Output is correct
43 Correct 51 ms 12884 KB Output is correct
44 Correct 51 ms 12884 KB Output is correct
45 Correct 49 ms 12884 KB Output is correct
46 Correct 52 ms 12884 KB Output is correct
47 Correct 53 ms 12884 KB Output is correct
48 Correct 50 ms 12884 KB Output is correct
49 Correct 44 ms 12880 KB Output is correct
50 Correct 50 ms 12884 KB Output is correct
51 Correct 52 ms 12884 KB Output is correct
52 Correct 57 ms 12884 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 12756 KB Output is correct
3 Correct 10 ms 12844 KB Output is correct
4 Correct 9 ms 12836 KB Output is correct
5 Correct 10 ms 12732 KB Output is correct
6 Correct 9 ms 12756 KB Output is correct
7 Correct 12 ms 12756 KB Output is correct
8 Correct 12 ms 12756 KB Output is correct
9 Correct 12 ms 12840 KB Output is correct
10 Correct 13 ms 12756 KB Output is correct
11 Correct 15 ms 12840 KB Output is correct
12 Correct 12 ms 12848 KB Output is correct
13 Correct 13 ms 12884 KB Output is correct
14 Correct 26 ms 12860 KB Output is correct
15 Correct 29 ms 12756 KB Output is correct
16 Correct 27 ms 12844 KB Output is correct
17 Correct 27 ms 12756 KB Output is correct
18 Correct 27 ms 12756 KB Output is correct
19 Correct 28 ms 12860 KB Output is correct
20 Correct 26 ms 12756 KB Output is correct
21 Correct 30 ms 12860 KB Output is correct
22 Correct 30 ms 12756 KB Output is correct
23 Correct 31 ms 12852 KB Output is correct
24 Correct 29 ms 12756 KB Output is correct
25 Correct 26 ms 12860 KB Output is correct
26 Correct 27 ms 12852 KB Output is correct
27 Correct 28 ms 12852 KB Output is correct
28 Correct 29 ms 12856 KB Output is correct
29 Correct 33 ms 12832 KB Output is correct
30 Correct 28 ms 12756 KB Output is correct
31 Correct 31 ms 12756 KB Output is correct
32 Correct 33 ms 12836 KB Output is correct
33 Correct 29 ms 12856 KB Output is correct
34 Correct 59 ms 12884 KB Output is correct
35 Correct 60 ms 12884 KB Output is correct
36 Correct 52 ms 12884 KB Output is correct
37 Correct 53 ms 12884 KB Output is correct
38 Correct 52 ms 12884 KB Output is correct
39 Correct 58 ms 12884 KB Output is correct
40 Correct 51 ms 12864 KB Output is correct
41 Correct 50 ms 12888 KB Output is correct
42 Correct 52 ms 12884 KB Output is correct
43 Correct 51 ms 12884 KB Output is correct
44 Correct 51 ms 12884 KB Output is correct
45 Correct 49 ms 12884 KB Output is correct
46 Correct 52 ms 12884 KB Output is correct
47 Correct 53 ms 12884 KB Output is correct
48 Correct 50 ms 12884 KB Output is correct
49 Correct 44 ms 12880 KB Output is correct
50 Correct 50 ms 12884 KB Output is correct
51 Correct 52 ms 12884 KB Output is correct
52 Correct 57 ms 12884 KB Output is correct
53 Execution timed out 2071 ms 18556 KB Time limit exceeded
54 Halted 0 ms 0 KB -