oj.uz

Submission #907807

# Submission time Handle Problem Language Result Execution time Memory
907807 2024-01-16T04:55:11 Z LOLOLO I want to be the very best too! (NOI17_pokemonmaster) C++17
71 / 100
 5000 ms 33792 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 = 800;
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 23300 KB Output is correct
2 Correct 64 ms 24324 KB Output is correct
3 Correct 59 ms 24136 KB Output is correct
4 Correct 62 ms 23872 KB Output is correct
5 Correct 60 ms 24328 KB Output is correct
6 Correct 56 ms 23304 KB Output is correct
7 Correct 60 ms 24388 KB Output is correct
8 Correct 69 ms 24332 KB Output is correct
9 Correct 69 ms 24580 KB Output is correct
10 Correct 67 ms 24636 KB Output is correct
11 Correct 64 ms 24320 KB Output is correct
12 Correct 67 ms 25104 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 22592 KB Output is correct
2 Correct 58 ms 22788 KB Output is correct
3 Correct 61 ms 23048 KB Output is correct
4 Correct 62 ms 23924 KB Output is correct
5 Correct 64 ms 24832 KB Output is correct
6 Correct 66 ms 24828 KB Output is correct
7 Correct 104 ms 25600 KB Output is correct
8 Correct 98 ms 26364 KB Output is correct
9 Correct 93 ms 25340 KB Output is correct
10 Correct 126 ms 28152 KB Output is correct
11 Correct 116 ms 27132 KB Output is correct
12 Correct 115 ms 29360 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 730 ms 24116 KB Output is correct
2 Correct 2037 ms 27908 KB Output is correct
3 Correct 1421 ms 31216 KB Output is correct
4 Correct 1546 ms 32272 KB Output is correct
5 Correct 2021 ms 30256 KB Output is correct
6 Correct 801 ms 28184 KB Output is correct
7 Correct 3262 ms 30536 KB Output is correct
8 Correct 3230 ms 30552 KB Output is correct
9 Correct 3017 ms 30464 KB Output is correct
10 Correct 3121 ms 31232 KB Output is correct
11 Correct 3313 ms 30560 KB Output is correct
12 Correct 3290 ms 31176 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 23300 KB Output is correct
2 Correct 64 ms 24324 KB Output is correct
3 Correct 59 ms 24136 KB Output is correct
4 Correct 62 ms 23872 KB Output is correct
5 Correct 60 ms 24328 KB Output is correct
6 Correct 56 ms 23304 KB Output is correct
7 Correct 60 ms 24388 KB Output is correct
8 Correct 69 ms 24332 KB Output is correct
9 Correct 69 ms 24580 KB Output is correct
10 Correct 67 ms 24636 KB Output is correct
11 Correct 64 ms 24320 KB Output is correct
12 Correct 67 ms 25104 KB Output is correct
13 Correct 705 ms 24104 KB Output is correct
14 Correct 2259 ms 27716 KB Output is correct
15 Correct 1818 ms 31284 KB Output is correct
16 Correct 1483 ms 31172 KB Output is correct
17 Correct 2147 ms 27712 KB Output is correct
18 Correct 862 ms 25776 KB Output is correct
19 Correct 1826 ms 27696 KB Output is correct
20 Correct 2113 ms 27716 KB Output is correct
21 Correct 1929 ms 27820 KB Output is correct
22 Correct 2465 ms 27956 KB Output is correct
23 Correct 2225 ms 27724 KB Output is correct
24 Correct 2602 ms 28484 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 23300 KB Output is correct
2 Correct 64 ms 24324 KB Output is correct
3 Correct 59 ms 24136 KB Output is correct
4 Correct 62 ms 23872 KB Output is correct
5 Correct 60 ms 24328 KB Output is correct
6 Correct 56 ms 23304 KB Output is correct
7 Correct 60 ms 24388 KB Output is correct
8 Correct 69 ms 24332 KB Output is correct
9 Correct 69 ms 24580 KB Output is correct
10 Correct 67 ms 24636 KB Output is correct
11 Correct 64 ms 24320 KB Output is correct
12 Correct 67 ms 25104 KB Output is correct
13 Correct 56 ms 22592 KB Output is correct
14 Correct 58 ms 22788 KB Output is correct
15 Correct 61 ms 23048 KB Output is correct
16 Correct 62 ms 23924 KB Output is correct
17 Correct 64 ms 24832 KB Output is correct
18 Correct 66 ms 24828 KB Output is correct
19 Correct 104 ms 25600 KB Output is correct
20 Correct 98 ms 26364 KB Output is correct
21 Correct 93 ms 25340 KB Output is correct
22 Correct 126 ms 28152 KB Output is correct
23 Correct 116 ms 27132 KB Output is correct
24 Correct 115 ms 29360 KB Output is correct
25 Correct 730 ms 24116 KB Output is correct
26 Correct 2037 ms 27908 KB Output is correct
27 Correct 1421 ms 31216 KB Output is correct
28 Correct 1546 ms 32272 KB Output is correct
29 Correct 2021 ms 30256 KB Output is correct
30 Correct 801 ms 28184 KB Output is correct
31 Correct 3262 ms 30536 KB Output is correct
32 Correct 3230 ms 30552 KB Output is correct
33 Correct 3017 ms 30464 KB Output is correct
34 Correct 3121 ms 31232 KB Output is correct
35 Correct 3313 ms 30560 KB Output is correct
36 Correct 3290 ms 31176 KB Output is correct
37 Correct 705 ms 24104 KB Output is correct
38 Correct 2259 ms 27716 KB Output is correct
39 Correct 1818 ms 31284 KB Output is correct
40 Correct 1483 ms 31172 KB Output is correct
41 Correct 2147 ms 27712 KB Output is correct
42 Correct 862 ms 25776 KB Output is correct
43 Correct 1826 ms 27696 KB Output is correct
44 Correct 2113 ms 27716 KB Output is correct
45 Correct 1929 ms 27820 KB Output is correct
46 Correct 2465 ms 27956 KB Output is correct
47 Correct 2225 ms 27724 KB Output is correct
48 Correct 2602 ms 28484 KB Output is correct
49 Correct 933 ms 25660 KB Output is correct
50 Correct 2490 ms 28612 KB Output is correct
51 Correct 1917 ms 31612 KB Output is correct
52 Correct 1579 ms 33792 KB Output is correct
53 Correct 2497 ms 29408 KB Output is correct
54 Correct 1048 ms 28252 KB Output is correct
55 Correct 3213 ms 30636 KB Output is correct
56 Correct 4786 ms 32068 KB Output is correct
57 Correct 3884 ms 30832 KB Output is correct
58 Execution timed out 5049 ms 33496 KB Time limit exceeded
59 Halted 0 ms 0 KB -