oj.uz

답안 #1019779

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019779 2024-07-11T08:46:40 Z TAhmed33 Sličnost (COI23_slicnost) C++
67 / 100
 1440 ms 524288 KB 
#include <bits/stdc++.h>
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)
int cnt;
vector <int> tl = {0}, tr = {0}, sum = {0};
vector <pair <ll, ll>> dp = {{0, 0}};
int new_leaf (int x) {
    cnt++; 
    dp.push_back({0, 1});
    tl.push_back(0); tr.push_back(0); sum.push_back(0);
    return cnt;
}
int new_node (int l, int r) {
    cnt++;
    dp.push_back(merge(dp[l], dp[r]));
    tl.push_back(l); tr.push_back(r);
    sum.push_back(0);
    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.push_back(tl[node]); tr.push_back(tr[node]);
        sum.push_back(sum[node]); dp.push_back(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.push_back(x); tr.push_back(y);
    dp.push_back(merge({dp[x].first + sum[node], dp[x].second}, {dp[y].first + sum[node], dp[y].second}));
    sum.push_back(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:91:19: warning: variable 'dd' set but not used [-Wunused-but-set-variable]
   91 |     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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 11 ms 7972 KB Output is correct
17 Correct 9 ms 7972 KB Output is correct
18 Correct 5 ms 4136 KB Output is correct
19 Correct 9 ms 7716 KB Output is correct
20 Correct 12 ms 8580 KB Output is correct
21 Correct 10 ms 8916 KB Output is correct
22 Correct 5 ms 4136 KB Output is correct
23 Correct 11 ms 8224 KB Output is correct
24 Correct 9 ms 8248 KB Output is correct
25 Correct 9 ms 7656 KB Output is correct
26 Correct 11 ms 8220 KB Output is correct
27 Correct 11 ms 8732 KB Output is correct
28 Correct 9 ms 7716 KB Output is correct
29 Correct 8 ms 7716 KB Output is correct
30 Correct 2 ms 2344 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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 11 ms 7972 KB Output is correct
17 Correct 9 ms 7972 KB Output is correct
18 Correct 5 ms 4136 KB Output is correct
19 Correct 9 ms 7716 KB Output is correct
20 Correct 12 ms 8580 KB Output is correct
21 Correct 10 ms 8916 KB Output is correct
22 Correct 5 ms 4136 KB Output is correct
23 Correct 11 ms 8224 KB Output is correct
24 Correct 9 ms 8248 KB Output is correct
25 Correct 9 ms 7656 KB Output is correct
26 Correct 11 ms 8220 KB Output is correct
27 Correct 11 ms 8732 KB Output is correct
28 Correct 9 ms 7716 KB Output is correct
29 Correct 8 ms 7716 KB Output is correct
30 Correct 2 ms 2344 KB Output is correct
31 Correct 238 ms 125328 KB Output is correct
32 Correct 250 ms 130724 KB Output is correct
33 Correct 79 ms 64308 KB Output is correct
34 Correct 304 ms 201536 KB Output is correct
35 Correct 418 ms 203724 KB Output is correct
36 Correct 326 ms 212420 KB Output is correct
37 Correct 125 ms 117552 KB Output is correct
38 Correct 407 ms 187392 KB Output is correct
39 Correct 301 ms 203732 KB Output is correct
40 Correct 344 ms 185024 KB Output is correct
41 Correct 390 ms 203724 KB Output is correct
42 Correct 454 ms 211864 KB Output is correct
43 Correct 316 ms 201624 KB Output is correct
44 Correct 262 ms 201564 KB Output is correct
45 Correct 132 ms 117556 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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 0 ms 604 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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 11 ms 7972 KB Output is correct
17 Correct 9 ms 7972 KB Output is correct
18 Correct 5 ms 4136 KB Output is correct
19 Correct 9 ms 7716 KB Output is correct
20 Correct 12 ms 8580 KB Output is correct
21 Correct 10 ms 8916 KB Output is correct
22 Correct 5 ms 4136 KB Output is correct
23 Correct 11 ms 8224 KB Output is correct
24 Correct 9 ms 8248 KB Output is correct
25 Correct 9 ms 7656 KB Output is correct
26 Correct 11 ms 8220 KB Output is correct
27 Correct 11 ms 8732 KB Output is correct
28 Correct 9 ms 7716 KB Output is correct
29 Correct 8 ms 7716 KB Output is correct
30 Correct 2 ms 2344 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 0 ms 604 KB Output is correct
46 Correct 25 ms 15092 KB Output is correct
47 Correct 32 ms 15236 KB Output is correct
48 Correct 5 ms 4132 KB Output is correct
49 Correct 19 ms 15012 KB Output is correct
50 Correct 42 ms 29652 KB Output is correct
51 Correct 8 ms 7716 KB Output is correct
52 Correct 33 ms 29456 KB Output is correct
53 Correct 50 ms 29456 KB Output is correct
54 Correct 36 ms 29464 KB Output is correct
55 Correct 16 ms 14880 KB Output is correct
56 Correct 46 ms 29460 KB Output is correct
57 Correct 42 ms 29468 KB Output is correct
58 Correct 11 ms 7712 KB Output is correct
59 Correct 35 ms 29468 KB Output is correct
60 Correct 10 ms 7716 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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 11 ms 7972 KB Output is correct
17 Correct 9 ms 7972 KB Output is correct
18 Correct 5 ms 4136 KB Output is correct
19 Correct 9 ms 7716 KB Output is correct
20 Correct 12 ms 8580 KB Output is correct
21 Correct 10 ms 8916 KB Output is correct
22 Correct 5 ms 4136 KB Output is correct
23 Correct 11 ms 8224 KB Output is correct
24 Correct 9 ms 8248 KB Output is correct
25 Correct 9 ms 7656 KB Output is correct
26 Correct 11 ms 8220 KB Output is correct
27 Correct 11 ms 8732 KB Output is correct
28 Correct 9 ms 7716 KB Output is correct
29 Correct 8 ms 7716 KB Output is correct
30 Correct 2 ms 2344 KB Output is correct
31 Correct 238 ms 125328 KB Output is correct
32 Correct 250 ms 130724 KB Output is correct
33 Correct 79 ms 64308 KB Output is correct
34 Correct 304 ms 201536 KB Output is correct
35 Correct 418 ms 203724 KB Output is correct
36 Correct 326 ms 212420 KB Output is correct
37 Correct 125 ms 117552 KB Output is correct
38 Correct 407 ms 187392 KB Output is correct
39 Correct 301 ms 203732 KB Output is correct
40 Correct 344 ms 185024 KB Output is correct
41 Correct 390 ms 203724 KB Output is correct
42 Correct 454 ms 211864 KB Output is correct
43 Correct 316 ms 201624 KB Output is correct
44 Correct 262 ms 201564 KB Output is correct
45 Correct 132 ms 117556 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 0 ms 604 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 0 ms 604 KB Output is correct
61 Correct 25 ms 15092 KB Output is correct
62 Correct 32 ms 15236 KB Output is correct
63 Correct 5 ms 4132 KB Output is correct
64 Correct 19 ms 15012 KB Output is correct
65 Correct 42 ms 29652 KB Output is correct
66 Correct 8 ms 7716 KB Output is correct
67 Correct 33 ms 29456 KB Output is correct
68 Correct 50 ms 29456 KB Output is correct
69 Correct 36 ms 29464 KB Output is correct
70 Correct 16 ms 14880 KB Output is correct
71 Correct 46 ms 29460 KB Output is correct
72 Correct 42 ms 29468 KB Output is correct
73 Correct 11 ms 7712 KB Output is correct
74 Correct 35 ms 29468 KB Output is correct
75 Correct 10 ms 7716 KB Output is correct
76 Correct 1029 ms 369120 KB Output is correct
77 Correct 1095 ms 368732 KB Output is correct
78 Correct 96 ms 65512 KB Output is correct
79 Correct 856 ms 366756 KB Output is correct
80 Runtime error 1440 ms 524288 KB Execution killed with signal 9
81 Halted 0 ms 0 KB -