oj.uz

답안 #907481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
907481 2024-01-15T17:28:14 Z LOLOLO I want to be the very best too! (NOI17_pokemonmaster) C++17
71 / 100
 5000 ms 37124 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]) {
        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 63 ms 23560 KB Output is correct
2 Correct 77 ms 24644 KB Output is correct
3 Correct 111 ms 24324 KB Output is correct
4 Correct 69 ms 24084 KB Output is correct
5 Correct 99 ms 24628 KB Output is correct
6 Correct 85 ms 23812 KB Output is correct
7 Correct 74 ms 24584 KB Output is correct
8 Correct 103 ms 24760 KB Output is correct
9 Correct 78 ms 24544 KB Output is correct
10 Correct 80 ms 25084 KB Output is correct
11 Correct 76 ms 24628 KB Output is correct
12 Correct 82 ms 25392 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 22920 KB Output is correct
2 Correct 67 ms 22824 KB Output is correct
3 Correct 70 ms 23104 KB Output is correct
4 Correct 75 ms 24056 KB Output is correct
5 Correct 77 ms 24036 KB Output is correct
6 Correct 91 ms 24576 KB Output is correct
7 Correct 103 ms 25648 KB Output is correct
8 Correct 123 ms 26344 KB Output is correct
9 Correct 112 ms 25556 KB Output is correct
10 Correct 155 ms 28368 KB Output is correct
11 Correct 132 ms 27076 KB Output is correct
12 Correct 142 ms 30072 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 964 ms 24336 KB Output is correct
2 Correct 2633 ms 31676 KB Output is correct
3 Correct 2126 ms 31592 KB Output is correct
4 Correct 1963 ms 32840 KB Output is correct
5 Correct 2395 ms 33640 KB Output is correct
6 Correct 979 ms 26144 KB Output is correct
7 Correct 3865 ms 35080 KB Output is correct
8 Correct 4083 ms 34964 KB Output is correct
9 Correct 4162 ms 34956 KB Output is correct
10 Correct 4246 ms 34816 KB Output is correct
11 Correct 3526 ms 34420 KB Output is correct
12 Correct 4455 ms 35032 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 23560 KB Output is correct
2 Correct 77 ms 24644 KB Output is correct
3 Correct 111 ms 24324 KB Output is correct
4 Correct 69 ms 24084 KB Output is correct
5 Correct 99 ms 24628 KB Output is correct
6 Correct 85 ms 23812 KB Output is correct
7 Correct 74 ms 24584 KB Output is correct
8 Correct 103 ms 24760 KB Output is correct
9 Correct 78 ms 24544 KB Output is correct
10 Correct 80 ms 25084 KB Output is correct
11 Correct 76 ms 24628 KB Output is correct
12 Correct 82 ms 25392 KB Output is correct
13 Correct 843 ms 24192 KB Output is correct
14 Correct 2655 ms 31636 KB Output is correct
15 Correct 2266 ms 31528 KB Output is correct
16 Correct 1680 ms 31276 KB Output is correct
17 Correct 2843 ms 31644 KB Output is correct
18 Correct 945 ms 24700 KB Output is correct
19 Correct 2490 ms 31936 KB Output is correct
20 Correct 2782 ms 31480 KB Output is correct
21 Correct 2320 ms 31700 KB Output is correct
22 Correct 2937 ms 31960 KB Output is correct
23 Correct 2665 ms 31476 KB Output is correct
24 Correct 3295 ms 32740 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 23560 KB Output is correct
2 Correct 77 ms 24644 KB Output is correct
3 Correct 111 ms 24324 KB Output is correct
4 Correct 69 ms 24084 KB Output is correct
5 Correct 99 ms 24628 KB Output is correct
6 Correct 85 ms 23812 KB Output is correct
7 Correct 74 ms 24584 KB Output is correct
8 Correct 103 ms 24760 KB Output is correct
9 Correct 78 ms 24544 KB Output is correct
10 Correct 80 ms 25084 KB Output is correct
11 Correct 76 ms 24628 KB Output is correct
12 Correct 82 ms 25392 KB Output is correct
13 Correct 68 ms 22920 KB Output is correct
14 Correct 67 ms 22824 KB Output is correct
15 Correct 70 ms 23104 KB Output is correct
16 Correct 75 ms 24056 KB Output is correct
17 Correct 77 ms 24036 KB Output is correct
18 Correct 91 ms 24576 KB Output is correct
19 Correct 103 ms 25648 KB Output is correct
20 Correct 123 ms 26344 KB Output is correct
21 Correct 112 ms 25556 KB Output is correct
22 Correct 155 ms 28368 KB Output is correct
23 Correct 132 ms 27076 KB Output is correct
24 Correct 142 ms 30072 KB Output is correct
25 Correct 964 ms 24336 KB Output is correct
26 Correct 2633 ms 31676 KB Output is correct
27 Correct 2126 ms 31592 KB Output is correct
28 Correct 1963 ms 32840 KB Output is correct
29 Correct 2395 ms 33640 KB Output is correct
30 Correct 979 ms 26144 KB Output is correct
31 Correct 3865 ms 35080 KB Output is correct
32 Correct 4083 ms 34964 KB Output is correct
33 Correct 4162 ms 34956 KB Output is correct
34 Correct 4246 ms 34816 KB Output is correct
35 Correct 3526 ms 34420 KB Output is correct
36 Correct 4455 ms 35032 KB Output is correct
37 Correct 843 ms 24192 KB Output is correct
38 Correct 2655 ms 31636 KB Output is correct
39 Correct 2266 ms 31528 KB Output is correct
40 Correct 1680 ms 31276 KB Output is correct
41 Correct 2843 ms 31644 KB Output is correct
42 Correct 945 ms 24700 KB Output is correct
43 Correct 2490 ms 31936 KB Output is correct
44 Correct 2782 ms 31480 KB Output is correct
45 Correct 2320 ms 31700 KB Output is correct
46 Correct 2937 ms 31960 KB Output is correct
47 Correct 2665 ms 31476 KB Output is correct
48 Correct 3295 ms 32740 KB Output is correct
49 Correct 916 ms 24300 KB Output is correct
50 Correct 2937 ms 31884 KB Output is correct
51 Correct 2422 ms 31696 KB Output is correct
52 Correct 1831 ms 33448 KB Output is correct
53 Correct 2945 ms 34412 KB Output is correct
54 Correct 1101 ms 26324 KB Output is correct
55 Correct 3518 ms 34672 KB Output is correct
56 Correct 4848 ms 35440 KB Output is correct
57 Correct 3697 ms 35148 KB Output is correct
58 Execution timed out 5059 ms 37124 KB Time limit exceeded
59 Halted 0 ms 0 KB -