oj.uz

Submission #907489

# Submission time Handle Problem Language Result Execution time Memory
907489 2024-01-15T17:39:36 Z LOLOLO I want to be the very best too! (NOI17_pokemonmaster) C++17
71 / 100
 5000 ms 37292 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int M = 1e5 + 100;
const int N = M;
const int SZ = 1000;
int t[N], x[N], l[N], r[N], n, m, change[M], L[M], P[M], sz[N], y[N], p[N], C[N], ans[N];
vector <pair <int, int>> save[M];

int cov(int a, int b) {
    return (a - 1) * m + b;
}

int get(int a) {
    if (p[a] == 0)
        return a;

    return p[a] = get(p[a]);
}

int cc[N];
unordered_map <int, int> mp[N];

void unite(int a, int b) {
    a = get(a), b = get(b);
    if (a == b)
        return;

    if (sz[a] < sz[b])
        swap(a, b);

    sz[a] += sz[b];
    p[b] = a;

    for (auto &x : mp[b]) {
        int &t = mp[a][x.f];
        if (t == 0 && x.s)
            cc[a]++;

        t += x.s;
    }
}

vector <vector <int>> action;

void upd(int c, int x) {
    c = get(c);

    int &t = mp[c][x];
    if (t == 0)
        cc[c]++;

    action.pb({c, x, t});
    t++;
}

void rollback() {
    while (sz(action)) {
        auto t = action.back();
        action.pop_back();
        if (t[2] == 0) {
            cc[t[0]]--;
        }

        mp[t[0]][t[1]] = t[2];
    }
}

ll solve() {
    mem(L, 0x3f);
    mem(P, 0x3f);

    int q;
    cin >> n >> m >> q;

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> L[cov(i, j)];

    vector <vector <int>> edge;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (i < n)
                edge.pb({max(L[cov(i + 1, j)], L[cov(i, j)]), cov(i + 1, j), cov(i, j)});

            if (j < m)
                edge.pb({max(L[cov(i, j + 1)], L[cov(i, j)]), cov(i, j + 1), cov(i, j)});
        }
    }

    sort(all(edge), [&](vector <int> a, vector <int> b) { return a[0] < b[0]; });
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> P[cov(i, j)];

    for (int i = 1; i <= q; i++) {
        cin >> t[i] >> y[i] >> x[i] >> r[i];
    }

    for (int i = 1; i <= q; i += SZ) {
        int X = i, Y = min(q, i + SZ - 1);
        vector <int> ask, up;
        for (int j = X; j <= Y; j++) {
            if (t[j] == 2) {
                ask.pb(j);
            } else {
                up.pb(j);
                change[cov(x[j], y[j])] = 1;
            }
        }

        for (int j = X; j <= Y; j++) {
            if (t[j] == 1) {
                P[cov(x[j], y[j])] = r[j];
            } else {
                save[j - X].clear();
                for (auto t : up) {
                    save[j - X].pb({cov(x[t], y[t]), P[cov(x[t], y[t])]});
                }
            }
        }

        sort(all(ask), [&](int a, int b) { return r[a] < r[b]; });
        for (int j = 1; j <= n * m; j++) {
            mp[j].clear();
            if (change[j] == 0) {
                cc[j] = 1;
                mp[j][P[j]]++;
            } else {
                cc[j] = 0;
            }

            sz[j] = 1;
            p[j] = 0;
        }

        int j = 0;
        for (auto id : ask) {
            while (j < sz(edge) && r[id] >= edge[j][0]) {
                unite(edge[j][1], edge[j][2]);
                j++;
            }

            for (auto t : save[id - X]) {
                upd(t.f, t.s);
            }

            if (r[id] >= L[cov(x[id], y[id])])
                ans[id] = cc[get(cov(x[id], y[id]))];

            rollback();
        }

        for (auto id : up)
            change[cov(x[id], y[id])] = 0;
    }

    for (int i = 1; i <= q; i++) {
        if (t[i] == 2) {
            cout << ans[i] << "\n";
        }
    }

    return 0;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;

    while (t--) {
        solve();
        //cout << solve() << '\n';
    }

    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 23560 KB Output is correct
2 Correct 67 ms 24640 KB Output is correct
3 Correct 61 ms 24328 KB Output is correct
4 Correct 58 ms 24064 KB Output is correct
5 Correct 70 ms 24624 KB Output is correct
6 Correct 54 ms 23812 KB Output is correct
7 Correct 64 ms 24576 KB Output is correct
8 Correct 67 ms 24576 KB Output is correct
9 Correct 67 ms 24584 KB Output is correct
10 Correct 76 ms 25388 KB Output is correct
11 Correct 67 ms 24628 KB Output is correct
12 Correct 74 ms 25348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 22596 KB Output is correct
2 Correct 58 ms 22788 KB Output is correct
3 Correct 58 ms 23044 KB Output is correct
4 Correct 62 ms 24060 KB Output is correct
5 Correct 66 ms 24056 KB Output is correct
6 Correct 68 ms 24100 KB Output is correct
7 Correct 98 ms 25992 KB Output is correct
8 Correct 107 ms 26304 KB Output is correct
9 Correct 88 ms 25460 KB Output is correct
10 Correct 121 ms 28156 KB Output is correct
11 Correct 106 ms 27052 KB Output is correct
12 Correct 111 ms 29636 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 773 ms 24276 KB Output is correct
2 Correct 2339 ms 31776 KB Output is correct
3 Correct 1521 ms 31580 KB Output is correct
4 Correct 1565 ms 32816 KB Output is correct
5 Correct 2340 ms 32848 KB Output is correct
6 Correct 794 ms 26028 KB Output is correct
7 Correct 3212 ms 34788 KB Output is correct
8 Correct 3239 ms 34432 KB Output is correct
9 Correct 3372 ms 34804 KB Output is correct
10 Correct 3331 ms 34956 KB Output is correct
11 Correct 3274 ms 35612 KB Output is correct
12 Correct 3336 ms 34664 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 23560 KB Output is correct
2 Correct 67 ms 24640 KB Output is correct
3 Correct 61 ms 24328 KB Output is correct
4 Correct 58 ms 24064 KB Output is correct
5 Correct 70 ms 24624 KB Output is correct
6 Correct 54 ms 23812 KB Output is correct
7 Correct 64 ms 24576 KB Output is correct
8 Correct 67 ms 24576 KB Output is correct
9 Correct 67 ms 24584 KB Output is correct
10 Correct 76 ms 25388 KB Output is correct
11 Correct 67 ms 24628 KB Output is correct
12 Correct 74 ms 25348 KB Output is correct
13 Correct 736 ms 24196 KB Output is correct
14 Correct 2571 ms 31864 KB Output is correct
15 Correct 2004 ms 31644 KB Output is correct
16 Correct 1635 ms 31276 KB Output is correct
17 Correct 2565 ms 31732 KB Output is correct
18 Correct 842 ms 24700 KB Output is correct
19 Correct 2130 ms 31860 KB Output is correct
20 Correct 2530 ms 31720 KB Output is correct
21 Correct 2213 ms 31792 KB Output is correct
22 Correct 2841 ms 31816 KB Output is correct
23 Correct 2604 ms 31720 KB Output is correct
24 Correct 3075 ms 32524 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 23560 KB Output is correct
2 Correct 67 ms 24640 KB Output is correct
3 Correct 61 ms 24328 KB Output is correct
4 Correct 58 ms 24064 KB Output is correct
5 Correct 70 ms 24624 KB Output is correct
6 Correct 54 ms 23812 KB Output is correct
7 Correct 64 ms 24576 KB Output is correct
8 Correct 67 ms 24576 KB Output is correct
9 Correct 67 ms 24584 KB Output is correct
10 Correct 76 ms 25388 KB Output is correct
11 Correct 67 ms 24628 KB Output is correct
12 Correct 74 ms 25348 KB Output is correct
13 Correct 56 ms 22596 KB Output is correct
14 Correct 58 ms 22788 KB Output is correct
15 Correct 58 ms 23044 KB Output is correct
16 Correct 62 ms 24060 KB Output is correct
17 Correct 66 ms 24056 KB Output is correct
18 Correct 68 ms 24100 KB Output is correct
19 Correct 98 ms 25992 KB Output is correct
20 Correct 107 ms 26304 KB Output is correct
21 Correct 88 ms 25460 KB Output is correct
22 Correct 121 ms 28156 KB Output is correct
23 Correct 106 ms 27052 KB Output is correct
24 Correct 111 ms 29636 KB Output is correct
25 Correct 773 ms 24276 KB Output is correct
26 Correct 2339 ms 31776 KB Output is correct
27 Correct 1521 ms 31580 KB Output is correct
28 Correct 1565 ms 32816 KB Output is correct
29 Correct 2340 ms 32848 KB Output is correct
30 Correct 794 ms 26028 KB Output is correct
31 Correct 3212 ms 34788 KB Output is correct
32 Correct 3239 ms 34432 KB Output is correct
33 Correct 3372 ms 34804 KB Output is correct
34 Correct 3331 ms 34956 KB Output is correct
35 Correct 3274 ms 35612 KB Output is correct
36 Correct 3336 ms 34664 KB Output is correct
37 Correct 736 ms 24196 KB Output is correct
38 Correct 2571 ms 31864 KB Output is correct
39 Correct 2004 ms 31644 KB Output is correct
40 Correct 1635 ms 31276 KB Output is correct
41 Correct 2565 ms 31732 KB Output is correct
42 Correct 842 ms 24700 KB Output is correct
43 Correct 2130 ms 31860 KB Output is correct
44 Correct 2530 ms 31720 KB Output is correct
45 Correct 2213 ms 31792 KB Output is correct
46 Correct 2841 ms 31816 KB Output is correct
47 Correct 2604 ms 31720 KB Output is correct
48 Correct 3075 ms 32524 KB Output is correct
49 Correct 895 ms 24312 KB Output is correct
50 Correct 2820 ms 32156 KB Output is correct
51 Correct 2293 ms 31936 KB Output is correct
52 Correct 1776 ms 32644 KB Output is correct
53 Correct 2790 ms 33932 KB Output is correct
54 Correct 1063 ms 25864 KB Output is correct
55 Correct 3237 ms 35288 KB Output is correct
56 Correct 4373 ms 35460 KB Output is correct
57 Correct 3356 ms 34484 KB Output is correct
58 Execution timed out 5040 ms 37292 KB Time limit exceeded
59 Halted 0 ms 0 KB -