oj.uz

답안 #614053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
614053 2022-07-30T17:26:46 Z MohamedAliSaidane Monochrome Points (JOI20_monochrome) C++14
100 / 100
 982 ms 10680 KB 
#include<bits/stdc++.h>

    using namespace std;

    typedef long long ll;

    typedef pair<int,int> pii;
    typedef pair<ll,ll> pll;

    typedef vector<int> vi;
    typedef vector<ll> vll;
    typedef vector<pii> vpi;
    typedef vector<pll> vpl;

    #define pb push_back
    #define popb pop_back
    #define all(x) (x).begin(), (x).end()


    #define ff first
    #define ss second

    const int nax = 4e5 + 4;
    int n;
    int col[nax];
    ll dp[nax];
    vi perm, ot;

    struct FenwickTree
    {
        vector<int> bit;  // binary indexed tree
        int n;

        FenwickTree(int n) {
            this->n = n;
            bit.assign(n, 0);
        }

        FenwickTree(vector<int> a) : FenwickTree(a.size()) {
            for (size_t i = 0; i < a.size(); i++)
                add(i, a[i]);
        }

        int sum(int r) {
            int ret = 0;
            for (; r >= 0; r = (r & (r + 1)) - 1)
                ret += bit[r];
            return ret;
        }

        int sum(int l, int r) {
            return sum(r) - sum(l - 1);
        }

        void add(int idx, int delta) {
            for (; idx < n; idx = idx | (idx + 1))
                bit[idx] += delta;
        }
    };

    ll compute(int x)
    {
        if(x >= n)
            return 0 ;
        if(dp[x] != -1)
            return dp[x];
        vpi inter;
        ll rep = 0;
        for(int i=  0 ; i < n; i++)
        {
            int a = perm[(i + x)%n];
            int b = ot[i];
            inter.pb({min(a,b), max(a,b)});
        }
        sort(all(inter));
        reverse(all(inter));
        FenwickTree fen = FenwickTree(2 * n);
        for(int i=  0 ; i < n; i++)
        {
            int a = inter[i].ff;
            int b=  inter[i].ss;
            rep += (ll)(fen.sum(a,b));
            fen.add(a, 1);
            fen.add(b, -1);
        }
        return dp[x] = rep;

    }
    int32_t main()
    {
        ios::sync_with_stdio(false);
        cin.tie(0); cout.tie(0);
        memset(dp, -1,sizeof(dp));
        cin >> n;
        for(int i  = 0 ; i < 2 * n ; i++)
        {
            char c; cin >> c;
            if(c == 'B')
                col[i] = 1;
            if(col[i])
                perm.pb(i);
            else
                ot.pb(i);
        }
        ll ans = 0 ;
        int debut = 0;
        int fin = n - 1;
        int rep = debut;
        while(debut <= fin )
        {
            int mid = (debut + fin)/2;
            //cout << mid << ' ' << compute(mid) << ' ' << compute(mid + 1) << "\n";
            if(compute(mid + 1) > compute(mid))
            {
                rep = mid + 1;
                debut = mid + 1;
                ans = max(ans, compute(mid + 1));
            }
            else
            {
                rep = mid ;
                fin = mid - 1;
                ans = max(ans, compute(mid ));
            }
        }
        cout << ans;
    }

Compilation message

monochrome.cpp: In function 'int32_t main()':
monochrome.cpp:108:13: warning: variable 'rep' set but not used [-Wunused-but-set-variable]
  108 |         int rep = debut;
      |             ^~~

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3412 KB Output is correct
2 Correct 1 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 1 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 1 ms 3412 KB Output is correct
8 Correct 1 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 1 ms 3412 KB Output is correct
13 Correct 1 ms 3412 KB Output is correct
14 Correct 3 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Correct 2 ms 3412 KB Output is correct
20 Correct 2 ms 3444 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 2 ms 3412 KB Output is correct
23 Correct 2 ms 3412 KB Output is correct
24 Correct 2 ms 3412 KB Output is correct
25 Correct 2 ms 3372 KB Output is correct
26 Correct 2 ms 3412 KB Output is correct
27 Correct 2 ms 3412 KB Output is correct
28 Correct 2 ms 3412 KB Output is correct
29 Correct 2 ms 3412 KB Output is correct
30 Correct 2 ms 3412 KB Output is correct
31 Correct 2 ms 3412 KB Output is correct
32 Correct 2 ms 3412 KB Output is correct
33 Correct 2 ms 3412 KB Output is correct
34 Correct 5 ms 3540 KB Output is correct
35 Correct 5 ms 3540 KB Output is correct
36 Correct 5 ms 3540 KB Output is correct
37 Correct 5 ms 3540 KB Output is correct
38 Correct 4 ms 3540 KB Output is correct
39 Correct 4 ms 3540 KB Output is correct
40 Correct 4 ms 3540 KB Output is correct
41 Correct 4 ms 3540 KB Output is correct
42 Correct 5 ms 3488 KB Output is correct
43 Correct 4 ms 3540 KB Output is correct
44 Correct 5 ms 3540 KB Output is correct
45 Correct 5 ms 3412 KB Output is correct
46 Correct 5 ms 3412 KB Output is correct
47 Correct 5 ms 3536 KB Output is correct
48 Correct 5 ms 3540 KB Output is correct
49 Correct 4 ms 3412 KB Output is correct
50 Correct 5 ms 3528 KB Output is correct
51 Correct 4 ms 3412 KB Output is correct
52 Correct 5 ms 3540 KB Output is correct
53 Correct 871 ms 10312 KB Output is correct
54 Correct 959 ms 10608 KB Output is correct
55 Correct 839 ms 10432 KB Output is correct
56 Correct 810 ms 10440 KB Output is correct
57 Correct 660 ms 9856 KB Output is correct
58 Correct 647 ms 9884 KB Output is correct
59 Correct 673 ms 10128 KB Output is correct
60 Correct 733 ms 10320 KB Output is correct
61 Correct 777 ms 10472 KB Output is correct
62 Correct 756 ms 10584 KB Output is correct
63 Correct 842 ms 10500 KB Output is correct
64 Correct 659 ms 9956 KB Output is correct
65 Correct 879 ms 10300 KB Output is correct
66 Correct 872 ms 10468 KB Output is correct
67 Correct 954 ms 10400 KB Output is correct
68 Correct 680 ms 10220 KB Output is correct
69 Correct 769 ms 9808 KB Output is correct
70 Correct 754 ms 9580 KB Output is correct
71 Correct 982 ms 9832 KB Output is correct
72 Correct 594 ms 9852 KB Output is correct
73 Correct 946 ms 10680 KB Output is correct