oj.uz

답안 #907808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
907808 2024-01-16T04:56:30 Z LOLOLO I want to be the very best too! (NOI17_pokemonmaster) C++17
71 / 100
 5000 ms 31968 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) {
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 23288 KB Output is correct
2 Correct 86 ms 24456 KB Output is correct
3 Correct 72 ms 24124 KB Output is correct
4 Correct 72 ms 23808 KB Output is correct
5 Correct 76 ms 24304 KB Output is correct
6 Correct 78 ms 23280 KB Output is correct
7 Correct 74 ms 24324 KB Output is correct
8 Correct 79 ms 24576 KB Output is correct
9 Correct 77 ms 24320 KB Output is correct
10 Correct 85 ms 24576 KB Output is correct
11 Correct 75 ms 24364 KB Output is correct
12 Correct 83 ms 25148 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 22788 KB Output is correct
2 Correct 73 ms 22640 KB Output is correct
3 Correct 75 ms 23088 KB Output is correct
4 Correct 79 ms 24064 KB Output is correct
5 Correct 96 ms 24060 KB Output is correct
6 Correct 85 ms 24060 KB Output is correct
7 Correct 106 ms 25908 KB Output is correct
8 Correct 118 ms 26364 KB Output is correct
9 Correct 114 ms 25548 KB Output is correct
10 Correct 140 ms 28672 KB Output is correct
11 Correct 128 ms 27088 KB Output is correct
12 Correct 156 ms 29176 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 815 ms 24096 KB Output is correct
2 Correct 2154 ms 26504 KB Output is correct
3 Correct 1554 ms 29700 KB Output is correct
4 Correct 1475 ms 31708 KB Output is correct
5 Correct 2068 ms 27820 KB Output is correct
6 Correct 845 ms 25852 KB Output is correct
7 Correct 3132 ms 29536 KB Output is correct
8 Correct 3263 ms 29496 KB Output is correct
9 Correct 3684 ms 29816 KB Output is correct
10 Correct 3942 ms 29724 KB Output is correct
11 Correct 4130 ms 29276 KB Output is correct
12 Correct 3625 ms 29256 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 23288 KB Output is correct
2 Correct 86 ms 24456 KB Output is correct
3 Correct 72 ms 24124 KB Output is correct
4 Correct 72 ms 23808 KB Output is correct
5 Correct 76 ms 24304 KB Output is correct
6 Correct 78 ms 23280 KB Output is correct
7 Correct 74 ms 24324 KB Output is correct
8 Correct 79 ms 24576 KB Output is correct
9 Correct 77 ms 24320 KB Output is correct
10 Correct 85 ms 24576 KB Output is correct
11 Correct 75 ms 24364 KB Output is correct
12 Correct 83 ms 25148 KB Output is correct
13 Correct 780 ms 23996 KB Output is correct
14 Correct 2218 ms 26436 KB Output is correct
15 Correct 1874 ms 30156 KB Output is correct
16 Correct 1663 ms 29852 KB Output is correct
17 Correct 2242 ms 26436 KB Output is correct
18 Correct 974 ms 24712 KB Output is correct
19 Correct 1900 ms 26608 KB Output is correct
20 Correct 2172 ms 26432 KB Output is correct
21 Correct 2019 ms 26424 KB Output is correct
22 Correct 2573 ms 26680 KB Output is correct
23 Correct 2314 ms 26448 KB Output is correct
24 Correct 2603 ms 27156 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 23288 KB Output is correct
2 Correct 86 ms 24456 KB Output is correct
3 Correct 72 ms 24124 KB Output is correct
4 Correct 72 ms 23808 KB Output is correct
5 Correct 76 ms 24304 KB Output is correct
6 Correct 78 ms 23280 KB Output is correct
7 Correct 74 ms 24324 KB Output is correct
8 Correct 79 ms 24576 KB Output is correct
9 Correct 77 ms 24320 KB Output is correct
10 Correct 85 ms 24576 KB Output is correct
11 Correct 75 ms 24364 KB Output is correct
12 Correct 83 ms 25148 KB Output is correct
13 Correct 65 ms 22788 KB Output is correct
14 Correct 73 ms 22640 KB Output is correct
15 Correct 75 ms 23088 KB Output is correct
16 Correct 79 ms 24064 KB Output is correct
17 Correct 96 ms 24060 KB Output is correct
18 Correct 85 ms 24060 KB Output is correct
19 Correct 106 ms 25908 KB Output is correct
20 Correct 118 ms 26364 KB Output is correct
21 Correct 114 ms 25548 KB Output is correct
22 Correct 140 ms 28672 KB Output is correct
23 Correct 128 ms 27088 KB Output is correct
24 Correct 156 ms 29176 KB Output is correct
25 Correct 815 ms 24096 KB Output is correct
26 Correct 2154 ms 26504 KB Output is correct
27 Correct 1554 ms 29700 KB Output is correct
28 Correct 1475 ms 31708 KB Output is correct
29 Correct 2068 ms 27820 KB Output is correct
30 Correct 845 ms 25852 KB Output is correct
31 Correct 3132 ms 29536 KB Output is correct
32 Correct 3263 ms 29496 KB Output is correct
33 Correct 3684 ms 29816 KB Output is correct
34 Correct 3942 ms 29724 KB Output is correct
35 Correct 4130 ms 29276 KB Output is correct
36 Correct 3625 ms 29256 KB Output is correct
37 Correct 780 ms 23996 KB Output is correct
38 Correct 2218 ms 26436 KB Output is correct
39 Correct 1874 ms 30156 KB Output is correct
40 Correct 1663 ms 29852 KB Output is correct
41 Correct 2242 ms 26436 KB Output is correct
42 Correct 974 ms 24712 KB Output is correct
43 Correct 1900 ms 26608 KB Output is correct
44 Correct 2172 ms 26432 KB Output is correct
45 Correct 2019 ms 26424 KB Output is correct
46 Correct 2573 ms 26680 KB Output is correct
47 Correct 2314 ms 26448 KB Output is correct
48 Correct 2603 ms 27156 KB Output is correct
49 Correct 913 ms 24124 KB Output is correct
50 Correct 2406 ms 26884 KB Output is correct
51 Correct 1962 ms 30076 KB Output is correct
52 Correct 1646 ms 31740 KB Output is correct
53 Correct 2430 ms 28076 KB Output is correct
54 Correct 1193 ms 25724 KB Output is correct
55 Correct 3167 ms 29100 KB Output is correct
56 Correct 4518 ms 30340 KB Output is correct
57 Correct 3310 ms 29824 KB Output is correct
58 Execution timed out 5033 ms 31968 KB Time limit exceeded
59 Halted 0 ms 0 KB -