oj.uz

답안 #720961

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
720961 2023-04-09T23:40:05 Z joelgun14 Monochrome Points (JOI20_monochrome) C++17
35 / 100
 2000 ms 9180 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    vector<int> b, w;
    for(int i = 0; i < 2 * n; ++i) {
        if(s[i] == 'B')
            b.push_back(i + 1);
        else
            w.push_back(i + 1);
    }
    int prefb[4 * n + 1], prefw[4 * n + 1];
    memset(prefb, 0, sizeof(prefb));
    memset(prefw, 0, sizeof(prefw));
    //cout << "TEST" << endl;
    for(int i = 1; i <= 2 * n; ++i) {
        prefb[i] = prefb[i - 1];
        prefw[i] = prefw[i - 1];
        if(binary_search(b.begin(), b.end(), i))
            prefb[i]++;
        else
            prefw[i]++;
    }
    //cout << "PREF BUILD DONE" << endl;
    //cout << b.size() << " " << w.size() << endl;
    long long ans = 0;
    for(int i = 0; i < n; ++i) {
        // match b[i] dan w[i]
        long long res = 0;
        for(int j = 0; j < n; ++j) {
            int l = b[j], r = w[(i + j) % n];
            //cout << l << " " << r << endl;
            // cari antara l dan r
            // kalo misal r < l, maka + 2 * n
            if(r < l)
                swap(l, r);
            // pref[2 * n] - pref[r] + pref[l] buat seg 1
            // pref[r] - pref[l] buat seg 2
            int b1 = prefb[2 * n] - prefb[r] + prefb[l - 1], w1 = prefw[2 * n] - prefw[r] + prefw[l - 1];
            int b2 = prefb[r - 1] - prefb[l], w2 = prefw[r - 1] - prefw[l];
            //cout << b1 << " " << b2 << " " << w1 << " " << w2 << endl;
            res += min(b1, w2) + min(b2, w1);
        }
        //cout << res << " " << endl;
        ans = max(ans, res);
    }
    //cout << endl;
    cout << ans / 2 << endl;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
0.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 23 ms 460 KB Output is correct
35 Correct 22 ms 384 KB Output is correct
36 Correct 19 ms 340 KB Output is correct
37 Correct 19 ms 340 KB Output is correct
38 Correct 17 ms 384 KB Output is correct
39 Correct 19 ms 340 KB Output is correct
40 Correct 17 ms 340 KB Output is correct
41 Correct 16 ms 384 KB Output is correct
42 Correct 20 ms 340 KB Output is correct
43 Correct 21 ms 388 KB Output is correct
44 Correct 17 ms 340 KB Output is correct
45 Correct 18 ms 380 KB Output is correct
46 Correct 20 ms 340 KB Output is correct
47 Correct 20 ms 340 KB Output is correct
48 Correct 21 ms 400 KB Output is correct
49 Correct 17 ms 384 KB Output is correct
50 Correct 20 ms 340 KB Output is correct
51 Correct 21 ms 340 KB Output is correct
52 Correct 21 ms 392 KB Output is correct
53 Execution timed out 2055 ms 9180 KB Time limit exceeded
54 Halted 0 ms 0 KB -