oj.uz

Submission #516352

# Submission time Handle Problem Language Result Execution time Memory
516352 2022-01-21T07:57:21 Z qwerasdfzxcl Monochrome Points (JOI20_monochrome) C++14
35 / 100
 2000 ms 8968 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
const ll INF = 1e18;
struct Seg{
    int tree[800800], sz;
    void init(int n){
        sz = n;
        fill(tree, tree+sz*2, 0);
    }
    void update(int p, int x){
        for (tree[p+=sz]+=x;p>1;p>>=1) tree[p>>1] = tree[p] + tree[p^1];
    }
    int query(int l, int r){
        int ret = 0;
        for (l+=sz, r+=sz;l<r;l>>=1, r>>=1){
            if (l&1) ret += tree[l++];
            if (r&1) ret += tree[--r];
        }
        return ret;
    }
}tree;
char a[400400];
int B[200200], W[200200], arr[400400];
vector<pair<int, int>> E;

ll calc(int n){
    for (auto &p:E){
        if (p.first > p.second) swap(p.first, p.second);
        arr[p.first] = -1;
        arr[p.second] = p.first;
    }
    tree.init(n+1);

    ll ret = 0;
    for (int i=1;i<=n;i++){
        if (arr[i]==-1) tree.update(i, 1);
        else{
            tree.update(arr[i], -1);
            ret += tree.query(arr[i]+1, i);
        }
    }
    return ret;
}

int main(){
    int n;
    scanf("%d", &n);
    scanf("%s", a+1);
    n *= 2;

    int cb = 0, cw = 0;
    for (int i=1;i<=n;i++){
        if (a[i]=='B') B[++cb] = i;
        else W[++cw] = i;
    }

    ll ans = 0;
    for (int z=1;z<=n/2;z++){
        E.clear();
        int pt = z;
        for (int i=1;i<=n/2;i++){
            E.emplace_back(B[i], W[pt]);
            pt++;
            if (pt>n/2) pt -= n/2;
        }

        ans = max(ans, calc(n));
    }
    printf("%lld\n", ans);
    return 0;
}

Compilation message

monochrome.cpp: In function 'int main()':
monochrome.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
monochrome.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     scanf("%s", a+1);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 8 ms 332 KB Output is correct
15 Correct 9 ms 336 KB Output is correct
16 Correct 8 ms 332 KB Output is correct
17 Correct 8 ms 332 KB Output is correct
18 Correct 8 ms 352 KB Output is correct
19 Correct 6 ms 332 KB Output is correct
20 Correct 7 ms 332 KB Output is correct
21 Correct 8 ms 340 KB Output is correct
22 Correct 7 ms 336 KB Output is correct
23 Correct 5 ms 204 KB Output is correct
24 Correct 5 ms 336 KB Output is correct
25 Correct 5 ms 332 KB Output is correct
26 Correct 6 ms 332 KB Output is correct
27 Correct 7 ms 332 KB Output is correct
28 Correct 7 ms 332 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 6 ms 332 KB Output is correct
31 Correct 7 ms 332 KB Output is correct
32 Correct 6 ms 332 KB Output is correct
33 Correct 8 ms 332 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 8 ms 332 KB Output is correct
15 Correct 9 ms 336 KB Output is correct
16 Correct 8 ms 332 KB Output is correct
17 Correct 8 ms 332 KB Output is correct
18 Correct 8 ms 352 KB Output is correct
19 Correct 6 ms 332 KB Output is correct
20 Correct 7 ms 332 KB Output is correct
21 Correct 8 ms 340 KB Output is correct
22 Correct 7 ms 336 KB Output is correct
23 Correct 5 ms 204 KB Output is correct
24 Correct 5 ms 336 KB Output is correct
25 Correct 5 ms 332 KB Output is correct
26 Correct 6 ms 332 KB Output is correct
27 Correct 7 ms 332 KB Output is correct
28 Correct 7 ms 332 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 6 ms 332 KB Output is correct
31 Correct 7 ms 332 KB Output is correct
32 Correct 6 ms 332 KB Output is correct
33 Correct 8 ms 332 KB Output is correct
34 Correct 415 ms 400 KB Output is correct
35 Correct 396 ms 404 KB Output is correct
36 Correct 397 ms 400 KB Output is correct
37 Correct 356 ms 396 KB Output is correct
38 Correct 272 ms 392 KB Output is correct
39 Correct 309 ms 400 KB Output is correct
40 Correct 289 ms 396 KB Output is correct
41 Correct 282 ms 392 KB Output is correct
42 Correct 390 ms 452 KB Output is correct
43 Correct 317 ms 392 KB Output is correct
44 Correct 302 ms 400 KB Output is correct
45 Correct 318 ms 396 KB Output is correct
46 Correct 350 ms 400 KB Output is correct
47 Correct 347 ms 404 KB Output is correct
48 Correct 328 ms 400 KB Output is correct
49 Correct 258 ms 400 KB Output is correct
50 Correct 310 ms 400 KB Output is correct
51 Correct 308 ms 400 KB Output is correct
52 Correct 326 ms 400 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 8 ms 332 KB Output is correct
15 Correct 9 ms 336 KB Output is correct
16 Correct 8 ms 332 KB Output is correct
17 Correct 8 ms 332 KB Output is correct
18 Correct 8 ms 352 KB Output is correct
19 Correct 6 ms 332 KB Output is correct
20 Correct 7 ms 332 KB Output is correct
21 Correct 8 ms 340 KB Output is correct
22 Correct 7 ms 336 KB Output is correct
23 Correct 5 ms 204 KB Output is correct
24 Correct 5 ms 336 KB Output is correct
25 Correct 5 ms 332 KB Output is correct
26 Correct 6 ms 332 KB Output is correct
27 Correct 7 ms 332 KB Output is correct
28 Correct 7 ms 332 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 6 ms 332 KB Output is correct
31 Correct 7 ms 332 KB Output is correct
32 Correct 6 ms 332 KB Output is correct
33 Correct 8 ms 332 KB Output is correct
34 Correct 415 ms 400 KB Output is correct
35 Correct 396 ms 404 KB Output is correct
36 Correct 397 ms 400 KB Output is correct
37 Correct 356 ms 396 KB Output is correct
38 Correct 272 ms 392 KB Output is correct
39 Correct 309 ms 400 KB Output is correct
40 Correct 289 ms 396 KB Output is correct
41 Correct 282 ms 392 KB Output is correct
42 Correct 390 ms 452 KB Output is correct
43 Correct 317 ms 392 KB Output is correct
44 Correct 302 ms 400 KB Output is correct
45 Correct 318 ms 396 KB Output is correct
46 Correct 350 ms 400 KB Output is correct
47 Correct 347 ms 404 KB Output is correct
48 Correct 328 ms 400 KB Output is correct
49 Correct 258 ms 400 KB Output is correct
50 Correct 310 ms 400 KB Output is correct
51 Correct 308 ms 400 KB Output is correct
52 Correct 326 ms 400 KB Output is correct
53 Execution timed out 2031 ms 8968 KB Time limit exceeded
54 Halted 0 ms 0 KB -