oj.uz

답안 #1019749

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019749 2024-07-11T08:34:31 Z TAhmed33 Sličnost (COI23_slicnost) C++
67 / 100
 615 ms 281936 KB 
#include <iostream>
using namespace std;
typedef long long ll;
pair <ll, ll> merge (pair <ll, ll> x, pair <ll, ll> y) {
    if (x.first > y.first) return x;
    if (x.first < y.first) return y;
    return {x.first, x.second + y.second};
}
#define mid ((l + r) >> 1)
const int MAXN = 1e7 + 25;
int tl[MAXN], tr[MAXN], sum[MAXN], cnt;
pair <ll, ll> dp[MAXN];
int new_leaf (int x) {
    cnt++; dp[cnt] = {0, 1};
    return cnt;
}
int new_node (int l, int r) {
    cnt++;
    dp[cnt] = merge(dp[l], dp[r]);
    tl[cnt] = l; tr[cnt] = r;
    return cnt;
}
int build (int l, int r) {
    if (l == r) {
        return new_leaf(l);
    } else {
        return new_node(build(l, mid), build(mid + 1, r));
    }
}
int update (int l, int r, int a, int b, int c, int node) {
    if (l > b || r < a) return node;
    if (l >= a && r <= b) {
        cnt++; tl[cnt] = tl[node]; tr[cnt] = tr[node];
        sum[cnt] = sum[node]; dp[cnt] = dp[node];
        sum[cnt] += c; dp[cnt].first += c;
        return cnt;
    }
    int x = update(l, mid, a, b, c, tl[node]);
    int y = update(mid + 1, r, a, b, c, tr[node]);
    cnt++;
    tl[cnt] = x; tr[cnt] = y;
    dp[cnt] = merge({dp[x].first + sum[node], dp[x].second}, {dp[y].first + sum[node], dp[y].second});
    sum[cnt] = sum[node];
    return cnt;
}
pair <ll, ll> get (int node) {
    return dp[node];
}
int a[100002], n, k, q, p[100002];
int roots[100002];
struct SegmentTree2 {
    pair <ll, ll> tree2[400001];
    void build (int l, int r, int node) {
        if (l == r) {
            tree2[node] = {0, 1};
        } else {
            build(l, mid, 2 * node);
            build(mid + 1, r, 2 * node + 1);
            tree2[node] = merge(tree2[2 * node], tree2[2 * node + 1]);
        }
    }
    void update (int l, int r, int a, pair <int, int> b, int node) {
        if (l > a || r < a) return;
        if (l == r) {
            tree2[node] = b;
            return;
        }
        update(l, mid, a, b, 2 * node);
        update(mid + 1, r, a, b, 2 * node + 1);
        tree2[node] = merge(tree2[2 * node], tree2[2 * node + 1]);
    }
} cur;
void val () {
    cout << cur.tree2[1].first << " " << cur.tree2[1].second << '\n';
}
void solve () {
    cin >> n >> k >> q;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        int x; cin >> x; p[x] = i;
    }
    for (int i = 1; i <= n; i++) {
        a[i] = p[a[i]];
    }
    cur.build(1, n - k + 1, 1);
    pair <ll, ll> dd = {-1, 0};
    roots[1] = build(1, n);
    for (int i = 1; i <= k; i++) {
        roots[1] = update(1, n, max(1, a[i] - k + 1), min(a[i], n - k + 1), 1, roots[1]);
    }
    cur.update(1, n - k + 1, 1, get(roots[1]), 1);
    for (int i = k + 1; i <= n; i++) {
        roots[i - k + 1] = roots[i - k];
        roots[i - k + 1] = update(1, n, max(1, a[i - k] - k + 1), min(a[i - k], n - k + 1), -1, roots[i - k + 1]);
        roots[i - k + 1] = update(1, n, max(1, a[i] - k + 1), min(a[i], n - k + 1), 1, roots[i - k + 1]);
        cur.update(1, n - k + 1, i - k + 1, get(roots[i - k + 1]), 1);
    }
    val();
    while (q--) {
        int t; cin >> t;
        if (t + 1 <= n - k + 1) {
            roots[t + 1] = update(1, n, max(1, a[t + 1] - k + 1), min(a[t + 1], n - k + 1), -1, roots[t + 1]);
            roots[t + 1] = update(1, n, max(1, a[t] - k + 1), min(a[t], n - k + 1), 1, roots[t + 1]);
            cur.update(1, n - k + 1, t + 1, get(roots[t + 1]), 1);
        }
        if (t - k + 1 >= 1) {
            roots[t - k + 1] = update(1, n, max(1, a[t + 1] - k + 1), min(a[t + 1], n - k + 1), 1, roots[t - k + 1]);
            roots[t - k + 1] = update(1, n, max(1, a[t] - k + 1), min(a[t], n - k + 1), -1, roots[t - k + 1]);
            cur.update(1, n - k + 1, t - k + 1, get(roots[t - k + 1]), 1);
        }
        swap(a[t], a[t + 1]);
        val();
    }
}       
signed main () {
    ios::sync_with_stdio(0); cin.tie(0);
    int tc = 1; //cin >> tc;
    while (tc--) solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:88:19: warning: variable 'dd' set but not used [-Wunused-but-set-variable]
   88 |     pair <ll, ll> dd = {-1, 0};
      |                   ^~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 4440 KB Output is correct
17 Correct 5 ms 4956 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 6 ms 5596 KB Output is correct
20 Correct 7 ms 7260 KB Output is correct
21 Correct 6 ms 7772 KB Output is correct
22 Correct 2 ms 3164 KB Output is correct
23 Correct 9 ms 7004 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 6 ms 6236 KB Output is correct
26 Correct 7 ms 6976 KB Output is correct
27 Correct 7 ms 7772 KB Output is correct
28 Correct 5 ms 5980 KB Output is correct
29 Correct 4 ms 4956 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 4440 KB Output is correct
17 Correct 5 ms 4956 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 6 ms 5596 KB Output is correct
20 Correct 7 ms 7260 KB Output is correct
21 Correct 6 ms 7772 KB Output is correct
22 Correct 2 ms 3164 KB Output is correct
23 Correct 9 ms 7004 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 6 ms 6236 KB Output is correct
26 Correct 7 ms 6976 KB Output is correct
27 Correct 7 ms 7772 KB Output is correct
28 Correct 5 ms 5980 KB Output is correct
29 Correct 4 ms 4956 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct
31 Correct 130 ms 105932 KB Output is correct
32 Correct 137 ms 112208 KB Output is correct
33 Correct 42 ms 54828 KB Output is correct
34 Correct 152 ms 137812 KB Output is correct
35 Correct 236 ms 187476 KB Output is correct
36 Correct 157 ms 211536 KB Output is correct
37 Correct 61 ms 79952 KB Output is correct
38 Correct 228 ms 178752 KB Output is correct
39 Correct 150 ms 186196 KB Output is correct
40 Correct 186 ms 163940 KB Output is correct
41 Correct 211 ms 183120 KB Output is correct
42 Correct 288 ms 211024 KB Output is correct
43 Correct 162 ms 151456 KB Output is correct
44 Correct 123 ms 121668 KB Output is correct
45 Correct 67 ms 84532 KB Output is correct

Subtask #4
7.0 / 7.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 4440 KB Output is correct
17 Correct 5 ms 4956 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 6 ms 5596 KB Output is correct
20 Correct 7 ms 7260 KB Output is correct
21 Correct 6 ms 7772 KB Output is correct
22 Correct 2 ms 3164 KB Output is correct
23 Correct 9 ms 7004 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 6 ms 6236 KB Output is correct
26 Correct 7 ms 6976 KB Output is correct
27 Correct 7 ms 7772 KB Output is correct
28 Correct 5 ms 5980 KB Output is correct
29 Correct 4 ms 4956 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 1 ms 600 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 616 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 15 ms 11868 KB Output is correct
47 Correct 19 ms 12896 KB Output is correct
48 Correct 5 ms 2652 KB Output is correct
49 Correct 15 ms 11680 KB Output is correct
50 Correct 24 ms 20048 KB Output is correct
51 Correct 4 ms 4700 KB Output is correct
52 Correct 18 ms 17620 KB Output is correct
53 Correct 26 ms 19284 KB Output is correct
54 Correct 19 ms 19296 KB Output is correct
55 Correct 9 ms 11100 KB Output is correct
56 Correct 27 ms 20052 KB Output is correct
57 Correct 26 ms 19548 KB Output is correct
58 Correct 6 ms 5980 KB Output is correct
59 Correct 22 ms 18304 KB Output is correct
60 Correct 6 ms 6492 KB Output is correct

Subtask #6
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 4440 KB Output is correct
17 Correct 5 ms 4956 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 6 ms 5596 KB Output is correct
20 Correct 7 ms 7260 KB Output is correct
21 Correct 6 ms 7772 KB Output is correct
22 Correct 2 ms 3164 KB Output is correct
23 Correct 9 ms 7004 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 6 ms 6236 KB Output is correct
26 Correct 7 ms 6976 KB Output is correct
27 Correct 7 ms 7772 KB Output is correct
28 Correct 5 ms 5980 KB Output is correct
29 Correct 4 ms 4956 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct
31 Correct 130 ms 105932 KB Output is correct
32 Correct 137 ms 112208 KB Output is correct
33 Correct 42 ms 54828 KB Output is correct
34 Correct 152 ms 137812 KB Output is correct
35 Correct 236 ms 187476 KB Output is correct
36 Correct 157 ms 211536 KB Output is correct
37 Correct 61 ms 79952 KB Output is correct
38 Correct 228 ms 178752 KB Output is correct
39 Correct 150 ms 186196 KB Output is correct
40 Correct 186 ms 163940 KB Output is correct
41 Correct 211 ms 183120 KB Output is correct
42 Correct 288 ms 211024 KB Output is correct
43 Correct 162 ms 151456 KB Output is correct
44 Correct 123 ms 121668 KB Output is correct
45 Correct 67 ms 84532 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 0 ms 604 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 0 ms 604 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 616 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 15 ms 11868 KB Output is correct
62 Correct 19 ms 12896 KB Output is correct
63 Correct 5 ms 2652 KB Output is correct
64 Correct 15 ms 11680 KB Output is correct
65 Correct 24 ms 20048 KB Output is correct
66 Correct 4 ms 4700 KB Output is correct
67 Correct 18 ms 17620 KB Output is correct
68 Correct 26 ms 19284 KB Output is correct
69 Correct 19 ms 19296 KB Output is correct
70 Correct 9 ms 11100 KB Output is correct
71 Correct 27 ms 20052 KB Output is correct
72 Correct 26 ms 19548 KB Output is correct
73 Correct 6 ms 5980 KB Output is correct
74 Correct 22 ms 18304 KB Output is correct
75 Correct 6 ms 6492 KB Output is correct
76 Incorrect 615 ms 281936 KB Output isn't correct
77 Halted 0 ms 0 KB -