oj.uz

Submission #907845

# Submission time Handle Problem Language Result Execution time Memory
907845 2024-01-16T05:19:45 Z LOLOLO I want to be the very best too! (NOI17_pokemonmaster) C++17
71 / 100
 5000 ms 32724 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
 
#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) {
    while (p[a])
        a = p[a];

    return 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;

    int nm = n * m;

    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 {
                int id = cov(x[j], y[j]);
                if (change[id] == 0) {
                    up.pb(id);
                }
                change[id] = 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({t, P[t]});
                }
            }
        }
 
        sort(all(ask), [&](int a, int b) { return r[a] < r[b]; });
        for (int j = 1; j <= nm; j++) {
            mp[j].clear();
            if (change[j] == 0) {
                cc[j] = 1;
                mp[j][P[j]]++;
                sz[j] = 1;
            } else {
                sz[j] = 0;
                cc[j] = 0;
            }
 
            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[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 81 ms 23348 KB Output is correct
2 Correct 82 ms 24372 KB Output is correct
3 Correct 76 ms 24036 KB Output is correct
4 Correct 72 ms 23800 KB Output is correct
5 Correct 91 ms 24368 KB Output is correct
6 Correct 67 ms 23344 KB Output is correct
7 Correct 87 ms 24384 KB Output is correct
8 Correct 75 ms 24324 KB Output is correct
9 Correct 78 ms 24324 KB Output is correct
10 Correct 93 ms 24576 KB Output is correct
11 Correct 77 ms 24396 KB Output is correct
12 Correct 80 ms 25092 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 22784 KB Output is correct
2 Correct 75 ms 22792 KB Output is correct
3 Correct 90 ms 23044 KB Output is correct
4 Correct 90 ms 24836 KB Output is correct
5 Correct 80 ms 24056 KB Output is correct
6 Correct 87 ms 24304 KB Output is correct
7 Correct 123 ms 25340 KB Output is correct
8 Correct 140 ms 26368 KB Output is correct
9 Correct 123 ms 25552 KB Output is correct
10 Correct 141 ms 28156 KB Output is correct
11 Correct 124 ms 26872 KB Output is correct
12 Correct 136 ms 29228 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 872 ms 24096 KB Output is correct
2 Correct 1965 ms 26688 KB Output is correct
3 Correct 1456 ms 29768 KB Output is correct
4 Correct 1412 ms 31000 KB Output is correct
5 Correct 2027 ms 27900 KB Output is correct
6 Correct 869 ms 25084 KB Output is correct
7 Correct 3450 ms 29408 KB Output is correct
8 Correct 3401 ms 29272 KB Output is correct
9 Correct 3377 ms 29292 KB Output is correct
10 Correct 3231 ms 29348 KB Output is correct
11 Correct 3374 ms 29532 KB Output is correct
12 Correct 4308 ms 29508 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 23348 KB Output is correct
2 Correct 82 ms 24372 KB Output is correct
3 Correct 76 ms 24036 KB Output is correct
4 Correct 72 ms 23800 KB Output is correct
5 Correct 91 ms 24368 KB Output is correct
6 Correct 67 ms 23344 KB Output is correct
7 Correct 87 ms 24384 KB Output is correct
8 Correct 75 ms 24324 KB Output is correct
9 Correct 78 ms 24324 KB Output is correct
10 Correct 93 ms 24576 KB Output is correct
11 Correct 77 ms 24396 KB Output is correct
12 Correct 80 ms 25092 KB Output is correct
13 Correct 704 ms 23988 KB Output is correct
14 Correct 2267 ms 26368 KB Output is correct
15 Correct 1720 ms 30380 KB Output is correct
16 Correct 1424 ms 29676 KB Output is correct
17 Correct 2111 ms 26720 KB Output is correct
18 Correct 831 ms 24524 KB Output is correct
19 Correct 1805 ms 26428 KB Output is correct
20 Correct 2085 ms 26624 KB Output is correct
21 Correct 1904 ms 26424 KB Output is correct
22 Correct 2339 ms 27084 KB Output is correct
23 Correct 2175 ms 26444 KB Output is correct
24 Correct 2611 ms 27156 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 23348 KB Output is correct
2 Correct 82 ms 24372 KB Output is correct
3 Correct 76 ms 24036 KB Output is correct
4 Correct 72 ms 23800 KB Output is correct
5 Correct 91 ms 24368 KB Output is correct
6 Correct 67 ms 23344 KB Output is correct
7 Correct 87 ms 24384 KB Output is correct
8 Correct 75 ms 24324 KB Output is correct
9 Correct 78 ms 24324 KB Output is correct
10 Correct 93 ms 24576 KB Output is correct
11 Correct 77 ms 24396 KB Output is correct
12 Correct 80 ms 25092 KB Output is correct
13 Correct 81 ms 22784 KB Output is correct
14 Correct 75 ms 22792 KB Output is correct
15 Correct 90 ms 23044 KB Output is correct
16 Correct 90 ms 24836 KB Output is correct
17 Correct 80 ms 24056 KB Output is correct
18 Correct 87 ms 24304 KB Output is correct
19 Correct 123 ms 25340 KB Output is correct
20 Correct 140 ms 26368 KB Output is correct
21 Correct 123 ms 25552 KB Output is correct
22 Correct 141 ms 28156 KB Output is correct
23 Correct 124 ms 26872 KB Output is correct
24 Correct 136 ms 29228 KB Output is correct
25 Correct 872 ms 24096 KB Output is correct
26 Correct 1965 ms 26688 KB Output is correct
27 Correct 1456 ms 29768 KB Output is correct
28 Correct 1412 ms 31000 KB Output is correct
29 Correct 2027 ms 27900 KB Output is correct
30 Correct 869 ms 25084 KB Output is correct
31 Correct 3450 ms 29408 KB Output is correct
32 Correct 3401 ms 29272 KB Output is correct
33 Correct 3377 ms 29292 KB Output is correct
34 Correct 3231 ms 29348 KB Output is correct
35 Correct 3374 ms 29532 KB Output is correct
36 Correct 4308 ms 29508 KB Output is correct
37 Correct 704 ms 23988 KB Output is correct
38 Correct 2267 ms 26368 KB Output is correct
39 Correct 1720 ms 30380 KB Output is correct
40 Correct 1424 ms 29676 KB Output is correct
41 Correct 2111 ms 26720 KB Output is correct
42 Correct 831 ms 24524 KB Output is correct
43 Correct 1805 ms 26428 KB Output is correct
44 Correct 2085 ms 26624 KB Output is correct
45 Correct 1904 ms 26424 KB Output is correct
46 Correct 2339 ms 27084 KB Output is correct
47 Correct 2175 ms 26444 KB Output is correct
48 Correct 2611 ms 27156 KB Output is correct
49 Correct 856 ms 24320 KB Output is correct
50 Correct 2581 ms 26696 KB Output is correct
51 Correct 2241 ms 30164 KB Output is correct
52 Correct 1691 ms 31216 KB Output is correct
53 Correct 2165 ms 27896 KB Output is correct
54 Correct 1149 ms 26412 KB Output is correct
55 Correct 3421 ms 29332 KB Output is correct
56 Correct 4395 ms 30460 KB Output is correct
57 Correct 3881 ms 29308 KB Output is correct
58 Execution timed out 5047 ms 32724 KB Time limit exceeded
59 Halted 0 ms 0 KB -