oj.uz

답안 #1019746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019746 2024-07-11T08:33:44 Z TAhmed33 Sličnost (COI23_slicnost) C++
67 / 100
 544 ms 203628 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 <int, int> 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 <int, int> 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 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 3420 KB Output is correct
17 Correct 4 ms 3676 KB Output is correct
18 Correct 2 ms 1880 KB Output is correct
19 Correct 6 ms 4056 KB Output is correct
20 Correct 6 ms 5520 KB Output is correct
21 Correct 5 ms 5724 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 5 ms 5140 KB Output is correct
24 Correct 4 ms 5372 KB Output is correct
25 Correct 4 ms 4604 KB Output is correct
26 Correct 5 ms 5140 KB Output is correct
27 Correct 6 ms 5724 KB Output is correct
28 Correct 4 ms 4444 KB Output is correct
29 Correct 3 ms 3840 KB Output is correct
30 Correct 1 ms 1628 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 3420 KB Output is correct
17 Correct 4 ms 3676 KB Output is correct
18 Correct 2 ms 1880 KB Output is correct
19 Correct 6 ms 4056 KB Output is correct
20 Correct 6 ms 5520 KB Output is correct
21 Correct 5 ms 5724 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 5 ms 5140 KB Output is correct
24 Correct 4 ms 5372 KB Output is correct
25 Correct 4 ms 4604 KB Output is correct
26 Correct 5 ms 5140 KB Output is correct
27 Correct 6 ms 5724 KB Output is correct
28 Correct 4 ms 4444 KB Output is correct
29 Correct 3 ms 3840 KB Output is correct
30 Correct 1 ms 1628 KB Output is correct
31 Correct 110 ms 77256 KB Output is correct
32 Correct 120 ms 82004 KB Output is correct
33 Correct 33 ms 39508 KB Output is correct
34 Correct 120 ms 99408 KB Output is correct
35 Correct 194 ms 135756 KB Output is correct
36 Correct 124 ms 152916 KB Output is correct
37 Correct 46 ms 57424 KB Output is correct
38 Correct 180 ms 129368 KB Output is correct
39 Correct 119 ms 134740 KB Output is correct
40 Correct 152 ms 117996 KB Output is correct
41 Correct 178 ms 132652 KB Output is correct
42 Correct 222 ms 152400 KB Output is correct
43 Correct 141 ms 109384 KB Output is correct
44 Correct 108 ms 88148 KB Output is correct
45 Correct 53 ms 61008 KB Output is correct

Subtask #4
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 0 ms 456 KB Output is correct
25 Correct 0 ms 464 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 464 KB Output is correct
30 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 3420 KB Output is correct
17 Correct 4 ms 3676 KB Output is correct
18 Correct 2 ms 1880 KB Output is correct
19 Correct 6 ms 4056 KB Output is correct
20 Correct 6 ms 5520 KB Output is correct
21 Correct 5 ms 5724 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 5 ms 5140 KB Output is correct
24 Correct 4 ms 5372 KB Output is correct
25 Correct 4 ms 4604 KB Output is correct
26 Correct 5 ms 5140 KB Output is correct
27 Correct 6 ms 5724 KB Output is correct
28 Correct 4 ms 4444 KB Output is correct
29 Correct 3 ms 3840 KB Output is correct
30 Correct 1 ms 1628 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 600 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 0 ms 456 KB Output is correct
40 Correct 0 ms 464 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 464 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 12 ms 8540 KB Output is correct
47 Correct 14 ms 9368 KB Output is correct
48 Correct 3 ms 1884 KB Output is correct
49 Correct 13 ms 8536 KB Output is correct
50 Correct 27 ms 14428 KB Output is correct
51 Correct 3 ms 3420 KB Output is correct
52 Correct 12 ms 12892 KB Output is correct
53 Correct 26 ms 13884 KB Output is correct
54 Correct 20 ms 14168 KB Output is correct
55 Correct 7 ms 8152 KB Output is correct
56 Correct 24 ms 14684 KB Output is correct
57 Correct 20 ms 14124 KB Output is correct
58 Correct 6 ms 4440 KB Output is correct
59 Correct 20 ms 13404 KB Output is correct
60 Correct 5 ms 4956 KB Output is correct

Subtask #6
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 3420 KB Output is correct
17 Correct 4 ms 3676 KB Output is correct
18 Correct 2 ms 1880 KB Output is correct
19 Correct 6 ms 4056 KB Output is correct
20 Correct 6 ms 5520 KB Output is correct
21 Correct 5 ms 5724 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 5 ms 5140 KB Output is correct
24 Correct 4 ms 5372 KB Output is correct
25 Correct 4 ms 4604 KB Output is correct
26 Correct 5 ms 5140 KB Output is correct
27 Correct 6 ms 5724 KB Output is correct
28 Correct 4 ms 4444 KB Output is correct
29 Correct 3 ms 3840 KB Output is correct
30 Correct 1 ms 1628 KB Output is correct
31 Correct 110 ms 77256 KB Output is correct
32 Correct 120 ms 82004 KB Output is correct
33 Correct 33 ms 39508 KB Output is correct
34 Correct 120 ms 99408 KB Output is correct
35 Correct 194 ms 135756 KB Output is correct
36 Correct 124 ms 152916 KB Output is correct
37 Correct 46 ms 57424 KB Output is correct
38 Correct 180 ms 129368 KB Output is correct
39 Correct 119 ms 134740 KB Output is correct
40 Correct 152 ms 117996 KB Output is correct
41 Correct 178 ms 132652 KB Output is correct
42 Correct 222 ms 152400 KB Output is correct
43 Correct 141 ms 109384 KB Output is correct
44 Correct 108 ms 88148 KB Output is correct
45 Correct 53 ms 61008 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 604 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 600 KB Output is correct
53 Correct 1 ms 600 KB Output is correct
54 Correct 0 ms 456 KB Output is correct
55 Correct 0 ms 464 KB Output is correct
56 Correct 1 ms 600 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 464 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 12 ms 8540 KB Output is correct
62 Correct 14 ms 9368 KB Output is correct
63 Correct 3 ms 1884 KB Output is correct
64 Correct 13 ms 8536 KB Output is correct
65 Correct 27 ms 14428 KB Output is correct
66 Correct 3 ms 3420 KB Output is correct
67 Correct 12 ms 12892 KB Output is correct
68 Correct 26 ms 13884 KB Output is correct
69 Correct 20 ms 14168 KB Output is correct
70 Correct 7 ms 8152 KB Output is correct
71 Correct 24 ms 14684 KB Output is correct
72 Correct 20 ms 14124 KB Output is correct
73 Correct 6 ms 4440 KB Output is correct
74 Correct 20 ms 13404 KB Output is correct
75 Correct 5 ms 4956 KB Output is correct
76 Incorrect 544 ms 203628 KB Output isn't correct
77 Halted 0 ms 0 KB -