oj.uz

Submission #907472

# Submission time Handle Problem Language Result Execution time Memory
907472 2024-01-15T17:16:42 Z LOLOLO I want to be the very best too! (NOI17_pokemonmaster) C++17
71 / 100
 5000 ms 30640 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 = 700;
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));
    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 35 ms 23056 KB Output is correct
2 Correct 40 ms 24368 KB Output is correct
3 Correct 37 ms 23824 KB Output is correct
4 Correct 32 ms 23824 KB Output is correct
5 Correct 40 ms 24336 KB Output is correct
6 Correct 31 ms 23300 KB Output is correct
7 Correct 37 ms 24336 KB Output is correct
8 Correct 47 ms 24324 KB Output is correct
9 Correct 43 ms 24076 KB Output is correct
10 Correct 42 ms 24336 KB Output is correct
11 Correct 41 ms 24192 KB Output is correct
12 Correct 45 ms 24836 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 22544 KB Output is correct
2 Correct 29 ms 22616 KB Output is correct
3 Correct 28 ms 23040 KB Output is correct
4 Correct 29 ms 24320 KB Output is correct
5 Correct 37 ms 25100 KB Output is correct
6 Correct 32 ms 23864 KB Output is correct
7 Correct 44 ms 25340 KB Output is correct
8 Correct 56 ms 26360 KB Output is correct
9 Correct 46 ms 25348 KB Output is correct
10 Correct 85 ms 28804 KB Output is correct
11 Correct 55 ms 27136 KB Output is correct
12 Correct 72 ms 29180 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 760 ms 24076 KB Output is correct
2 Correct 2005 ms 26048 KB Output is correct
3 Correct 1483 ms 29180 KB Output is correct
4 Correct 1547 ms 30144 KB Output is correct
5 Correct 2149 ms 27872 KB Output is correct
6 Correct 848 ms 25596 KB Output is correct
7 Correct 3627 ms 28864 KB Output is correct
8 Correct 3953 ms 29596 KB Output is correct
9 Correct 3709 ms 29268 KB Output is correct
10 Correct 3752 ms 28888 KB Output is correct
11 Correct 3960 ms 29416 KB Output is correct
12 Correct 3944 ms 28960 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 23056 KB Output is correct
2 Correct 40 ms 24368 KB Output is correct
3 Correct 37 ms 23824 KB Output is correct
4 Correct 32 ms 23824 KB Output is correct
5 Correct 40 ms 24336 KB Output is correct
6 Correct 31 ms 23300 KB Output is correct
7 Correct 37 ms 24336 KB Output is correct
8 Correct 47 ms 24324 KB Output is correct
9 Correct 43 ms 24076 KB Output is correct
10 Correct 42 ms 24336 KB Output is correct
11 Correct 41 ms 24192 KB Output is correct
12 Correct 45 ms 24836 KB Output is correct
13 Correct 877 ms 23532 KB Output is correct
14 Correct 2396 ms 26120 KB Output is correct
15 Correct 2032 ms 29096 KB Output is correct
16 Correct 1805 ms 28836 KB Output is correct
17 Correct 2460 ms 26032 KB Output is correct
18 Correct 975 ms 24388 KB Output is correct
19 Correct 2009 ms 26004 KB Output is correct
20 Correct 2434 ms 26048 KB Output is correct
21 Correct 2105 ms 26016 KB Output is correct
22 Correct 2839 ms 26272 KB Output is correct
23 Correct 2468 ms 26036 KB Output is correct
24 Correct 2968 ms 26748 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 23056 KB Output is correct
2 Correct 40 ms 24368 KB Output is correct
3 Correct 37 ms 23824 KB Output is correct
4 Correct 32 ms 23824 KB Output is correct
5 Correct 40 ms 24336 KB Output is correct
6 Correct 31 ms 23300 KB Output is correct
7 Correct 37 ms 24336 KB Output is correct
8 Correct 47 ms 24324 KB Output is correct
9 Correct 43 ms 24076 KB Output is correct
10 Correct 42 ms 24336 KB Output is correct
11 Correct 41 ms 24192 KB Output is correct
12 Correct 45 ms 24836 KB Output is correct
13 Correct 26 ms 22544 KB Output is correct
14 Correct 29 ms 22616 KB Output is correct
15 Correct 28 ms 23040 KB Output is correct
16 Correct 29 ms 24320 KB Output is correct
17 Correct 37 ms 25100 KB Output is correct
18 Correct 32 ms 23864 KB Output is correct
19 Correct 44 ms 25340 KB Output is correct
20 Correct 56 ms 26360 KB Output is correct
21 Correct 46 ms 25348 KB Output is correct
22 Correct 85 ms 28804 KB Output is correct
23 Correct 55 ms 27136 KB Output is correct
24 Correct 72 ms 29180 KB Output is correct
25 Correct 760 ms 24076 KB Output is correct
26 Correct 2005 ms 26048 KB Output is correct
27 Correct 1483 ms 29180 KB Output is correct
28 Correct 1547 ms 30144 KB Output is correct
29 Correct 2149 ms 27872 KB Output is correct
30 Correct 848 ms 25596 KB Output is correct
31 Correct 3627 ms 28864 KB Output is correct
32 Correct 3953 ms 29596 KB Output is correct
33 Correct 3709 ms 29268 KB Output is correct
34 Correct 3752 ms 28888 KB Output is correct
35 Correct 3960 ms 29416 KB Output is correct
36 Correct 3944 ms 28960 KB Output is correct
37 Correct 877 ms 23532 KB Output is correct
38 Correct 2396 ms 26120 KB Output is correct
39 Correct 2032 ms 29096 KB Output is correct
40 Correct 1805 ms 28836 KB Output is correct
41 Correct 2460 ms 26032 KB Output is correct
42 Correct 975 ms 24388 KB Output is correct
43 Correct 2009 ms 26004 KB Output is correct
44 Correct 2434 ms 26048 KB Output is correct
45 Correct 2105 ms 26016 KB Output is correct
46 Correct 2839 ms 26272 KB Output is correct
47 Correct 2468 ms 26036 KB Output is correct
48 Correct 2968 ms 26748 KB Output is correct
49 Correct 966 ms 24068 KB Output is correct
50 Correct 2635 ms 26116 KB Output is correct
51 Correct 2242 ms 29160 KB Output is correct
52 Correct 1737 ms 30640 KB Output is correct
53 Correct 2685 ms 27884 KB Output is correct
54 Correct 1259 ms 25524 KB Output is correct
55 Correct 3760 ms 28696 KB Output is correct
56 Execution timed out 5008 ms 30480 KB Time limit exceeded
57 Halted 0 ms 0 KB -