oj.uz

답안 #1094150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094150 2024-09-28T18:13:17 Z thangdz2k7 Monochrome Points (JOI20_monochrome) C++17
100 / 100
 14 ms 4624 KB 
// author : thembululquaUwU
// 3.9.2024

#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define endl '\n'

using namespace std;
using ll = long long;
using ii = pair <int, int>;
using vi = vector <int>;

const int N = 4e5 + 5;
const int mod = 1e9 + 7;

void maxl(auto &a, auto b) {a = max(a, b);}
void minl(auto &a, auto b) {a = min(a, b);}

int n;
string s;

void solve(){
    cin >> n;
    cin >> s;
    vi black, white;
    for (int i = 0; i < 2 * n; ++ i) if (s[i] == 'B') black.pb(i); else white.pb(i);
    vector <ll> pref(n);
    auto update = [&](int l, int r, int x){
        if (l >= r) return;
        if (l < 0) l += n, r += n;
        if (r > n) r -= n;
        pref[l] += x;
        if (r < n) pref[r] -= x;
        if (l >= r) pref[0] += x;
    };

    int j = 0, k = 0, l = 0;
    for (int i = 0; i < n; ++ i){
        while (j < n && white[j] - black[i] <= -n) ++ j;
        while (k < n && white[k] - black[i] <= 0) ++ k;
        while (l < n && white[l] - black[i] <= n) ++ l;
        update(-i, j - i, n + n - black[i]);
        update(j - i, k - i, black[i]);
        update(k - i, l - i, -black[i]);
        update(l - i, n - i, n + n + black[i]);
    }

    j = k = l = -1;
    for (int i = 0; i < n; ++ i){
        while (j + 1 < n && white[i] - black[j + 1] > n) ++ j;
        while (k + 1 < n && white[i] - black[k + 1] > 0) ++ k;
        while (l + 1 < n && white[i] - black[l + 1] > -n) ++ l;
        update(i - n + 1, i - l, white[i]);
        update(i - l, i - k, -white[i]);
        update(i - k, i - j, white[i]);
        update(i - j, i + 1, -white[i]);
    }

    #define all(x) (x).begin(), (x).end()
    #define rall(x) (x).rbegin(), (x).rend()
    #define fd(sr, x) (lower_bound(sr.begin(), sr.end(), x) - sr.begin())
    #define uq(sr) (sr).erase(unique(all((sr))), (sr).end())
    #define szv(v) (int((v).size()))

    partial_sum(all(pref), pref.begin());
    cout << (*max_element(all(pref)) - n) / 2;
}

int main(){
    if (fopen("pqh.inp", "r")){
        freopen("pqh.inp", "r", stdin);
        freopen("pqh.out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

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

Compilation message

monochrome.cpp:18:11: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | void maxl(auto &a, auto b) {a = max(a, b);}
      |           ^~~~
monochrome.cpp:18:20: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   18 | void maxl(auto &a, auto b) {a = max(a, b);}
      |                    ^~~~
monochrome.cpp:19:11: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | void minl(auto &a, auto b) {a = min(a, b);}
      |           ^~~~
monochrome.cpp:19:20: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | void minl(auto &a, auto b) {a = min(a, b);}
      |                    ^~~~
monochrome.cpp: In function 'int main()':
monochrome.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen("pqh.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
monochrome.cpp:74:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         freopen("pqh.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 352 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 0 ms 456 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 0 ms 356 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 356 KB Output is correct
34 Correct 1 ms 356 KB Output is correct
35 Correct 1 ms 356 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 356 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 352 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 1 ms 352 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 468 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 352 KB Output is correct
52 Correct 1 ms 600 KB Output is correct
53 Correct 14 ms 4580 KB Output is correct
54 Correct 14 ms 4520 KB Output is correct
55 Correct 14 ms 4596 KB Output is correct
56 Correct 13 ms 4580 KB Output is correct
57 Correct 7 ms 4320 KB Output is correct
58 Correct 7 ms 4460 KB Output is correct
59 Correct 7 ms 4280 KB Output is correct
60 Correct 7 ms 4580 KB Output is correct
61 Correct 8 ms 4572 KB Output is correct
62 Correct 8 ms 4624 KB Output is correct
63 Correct 8 ms 4448 KB Output is correct
64 Correct 6 ms 4376 KB Output is correct
65 Correct 8 ms 4320 KB Output is correct
66 Correct 9 ms 4204 KB Output is correct
67 Correct 8 ms 4188 KB Output is correct
68 Correct 8 ms 3932 KB Output is correct
69 Correct 7 ms 4560 KB Output is correct
70 Correct 6 ms 3944 KB Output is correct
71 Correct 7 ms 4396 KB Output is correct
72 Correct 8 ms 4460 KB Output is correct
73 Correct 7 ms 4580 KB Output is correct