oj.uz

Submission #907475

# Submission time Handle Problem Language Result Execution time Memory
907475 2024-01-15T17:22:14 Z LOLOLO I want to be the very best too! (NOI17_pokemonmaster) C++17
71 / 100
 5000 ms 35288 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) {
    return p[a] ? get(p[a]) : 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]) {
        if (mp[a][x.f] == 0 && x.s)
            cc[a]++;
        mp[a][x.f] += x.s;
    }
}

vector <vector <int>> action;

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

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

    action.pb({c, x, mp[c][x]});
    mp[c][x]++;
}

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 63 ms 23552 KB Output is correct
2 Correct 72 ms 24836 KB Output is correct
3 Correct 68 ms 24328 KB Output is correct
4 Correct 63 ms 24072 KB Output is correct
5 Correct 73 ms 24580 KB Output is correct
6 Correct 57 ms 23944 KB Output is correct
7 Correct 73 ms 24580 KB Output is correct
8 Correct 73 ms 24580 KB Output is correct
9 Correct 79 ms 24632 KB Output is correct
10 Correct 81 ms 25096 KB Output is correct
11 Correct 76 ms 24584 KB Output is correct
12 Correct 81 ms 25352 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 22584 KB Output is correct
2 Correct 61 ms 22788 KB Output is correct
3 Correct 62 ms 23040 KB Output is correct
4 Correct 67 ms 24056 KB Output is correct
5 Correct 72 ms 24832 KB Output is correct
6 Correct 75 ms 24056 KB Output is correct
7 Correct 99 ms 25280 KB Output is correct
8 Correct 110 ms 26360 KB Output is correct
9 Correct 98 ms 25592 KB Output is correct
10 Correct 137 ms 28364 KB Output is correct
11 Correct 119 ms 26876 KB Output is correct
12 Correct 116 ms 29436 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 862 ms 24384 KB Output is correct
2 Correct 2486 ms 31752 KB Output is correct
3 Correct 1760 ms 31348 KB Output is correct
4 Correct 1792 ms 32596 KB Output is correct
5 Correct 2476 ms 33440 KB Output is correct
6 Correct 875 ms 25308 KB Output is correct
7 Correct 4054 ms 34556 KB Output is correct
8 Correct 4296 ms 34528 KB Output is correct
9 Correct 3874 ms 34620 KB Output is correct
10 Correct 3830 ms 34960 KB Output is correct
11 Correct 4646 ms 34584 KB Output is correct
12 Correct 4691 ms 34992 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 23552 KB Output is correct
2 Correct 72 ms 24836 KB Output is correct
3 Correct 68 ms 24328 KB Output is correct
4 Correct 63 ms 24072 KB Output is correct
5 Correct 73 ms 24580 KB Output is correct
6 Correct 57 ms 23944 KB Output is correct
7 Correct 73 ms 24580 KB Output is correct
8 Correct 73 ms 24580 KB Output is correct
9 Correct 79 ms 24632 KB Output is correct
10 Correct 81 ms 25096 KB Output is correct
11 Correct 76 ms 24584 KB Output is correct
12 Correct 81 ms 25352 KB Output is correct
13 Correct 988 ms 24200 KB Output is correct
14 Correct 3114 ms 31768 KB Output is correct
15 Correct 3038 ms 31532 KB Output is correct
16 Correct 2097 ms 31504 KB Output is correct
17 Correct 3093 ms 31652 KB Output is correct
18 Correct 953 ms 24912 KB Output is correct
19 Correct 2544 ms 31696 KB Output is correct
20 Correct 3221 ms 31484 KB Output is correct
21 Correct 2925 ms 31692 KB Output is correct
22 Correct 3875 ms 31760 KB Output is correct
23 Correct 3516 ms 31692 KB Output is correct
24 Correct 4062 ms 32472 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 23552 KB Output is correct
2 Correct 72 ms 24836 KB Output is correct
3 Correct 68 ms 24328 KB Output is correct
4 Correct 63 ms 24072 KB Output is correct
5 Correct 73 ms 24580 KB Output is correct
6 Correct 57 ms 23944 KB Output is correct
7 Correct 73 ms 24580 KB Output is correct
8 Correct 73 ms 24580 KB Output is correct
9 Correct 79 ms 24632 KB Output is correct
10 Correct 81 ms 25096 KB Output is correct
11 Correct 76 ms 24584 KB Output is correct
12 Correct 81 ms 25352 KB Output is correct
13 Correct 64 ms 22584 KB Output is correct
14 Correct 61 ms 22788 KB Output is correct
15 Correct 62 ms 23040 KB Output is correct
16 Correct 67 ms 24056 KB Output is correct
17 Correct 72 ms 24832 KB Output is correct
18 Correct 75 ms 24056 KB Output is correct
19 Correct 99 ms 25280 KB Output is correct
20 Correct 110 ms 26360 KB Output is correct
21 Correct 98 ms 25592 KB Output is correct
22 Correct 137 ms 28364 KB Output is correct
23 Correct 119 ms 26876 KB Output is correct
24 Correct 116 ms 29436 KB Output is correct
25 Correct 862 ms 24384 KB Output is correct
26 Correct 2486 ms 31752 KB Output is correct
27 Correct 1760 ms 31348 KB Output is correct
28 Correct 1792 ms 32596 KB Output is correct
29 Correct 2476 ms 33440 KB Output is correct
30 Correct 875 ms 25308 KB Output is correct
31 Correct 4054 ms 34556 KB Output is correct
32 Correct 4296 ms 34528 KB Output is correct
33 Correct 3874 ms 34620 KB Output is correct
34 Correct 3830 ms 34960 KB Output is correct
35 Correct 4646 ms 34584 KB Output is correct
36 Correct 4691 ms 34992 KB Output is correct
37 Correct 988 ms 24200 KB Output is correct
38 Correct 3114 ms 31768 KB Output is correct
39 Correct 3038 ms 31532 KB Output is correct
40 Correct 2097 ms 31504 KB Output is correct
41 Correct 3093 ms 31652 KB Output is correct
42 Correct 953 ms 24912 KB Output is correct
43 Correct 2544 ms 31696 KB Output is correct
44 Correct 3221 ms 31484 KB Output is correct
45 Correct 2925 ms 31692 KB Output is correct
46 Correct 3875 ms 31760 KB Output is correct
47 Correct 3516 ms 31692 KB Output is correct
48 Correct 4062 ms 32472 KB Output is correct
49 Correct 1139 ms 24312 KB Output is correct
50 Correct 3624 ms 32136 KB Output is correct
51 Correct 3456 ms 31732 KB Output is correct
52 Correct 2251 ms 33620 KB Output is correct
53 Correct 3192 ms 34132 KB Output is correct
54 Correct 1219 ms 27108 KB Output is correct
55 Correct 3961 ms 34440 KB Output is correct
56 Execution timed out 5009 ms 35288 KB Time limit exceeded
57 Halted 0 ms 0 KB -