oj.uz

Submission #543311

# Submission time Handle Problem Language Result Execution time Memory
543311 2022-03-30T06:35:09 Z balbit Monochrome Points (JOI20_monochrome) C++14
35 / 100
 2000 ms 2912 KB 
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<ll, ll>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e5+5;


//char a[maxn];

signed main(){
    IOS();

    int n; cin>>n; n*=2;
    string a; cin>>a;
    ll ans = 0;

    REP(tt,n) {
        int totb=0, totw=0;
        int hb=0, hw=0;
        ll re = 0;

        vector<int> v;
        REP(i,n) {
            (a[i] == 'B'?totb:totw) ++;
            if (a[i] == 'B') {
                if ((n/2 - totw) >= hb+1) {
                    v.pb(0);
                    ++hb;
                }else{
                    auto it = find(ALL(v), 1);
                    re += v.end() - it - 1;
                    v.erase(it);
                    hw--;
                }
            }else{
                if ((n/2 - totb) >= hw+1) {
                    v.pb(1);
                    ++hw;
                }else{
                    auto it = find(ALL(v), 0);
                    re += v.end() - it - 1;
                    v.erase(it);
                    hb--;
                }
            }
        }

        MX(ans, re);
        a = a.substr(n-1) + a.substr(0, n-1);
        bug(a);
    }
    cout<<ans<<endl;


}

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 11 ms 324 KB Output is correct
15 Correct 12 ms 320 KB Output is correct
16 Correct 11 ms 212 KB Output is correct
17 Correct 10 ms 324 KB Output is correct
18 Correct 7 ms 212 KB Output is correct
19 Correct 7 ms 212 KB Output is correct
20 Correct 7 ms 320 KB Output is correct
21 Correct 6 ms 212 KB Output is correct
22 Correct 7 ms 212 KB Output is correct
23 Correct 4 ms 212 KB Output is correct
24 Correct 6 ms 212 KB Output is correct
25 Correct 5 ms 212 KB Output is correct
26 Correct 7 ms 324 KB Output is correct
27 Correct 7 ms 320 KB Output is correct
28 Correct 10 ms 328 KB Output is correct
29 Correct 6 ms 320 KB Output is correct
30 Correct 6 ms 328 KB Output is correct
31 Correct 7 ms 212 KB Output is correct
32 Correct 8 ms 320 KB Output is correct
33 Correct 9 ms 212 KB Output is correct
34 Correct 1571 ms 340 KB Output is correct
35 Correct 1562 ms 340 KB Output is correct
36 Correct 1508 ms 340 KB Output is correct
37 Correct 1329 ms 344 KB Output is correct
38 Correct 1160 ms 340 KB Output is correct
39 Correct 1504 ms 340 KB Output is correct
40 Correct 1117 ms 352 KB Output is correct
41 Correct 1032 ms 340 KB Output is correct
42 Correct 1463 ms 344 KB Output is correct
43 Correct 1576 ms 340 KB Output is correct
44 Correct 1185 ms 340 KB Output is correct
45 Correct 1318 ms 344 KB Output is correct
46 Correct 1448 ms 340 KB Output is correct
47 Correct 1412 ms 352 KB Output is correct
48 Correct 1692 ms 348 KB Output is correct
49 Correct 1364 ms 340 KB Output is correct
50 Correct 1512 ms 340 KB Output is correct
51 Correct 1477 ms 340 KB Output is correct
52 Correct 1558 ms 340 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 11 ms 324 KB Output is correct
15 Correct 12 ms 320 KB Output is correct
16 Correct 11 ms 212 KB Output is correct
17 Correct 10 ms 324 KB Output is correct
18 Correct 7 ms 212 KB Output is correct
19 Correct 7 ms 212 KB Output is correct
20 Correct 7 ms 320 KB Output is correct
21 Correct 6 ms 212 KB Output is correct
22 Correct 7 ms 212 KB Output is correct
23 Correct 4 ms 212 KB Output is correct
24 Correct 6 ms 212 KB Output is correct
25 Correct 5 ms 212 KB Output is correct
26 Correct 7 ms 324 KB Output is correct
27 Correct 7 ms 320 KB Output is correct
28 Correct 10 ms 328 KB Output is correct
29 Correct 6 ms 320 KB Output is correct
30 Correct 6 ms 328 KB Output is correct
31 Correct 7 ms 212 KB Output is correct
32 Correct 8 ms 320 KB Output is correct
33 Correct 9 ms 212 KB Output is correct
34 Correct 1571 ms 340 KB Output is correct
35 Correct 1562 ms 340 KB Output is correct
36 Correct 1508 ms 340 KB Output is correct
37 Correct 1329 ms 344 KB Output is correct
38 Correct 1160 ms 340 KB Output is correct
39 Correct 1504 ms 340 KB Output is correct
40 Correct 1117 ms 352 KB Output is correct
41 Correct 1032 ms 340 KB Output is correct
42 Correct 1463 ms 344 KB Output is correct
43 Correct 1576 ms 340 KB Output is correct
44 Correct 1185 ms 340 KB Output is correct
45 Correct 1318 ms 344 KB Output is correct
46 Correct 1448 ms 340 KB Output is correct
47 Correct 1412 ms 352 KB Output is correct
48 Correct 1692 ms 348 KB Output is correct
49 Correct 1364 ms 340 KB Output is correct
50 Correct 1512 ms 340 KB Output is correct
51 Correct 1477 ms 340 KB Output is correct
52 Correct 1558 ms 340 KB Output is correct
53 Execution timed out 2082 ms 2912 KB Time limit exceeded
54 Halted 0 ms 0 KB -