oj.uz

Submission #76216

# Submission time Handle Problem Language Result Execution time Memory
76216 2018-09-12T12:17:04 Z imeimi2000 Seats (IOI18_seats) C++17
100 / 100
 2001 ms 107648 KB 
#include "seats.h"
#include <algorithm>
 
using namespace std;
typedef long long llong;
typedef pair<int, int> pii;
 
int h, w, n;
 
vector<int> R, C;
vector<vector<int>> idx;
 
struct segtree {
    struct node {
        int mn, ct, lz;
        node operator+(const node &p) const {
            node ret;
            ret.mn = min(mn, p.mn);
            ret.ct = 0;
            if (ret.mn == mn) ret.ct += ct;
            if (ret.mn == p.mn) ret.ct += p.ct;
            ret.lz = 0;
            return ret;
        }
    } seg[1 << 21];
    void init(int i, int s, int e, const vector<int> &v) {
        if (s == e) {
            seg[i].mn = v[s];
            seg[i].ct = 1;
            seg[i].lz = 0;
            return;
        }
        int m = (s + e) / 2;
        init(i << 1, s, m, v);
        init(i << 1 | 1, m + 1, e, v);
        seg[i] = seg[i << 1] + seg[i << 1 | 1];
    }
    void spread(int i) {
        seg[i << 1].mn += seg[i].lz;
        seg[i << 1].lz += seg[i].lz;
        seg[i << 1 | 1].mn += seg[i].lz;
        seg[i << 1 | 1].lz += seg[i].lz;
        seg[i].lz = 0;
    }
    void update(int i, int s, int e, int x, int y, int v) {
        if (e < x || y < s) return;
        if (x <= s && e <= y) {
            seg[i].mn += v;
            seg[i].lz += v;
            return;
        }
        spread(i);
        int m = (s + e) / 2;
        update(i << 1, s, m, x, y, v);
        update(i << 1 | 1, m + 1, e, x, y, v);
        seg[i] = seg[i << 1] + seg[i << 1 | 1];
    }
    int get() const {
        return seg[1].ct;
    }
} seg;
 
int getIdx(int x, int y) {
    if (x < 0 || h <= x || y < 0 || w <= y) return n;
    return idx[x][y];
}
 
void update(int x, int y, int v) {
    int A[4] = { getIdx(x - 1, y - 1), getIdx(x - 1, y)
                , getIdx(x, y - 1), getIdx(x, y) };
    sort(A, A + 4);
    seg.update(1, 0, n - 1, A[0], A[1] - 1, v);
    seg.update(1, 0, n - 1, A[2], A[3] - 1, v);
}
 
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
    idx.resize(H, vector<int>(W, 0));
    ::R = R; ::C = C;
    h = H; w = W; n = H * W;
    for (int i = 0; i < n; ++i) {
        idx[R[i]][C[i]] = i;
    }
    vector<int> sum(n + 1, 0);
    for (int i = 0; i <= h; ++i) {
        for (int j = 0; j <= w; ++j) {
            int A[4] = { getIdx(i - 1, j - 1), getIdx(i - 1, j)
                , getIdx(i, j - 1), getIdx(i, j) };
            sort(A, A + 4);
            sum[A[0]] += 1;
            sum[A[1]] -= 1;
            sum[A[2]] += 1;
            sum[A[3]] -= 1;
        }
    }
    for (int i = 1; i < n; ++i) sum[i] += sum[i - 1];
    seg.init(1, 0, n - 1, sum);
}
 
int swap_seats(int a, int b) {
    vector<pii> ps;
    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 2; ++j) {
            ps.emplace_back(R[a] + i, C[a] + j);
            ps.emplace_back(R[b] + i, C[b] + j);
        }
    }
    sort(ps.begin(), ps.end());
    ps.erase(unique(ps.begin(), ps.end()), ps.end());
    for (pii i : ps) update(i.first, i.second, -1);
    swap(idx[R[a]][C[a]], idx[R[b]][C[b]]);
    swap(R[a], R[b]); swap(C[a], C[b]);
    for (pii i : ps) update(i.first, i.second, 1);
    return seg.get();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 504 KB Output is correct
2 Correct 26 ms 628 KB Output is correct
3 Correct 40 ms 628 KB Output is correct
4 Correct 25 ms 644 KB Output is correct
5 Correct 21 ms 644 KB Output is correct
6 Correct 32 ms 644 KB Output is correct
7 Correct 36 ms 644 KB Output is correct
8 Correct 33 ms 664 KB Output is correct
9 Correct 51 ms 664 KB Output is correct
10 Correct 36 ms 664 KB Output is correct
11 Correct 32 ms 664 KB Output is correct
12 Correct 22 ms 664 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 504 KB Output is correct
2 Correct 26 ms 628 KB Output is correct
3 Correct 40 ms 628 KB Output is correct
4 Correct 25 ms 644 KB Output is correct
5 Correct 21 ms 644 KB Output is correct
6 Correct 32 ms 644 KB Output is correct
7 Correct 36 ms 644 KB Output is correct
8 Correct 33 ms 664 KB Output is correct
9 Correct 51 ms 664 KB Output is correct
10 Correct 36 ms 664 KB Output is correct
11 Correct 32 ms 664 KB Output is correct
12 Correct 22 ms 664 KB Output is correct
13 Correct 92 ms 1216 KB Output is correct
14 Correct 88 ms 1292 KB Output is correct
15 Correct 47 ms 1292 KB Output is correct
16 Correct 51 ms 1732 KB Output is correct
17 Correct 60 ms 1732 KB Output is correct
18 Correct 63 ms 1732 KB Output is correct
19 Correct 59 ms 1732 KB Output is correct
20 Correct 67 ms 1732 KB Output is correct
21 Correct 41 ms 1732 KB Output is correct
22 Correct 41 ms 1820 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 605 ms 56744 KB Output is correct
2 Correct 502 ms 56812 KB Output is correct
3 Correct 514 ms 56868 KB Output is correct
4 Correct 487 ms 56868 KB Output is correct
5 Correct 491 ms 56868 KB Output is correct
6 Correct 488 ms 56868 KB Output is correct
7 Correct 505 ms 56868 KB Output is correct
8 Correct 484 ms 56868 KB Output is correct
9 Correct 490 ms 56868 KB Output is correct
10 Correct 464 ms 56868 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 56868 KB Output is correct
2 Correct 125 ms 56868 KB Output is correct
3 Correct 473 ms 56868 KB Output is correct
4 Correct 616 ms 56868 KB Output is correct
5 Correct 494 ms 56868 KB Output is correct
6 Correct 892 ms 107648 KB Output is correct
7 Correct 490 ms 107648 KB Output is correct
8 Correct 530 ms 107648 KB Output is correct
9 Correct 479 ms 107648 KB Output is correct
10 Correct 482 ms 107648 KB Output is correct
11 Correct 486 ms 107648 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 107648 KB Output is correct
2 Correct 135 ms 107648 KB Output is correct
3 Correct 191 ms 107648 KB Output is correct
4 Correct 291 ms 107648 KB Output is correct
5 Correct 419 ms 107648 KB Output is correct
6 Correct 985 ms 107648 KB Output is correct
7 Correct 1038 ms 107648 KB Output is correct
8 Correct 980 ms 107648 KB Output is correct
9 Correct 1242 ms 107648 KB Output is correct
10 Correct 921 ms 107648 KB Output is correct
11 Correct 975 ms 107648 KB Output is correct
12 Correct 932 ms 107648 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 504 KB Output is correct
2 Correct 26 ms 628 KB Output is correct
3 Correct 40 ms 628 KB Output is correct
4 Correct 25 ms 644 KB Output is correct
5 Correct 21 ms 644 KB Output is correct
6 Correct 32 ms 644 KB Output is correct
7 Correct 36 ms 644 KB Output is correct
8 Correct 33 ms 664 KB Output is correct
9 Correct 51 ms 664 KB Output is correct
10 Correct 36 ms 664 KB Output is correct
11 Correct 32 ms 664 KB Output is correct
12 Correct 22 ms 664 KB Output is correct
13 Correct 92 ms 1216 KB Output is correct
14 Correct 88 ms 1292 KB Output is correct
15 Correct 47 ms 1292 KB Output is correct
16 Correct 51 ms 1732 KB Output is correct
17 Correct 60 ms 1732 KB Output is correct
18 Correct 63 ms 1732 KB Output is correct
19 Correct 59 ms 1732 KB Output is correct
20 Correct 67 ms 1732 KB Output is correct
21 Correct 41 ms 1732 KB Output is correct
22 Correct 41 ms 1820 KB Output is correct
23 Correct 605 ms 56744 KB Output is correct
24 Correct 502 ms 56812 KB Output is correct
25 Correct 514 ms 56868 KB Output is correct
26 Correct 487 ms 56868 KB Output is correct
27 Correct 491 ms 56868 KB Output is correct
28 Correct 488 ms 56868 KB Output is correct
29 Correct 505 ms 56868 KB Output is correct
30 Correct 484 ms 56868 KB Output is correct
31 Correct 490 ms 56868 KB Output is correct
32 Correct 464 ms 56868 KB Output is correct
33 Correct 78 ms 56868 KB Output is correct
34 Correct 125 ms 56868 KB Output is correct
35 Correct 473 ms 56868 KB Output is correct
36 Correct 616 ms 56868 KB Output is correct
37 Correct 494 ms 56868 KB Output is correct
38 Correct 892 ms 107648 KB Output is correct
39 Correct 490 ms 107648 KB Output is correct
40 Correct 530 ms 107648 KB Output is correct
41 Correct 479 ms 107648 KB Output is correct
42 Correct 482 ms 107648 KB Output is correct
43 Correct 486 ms 107648 KB Output is correct
44 Correct 63 ms 107648 KB Output is correct
45 Correct 135 ms 107648 KB Output is correct
46 Correct 191 ms 107648 KB Output is correct
47 Correct 291 ms 107648 KB Output is correct
48 Correct 419 ms 107648 KB Output is correct
49 Correct 985 ms 107648 KB Output is correct
50 Correct 1038 ms 107648 KB Output is correct
51 Correct 980 ms 107648 KB Output is correct
52 Correct 1242 ms 107648 KB Output is correct
53 Correct 921 ms 107648 KB Output is correct
54 Correct 975 ms 107648 KB Output is correct
55 Correct 932 ms 107648 KB Output is correct
56 Correct 143 ms 107648 KB Output is correct
57 Correct 349 ms 107648 KB Output is correct
58 Correct 641 ms 107648 KB Output is correct
59 Correct 1459 ms 107648 KB Output is correct
60 Correct 2001 ms 107648 KB Output is correct
61 Correct 1308 ms 107648 KB Output is correct
62 Correct 1180 ms 107648 KB Output is correct
63 Correct 1816 ms 107648 KB Output is correct
64 Correct 1420 ms 107648 KB Output is correct
65 Correct 1330 ms 107648 KB Output is correct
66 Correct 1460 ms 107648 KB Output is correct
67 Correct 1371 ms 107648 KB Output is correct
68 Correct 1167 ms 107648 KB Output is correct
69 Correct 1823 ms 107648 KB Output is correct