oj.uz

Submission #1095901

# Submission time Handle Problem Language Result Execution time Memory
1095901 2024-10-03T11:37:13 Z _8_8_ Monochrome Points (JOI20_monochrome) C++17
35 / 100
 2000 ms 13988 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 3e5 + 12, MOD = (int)1e9 + 7;

int n, t[N * 2];
string s;
vector<int> x, y;

void add(int i, int val) {
    while(i <= n + n) {
        t[i] += val;
        i += i & -i;
    }
}
ll get(int i) {
    ll ret = 0;
    while(i) {
        ret += t[i];
        i -= i & -i;
    }
    return ret;
}
ll get(int l, int r) {
    return get(r) - get(l - 1);
}
ll mem[N];
ll calc(int k) {
    if(mem[k] != -1) {
        return mem[k];
    }
    for(int i = 1; i <= n + n; i++) {
        t[i] = 0;
    }
    ll ret = 0;
    vector<pair<int,int>> a;
    for(int i = 0; i < n; i++) {
        int j = (i + k) % n;
        int l = x[i], r = y[j];
        if(l > r) {
            swap(l, r);
        }
        a.emplace_back(l, -1);
        a.emplace_back(r, l);
    }
    sort(a.begin(), a.end());
    for(auto [x, y]:a) {
        if(y == -1) {
            add(x, 1); 
        } else {
            ret += get(y + 1, x);
            add(y, -1);
        }
    }
    return mem[k] = ret;
}
void test() {
    memset(mem, -1, sizeof(mem));
    cin >> n >> s;
    for(int i = 0; i < n + n; i++) {
        if(s[i] == 'W') {
            x.push_back(i + 1);
        } else {
            y.push_back(i + 1);
        }
    }
    if(n == 1) {
        cout << 0 << '\n';
        return;
    }
    if(calc(0) < calc(1)) {
        int l = 1, r = n;
        while(r - l > 1) {
            int mid = (l + r) >> 1;
            if(calc(mid) > calc(mid - 1)) {
                l = mid;
            } else {
                r = mid;
            }
        }
        cout << calc(l) << '\n';
    } else {
        ll res =0 ;
        for(int i = 0; i < n; i++) {
            res =max(res, calc(i));
        }
        cout <<res << '\n';
        // int l = 0, r = n - 1;
        // while(r - l > 1) {
        //     int mid = (l + r) >> 1;
        //     if(calc(mid) > calc(mid + 1)) {
        //         r = mid;
        //     } else {
        //         l = mid;
        //     }
        // }
        // cout << calc(r) << '\n';

    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 

    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2904 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2808 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2904 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2808 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 6 ms 2652 KB Output is correct
20 Correct 6 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2648 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 6 ms 2652 KB Output is correct
25 Correct 5 ms 2652 KB Output is correct
26 Correct 2 ms 2836 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 7 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 6 ms 2840 KB Output is correct
31 Correct 6 ms 2648 KB Output is correct
32 Correct 7 ms 2836 KB Output is correct
33 Correct 7 ms 2840 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2904 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2808 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 6 ms 2652 KB Output is correct
20 Correct 6 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2648 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 6 ms 2652 KB Output is correct
25 Correct 5 ms 2652 KB Output is correct
26 Correct 2 ms 2836 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 7 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 6 ms 2840 KB Output is correct
31 Correct 6 ms 2648 KB Output is correct
32 Correct 7 ms 2836 KB Output is correct
33 Correct 7 ms 2840 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct
35 Correct 6 ms 2920 KB Output is correct
36 Correct 326 ms 2892 KB Output is correct
37 Correct 5 ms 2904 KB Output is correct
38 Correct 275 ms 2908 KB Output is correct
39 Correct 289 ms 2908 KB Output is correct
40 Correct 228 ms 2908 KB Output is correct
41 Correct 235 ms 2904 KB Output is correct
42 Correct 357 ms 2908 KB Output is correct
43 Correct 5 ms 2908 KB Output is correct
44 Correct 5 ms 2904 KB Output is correct
45 Correct 318 ms 3156 KB Output is correct
46 Correct 324 ms 2908 KB Output is correct
47 Correct 5 ms 2904 KB Output is correct
48 Correct 5 ms 2908 KB Output is correct
49 Correct 5 ms 2908 KB Output is correct
50 Correct 260 ms 2908 KB Output is correct
51 Correct 275 ms 2908 KB Output is correct
52 Correct 5 ms 2904 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2904 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2808 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 6 ms 2652 KB Output is correct
20 Correct 6 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2648 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 6 ms 2652 KB Output is correct
25 Correct 5 ms 2652 KB Output is correct
26 Correct 2 ms 2836 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 7 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 6 ms 2840 KB Output is correct
31 Correct 6 ms 2648 KB Output is correct
32 Correct 7 ms 2836 KB Output is correct
33 Correct 7 ms 2840 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct
35 Correct 6 ms 2920 KB Output is correct
36 Correct 326 ms 2892 KB Output is correct
37 Correct 5 ms 2904 KB Output is correct
38 Correct 275 ms 2908 KB Output is correct
39 Correct 289 ms 2908 KB Output is correct
40 Correct 228 ms 2908 KB Output is correct
41 Correct 235 ms 2904 KB Output is correct
42 Correct 357 ms 2908 KB Output is correct
43 Correct 5 ms 2908 KB Output is correct
44 Correct 5 ms 2904 KB Output is correct
45 Correct 318 ms 3156 KB Output is correct
46 Correct 324 ms 2908 KB Output is correct
47 Correct 5 ms 2904 KB Output is correct
48 Correct 5 ms 2908 KB Output is correct
49 Correct 5 ms 2908 KB Output is correct
50 Correct 260 ms 2908 KB Output is correct
51 Correct 275 ms 2908 KB Output is correct
52 Correct 5 ms 2904 KB Output is correct
53 Execution timed out 2053 ms 13988 KB Time limit exceeded
54 Halted 0 ms 0 KB -