oj.uz

답안 #617178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
617178 2022-08-01T09:21:16 Z AmirElarbi Monochrome Points (JOI20_monochrome) C++14
25 / 100
 2000 ms 6612 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 = 4e5+5;
const int lg = 20;
int st[nax*4];
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);
}
int main() {
    optimise;
    int n;
    cin >> n;
    string s;
    cin >> s;
    vi blck, wht;
    for (int i = 0; i < n*2; ++i)
    {
        if(s[i] == 'B') blck.pb(i);
        if(s[i] == 'W') wht.pb(i);
    }
    int mx = 0;
    for (int i = 0; i < n; ++i)
    {
        int res = 0;
        memset(st, 0, sizeof st);
        vii qr;
        for (int j = 0; j < n; ++j)
        {
            int ind = (j+i)%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);
        }
        mx = max(res, mx);
    }
    cout << mx << endl;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 6 ms 6476 KB Output is correct
5 Correct 8 ms 6484 KB Output is correct
6 Correct 8 ms 6480 KB Output is correct
7 Correct 6 ms 6472 KB Output is correct
8 Correct 5 ms 6480 KB Output is correct
9 Correct 6 ms 6484 KB Output is correct
10 Correct 6 ms 6484 KB Output is correct
11 Correct 7 ms 6472 KB Output is correct
12 Correct 8 ms 6524 KB Output is correct
13 Correct 8 ms 6476 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 6 ms 6476 KB Output is correct
5 Correct 8 ms 6484 KB Output is correct
6 Correct 8 ms 6480 KB Output is correct
7 Correct 6 ms 6472 KB Output is correct
8 Correct 5 ms 6480 KB Output is correct
9 Correct 6 ms 6484 KB Output is correct
10 Correct 6 ms 6484 KB Output is correct
11 Correct 7 ms 6472 KB Output is correct
12 Correct 8 ms 6524 KB Output is correct
13 Correct 8 ms 6476 KB Output is correct
14 Correct 194 ms 6584 KB Output is correct
15 Correct 184 ms 6580 KB Output is correct
16 Correct 126 ms 6584 KB Output is correct
17 Correct 147 ms 6580 KB Output is correct
18 Correct 217 ms 6584 KB Output is correct
19 Correct 165 ms 6584 KB Output is correct
20 Correct 166 ms 6584 KB Output is correct
21 Correct 240 ms 6588 KB Output is correct
22 Correct 186 ms 6580 KB Output is correct
23 Correct 150 ms 6484 KB Output is correct
24 Correct 134 ms 6576 KB Output is correct
25 Correct 190 ms 6572 KB Output is correct
26 Correct 230 ms 6576 KB Output is correct
27 Correct 180 ms 6580 KB Output is correct
28 Correct 210 ms 6572 KB Output is correct
29 Correct 207 ms 6572 KB Output is correct
30 Correct 152 ms 6572 KB Output is correct
31 Correct 216 ms 6572 KB Output is correct
32 Correct 231 ms 6576 KB Output is correct
33 Correct 196 ms 6604 KB Output is correct

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 6 ms 6476 KB Output is correct
5 Correct 8 ms 6484 KB Output is correct
6 Correct 8 ms 6480 KB Output is correct
7 Correct 6 ms 6472 KB Output is correct
8 Correct 5 ms 6480 KB Output is correct
9 Correct 6 ms 6484 KB Output is correct
10 Correct 6 ms 6484 KB Output is correct
11 Correct 7 ms 6472 KB Output is correct
12 Correct 8 ms 6524 KB Output is correct
13 Correct 8 ms 6476 KB Output is correct
14 Correct 194 ms 6584 KB Output is correct
15 Correct 184 ms 6580 KB Output is correct
16 Correct 126 ms 6584 KB Output is correct
17 Correct 147 ms 6580 KB Output is correct
18 Correct 217 ms 6584 KB Output is correct
19 Correct 165 ms 6584 KB Output is correct
20 Correct 166 ms 6584 KB Output is correct
21 Correct 240 ms 6588 KB Output is correct
22 Correct 186 ms 6580 KB Output is correct
23 Correct 150 ms 6484 KB Output is correct
24 Correct 134 ms 6576 KB Output is correct
25 Correct 190 ms 6572 KB Output is correct
26 Correct 230 ms 6576 KB Output is correct
27 Correct 180 ms 6580 KB Output is correct
28 Correct 210 ms 6572 KB Output is correct
29 Correct 207 ms 6572 KB Output is correct
30 Correct 152 ms 6572 KB Output is correct
31 Correct 216 ms 6572 KB Output is correct
32 Correct 231 ms 6576 KB Output is correct
33 Correct 196 ms 6604 KB Output is correct
34 Execution timed out 2059 ms 6612 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 6 ms 6476 KB Output is correct
5 Correct 8 ms 6484 KB Output is correct
6 Correct 8 ms 6480 KB Output is correct
7 Correct 6 ms 6472 KB Output is correct
8 Correct 5 ms 6480 KB Output is correct
9 Correct 6 ms 6484 KB Output is correct
10 Correct 6 ms 6484 KB Output is correct
11 Correct 7 ms 6472 KB Output is correct
12 Correct 8 ms 6524 KB Output is correct
13 Correct 8 ms 6476 KB Output is correct
14 Correct 194 ms 6584 KB Output is correct
15 Correct 184 ms 6580 KB Output is correct
16 Correct 126 ms 6584 KB Output is correct
17 Correct 147 ms 6580 KB Output is correct
18 Correct 217 ms 6584 KB Output is correct
19 Correct 165 ms 6584 KB Output is correct
20 Correct 166 ms 6584 KB Output is correct
21 Correct 240 ms 6588 KB Output is correct
22 Correct 186 ms 6580 KB Output is correct
23 Correct 150 ms 6484 KB Output is correct
24 Correct 134 ms 6576 KB Output is correct
25 Correct 190 ms 6572 KB Output is correct
26 Correct 230 ms 6576 KB Output is correct
27 Correct 180 ms 6580 KB Output is correct
28 Correct 210 ms 6572 KB Output is correct
29 Correct 207 ms 6572 KB Output is correct
30 Correct 152 ms 6572 KB Output is correct
31 Correct 216 ms 6572 KB Output is correct
32 Correct 231 ms 6576 KB Output is correct
33 Correct 196 ms 6604 KB Output is correct
34 Execution timed out 2059 ms 6612 KB Time limit exceeded
35 Halted 0 ms 0 KB -