oj.uz

Submission #643612

# Submission time Handle Problem Language Result Execution time Memory
643612 2022-09-22T15:48:16 Z maomao90 Monochrome Points (JOI20_monochrome) C++17
35 / 100
 2000 ms 6376 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 400005;

int n;
string s;
ll ans;

int fw[MAXN];
void incre(int i, int x) {
    for (; i <= 2 * n; i += i & -i) {
        fw[i] += x;
    }
}
int qsm(int i) {
    int res = 0;
    for (; i > 0; i -= i & -i) {
        res += fw[i];
    }
    return res;
}
int qsm(int s, int e) {
    return qsm(e) - qsm(s - 1);
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    cin >> s;
    s = "?" + s;
    REP (i, 2, 2 * n + 1) {
        if (s[i] == s[1]) {
            continue;
        }
        int u = 1, v = i;
        vii eg;
        cerr << u << ' ' << v << '\n';
        while (u <= 2 * n) {
            eg.pb({u, v});
            cerr << ' ' << u << ' ' << v << '\n';
            u++; v++;
            while (u <= 2 * n && s[u] != s[1]) {
                u++;
            }
            if (v > 2 * n) {
                v -= 2 * n;
            }
            while (s[v] == s[1]) {
                v++;
                if (v > 2 * n) {
                    v -= 2 * n;
                }
            }
        }
        assert(SZ(eg) == n);
        for (auto &[u, v] : eg) {
            if (u > v) {
                swap(u, v);
            }
        }
        sort(ALL(eg));
        REP (i, 1, 2 * n + 1) {
            fw[i] = 0;
        }
        ll sm = 0;
        for (auto [u, v] : eg) {
            sm += qsm(u, v);
            incre(v, 1);
        }
        mxto(ans, sm);
        cerr << ' ' << sm << '\n';
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 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 1 ms 212 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 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 1 ms 212 KB Output is correct
14 Correct 8 ms 328 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 8 ms 340 KB Output is correct
18 Correct 5 ms 328 KB Output is correct
19 Correct 5 ms 212 KB Output is correct
20 Correct 5 ms 212 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 5 ms 332 KB Output is correct
24 Correct 6 ms 212 KB Output is correct
25 Correct 5 ms 212 KB Output is correct
26 Correct 5 ms 340 KB Output is correct
27 Correct 5 ms 336 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 4 ms 212 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 5 ms 332 KB Output is correct
33 Correct 6 ms 340 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 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 1 ms 212 KB Output is correct
14 Correct 8 ms 328 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 8 ms 340 KB Output is correct
18 Correct 5 ms 328 KB Output is correct
19 Correct 5 ms 212 KB Output is correct
20 Correct 5 ms 212 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 5 ms 332 KB Output is correct
24 Correct 6 ms 212 KB Output is correct
25 Correct 5 ms 212 KB Output is correct
26 Correct 5 ms 340 KB Output is correct
27 Correct 5 ms 336 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 4 ms 212 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 5 ms 332 KB Output is correct
33 Correct 6 ms 340 KB Output is correct
34 Correct 335 ms 364 KB Output is correct
35 Correct 345 ms 340 KB Output is correct
36 Correct 323 ms 368 KB Output is correct
37 Correct 307 ms 368 KB Output is correct
38 Correct 213 ms 340 KB Output is correct
39 Correct 254 ms 368 KB Output is correct
40 Correct 231 ms 368 KB Output is correct
41 Correct 209 ms 364 KB Output is correct
42 Correct 312 ms 368 KB Output is correct
43 Correct 259 ms 368 KB Output is correct
44 Correct 237 ms 360 KB Output is correct
45 Correct 223 ms 376 KB Output is correct
46 Correct 287 ms 368 KB Output is correct
47 Correct 243 ms 384 KB Output is correct
48 Correct 248 ms 368 KB Output is correct
49 Correct 193 ms 340 KB Output is correct
50 Correct 197 ms 340 KB Output is correct
51 Correct 199 ms 364 KB Output is correct
52 Correct 326 ms 368 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 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 1 ms 212 KB Output is correct
14 Correct 8 ms 328 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 8 ms 340 KB Output is correct
18 Correct 5 ms 328 KB Output is correct
19 Correct 5 ms 212 KB Output is correct
20 Correct 5 ms 212 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 5 ms 332 KB Output is correct
24 Correct 6 ms 212 KB Output is correct
25 Correct 5 ms 212 KB Output is correct
26 Correct 5 ms 340 KB Output is correct
27 Correct 5 ms 336 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 4 ms 212 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 5 ms 332 KB Output is correct
33 Correct 6 ms 340 KB Output is correct
34 Correct 335 ms 364 KB Output is correct
35 Correct 345 ms 340 KB Output is correct
36 Correct 323 ms 368 KB Output is correct
37 Correct 307 ms 368 KB Output is correct
38 Correct 213 ms 340 KB Output is correct
39 Correct 254 ms 368 KB Output is correct
40 Correct 231 ms 368 KB Output is correct
41 Correct 209 ms 364 KB Output is correct
42 Correct 312 ms 368 KB Output is correct
43 Correct 259 ms 368 KB Output is correct
44 Correct 237 ms 360 KB Output is correct
45 Correct 223 ms 376 KB Output is correct
46 Correct 287 ms 368 KB Output is correct
47 Correct 243 ms 384 KB Output is correct
48 Correct 248 ms 368 KB Output is correct
49 Correct 193 ms 340 KB Output is correct
50 Correct 197 ms 340 KB Output is correct
51 Correct 199 ms 364 KB Output is correct
52 Correct 326 ms 368 KB Output is correct
53 Execution timed out 2039 ms 6376 KB Time limit exceeded
54 Halted 0 ms 0 KB -