oj.uz

답안 #106736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106736 2019-04-19T22:27:28 Z tri 자리 배치 (IOI18_seats) C++14
100 / 100
 1987 ms 159712 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef pair<int, int> pi;

#define pb push_back
#define f first
#define s second

namespace debug {
    template<class T1, class T2>
    void pr(const pair<T1, T2> &x);

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x);

    template<class T>
    void pr(const vector<T> &x);

    template<class T>
    void pr(const set<T> &x);

    template<class T1, class T2>
    void pr(const map<T1, T2> &x);

    template<class T>
    void pr(const T &x) { cout << x; }

    template<class T, class... Ts>
    void pr(const T &first, const Ts &... rest) { pr(first), pr(rest...); }

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); }

    template<class T>
    void prIn(const T &x) {
        pr("{");
        bool fst = 1;
        for (auto &a : x) {
            pr(fst ? "" : ", ", a), fst = 0;
        }
        pr("}");
    }

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x) { prIn(x); }

    template<class T>
    void pr(const vector<T> &x) { prIn(x); }

    template<class T>
    void pr(const set<T> &x) { prIn(x); }

    template<class T1, class T2>
    void pr(const map<T1, T2> &x) { prIn(x); }

    void ps() { pr("\n"); }

    template<class Arg, class... Args>
    void ps(const Arg &first, const Args &... rest) {
        pr(first, " ");
        ps(rest...);
    }
}
using namespace debug;

const int MAXN = 3100000;
const int INF = 1e9;

inline pi operator+(pi a, pi b) {
    if (a.f != b.f) {
        if (a.f < b.f) {
            return a;
        } else {
            return b;
        }
    }
    return {a.f, a.s + b.s};
}

int buf[MAXN];

struct LSegTr {
    pi tr[4 * MAXN];
    int lz[4 * MAXN];

    void ps(int i, int l, int r) {
        tr[i].f += lz[i];
        if (l != r) {
            lz[i * 2] += lz[i];
            lz[i * 2 + 1] += lz[i];
        }
        lz[i] = 0;
    }

    void b(int i, int l, int r) {
        if (l == r) {
            tr[i] = {buf[l], 1};
            return;
        }
        int mid = (l + r) / 2;
        b(i * 2, l, mid);
        b(i * 2 + 1, mid + 1, r);
        tr[i] = tr[i * 2] + tr[i * 2 + 1];
        // debug::ps(tr[i]);
    }

    pi q(int i, int l, int r, int s, int e) {
        ps(i, l, r);
        if (e < l || r < s) {
            return {INF, 0};
        }
        if (s <= l && r <= e) {
            return tr[i];
        }
        int mid = (l + r) / 2;
        return q(i * 2, l, mid, s, e) + q(i * 2 + 1, mid + 1, r, s, e);
    }

    void u(int i, int l, int r, int s, int e, int d) {
        ps(i, l, r);
        if (e < l || r < s) {
            return;
        }
        if (s <= l && r <= e) {
            lz[i] += d;
            ps(i, l, r);
            return;
        }
        int mid = (l + r) / 2;
        u(i * 2, l, mid, s, e, d);
        u(i * 2 + 1, mid + 1, r, s, e, d);
        tr[i] = tr[i * 2] + tr[i * 2 + 1];
    }
} hist;

int nR, nC;

inline int l(int i, int j) {
    return (nC + 2) * i + j;
}

int tim[MAXN];
int loc[MAXN];

int dLoc[4]; // u,l,d,r
int sqr[4];

vi times(4);

void mod(int a, int d) { // takes top left of 2x2
    for (int i = 0; i < 4; i++) {
        times[i] = tim[a + sqr[i]];
    }
    // ps(times);

    sort(times.begin(), times.end());

    // ps("upd:", times[0], times[1] - 1, d);
    if (times[0] != times[1]) {
        hist.u(1, 1, nR * nC, times[0], times[1] - 1, d);
    }
    if (times[2] != times[3]) {
        hist.u(1, 1, nR * nC, times[2], times[3] - 1, d);
    }
}


void modB(int a, int d) { // takes top left of 2x2
    for (int i = 0; i < 4; i++) {
        times[i] = tim[a + sqr[i]];
    }
    // ps(times);

    sort(times.begin(), times.end());

    // ps("upd:", times[0], times[1] - 1, d);
    if (times[0] != times[1]) {
        buf[times[0]] += d;
        if (times[1] <= nR * nC) {
            buf[times[1]] -= d;
        }
    }
    if (times[2] != times[3]) {
        buf[times[2]] += d;
        if (times[3] <= nR * nC) {
            buf[times[3]] -= d;
        }
    }
}

void modSur(int ct, int d) {
    for (int i = 0; i < 4; i++) {
        mod(ct, d);
        ct += dLoc[i];
    }
}

void give_initial_chart(int H, int W, vi R, vi C) {
    // ps("in initial");
    nR = H, nC = W;
    fill_n(tim, MAXN, INF);
    for (int i = 1; i <= nR * nC; i++) {
        loc[i] = l(R[i - 1] + 1, C[i - 1] + 1);
        // ps(R[i - 1], C[i - 1], l(R[i - 1], C[i - 1]));
        tim[loc[i]] = i;
    }

    dLoc[0] = -(nC + 2);
    dLoc[1] = -1;
    dLoc[2] = (nC + 2);
    dLoc[3] = 1;
    // ps(dLoc[0], dLoc[1], dLoc[2], dLoc[3]);

    sqr[0] = 0;
    sqr[1] = dLoc[3]; // r
    sqr[2] = dLoc[3] + dLoc[2]; // r, d
    sqr[3] = dLoc[2]; // d

    // ps(nR * nC);

    /*ps("pre");
    for (int i = 1; i <= 6; i++) {
        ps(hist.q(1, 1, nR * nC, i, i));
    }*/

    memset(buf, 0, sizeof(buf));
    for (int i = 0; i <= nR; i++) {
        for (int j = 0; j <= nC; j++) {
            modB(l(i, j), 1);
        }
    }

    for (int i = 1; i <= nR * nC; i++) {
        buf[i] += buf[i - 1];
    }
    hist.b(1, 1, nR * nC);

    // ps("fin initial", hist.tr[1].s);
    /*
    for (int i = 1; i <= 6; i++) {
        ps(hist.q(1, 1, nR * nC, i, i));
    }*/
}

int swap_seats(int a, int b) {
    a++, b++;
    modSur(loc[a], -1);
    modSur(loc[b], -1);
    swap(loc[a], loc[b]);
    tim[loc[a]] = a;
    tim[loc[b]] = b;
    modSur(loc[a], 1);
    modSur(loc[b], 1);
    // ps("printing", hist.tr[1].s);
    return hist.tr[1].s; // min amt hist will always be 4, find # of times where it is 4
}

/*
int main() {
    // ps("start");
    vi R = {0, 1, 1, 0, 0, 1};
    vi C = {0, 0, 1, 1, 2, 2};
    give_initial_chart(2, 3, R, C);
    ps(swap_seats(0, 5));
    ps(swap_seats(0, 5));
}*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 121792 KB Output is correct
2 Correct 110 ms 121848 KB Output is correct
3 Correct 125 ms 121848 KB Output is correct
4 Correct 117 ms 121748 KB Output is correct
5 Correct 103 ms 121848 KB Output is correct
6 Correct 117 ms 121720 KB Output is correct
7 Correct 113 ms 121780 KB Output is correct
8 Correct 121 ms 121832 KB Output is correct
9 Correct 123 ms 121848 KB Output is correct
10 Correct 128 ms 121800 KB Output is correct
11 Correct 140 ms 121764 KB Output is correct
12 Correct 104 ms 121848 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 121792 KB Output is correct
2 Correct 110 ms 121848 KB Output is correct
3 Correct 125 ms 121848 KB Output is correct
4 Correct 117 ms 121748 KB Output is correct
5 Correct 103 ms 121848 KB Output is correct
6 Correct 117 ms 121720 KB Output is correct
7 Correct 113 ms 121780 KB Output is correct
8 Correct 121 ms 121832 KB Output is correct
9 Correct 123 ms 121848 KB Output is correct
10 Correct 128 ms 121800 KB Output is correct
11 Correct 140 ms 121764 KB Output is correct
12 Correct 104 ms 121848 KB Output is correct
13 Correct 164 ms 122060 KB Output is correct
14 Correct 165 ms 121992 KB Output is correct
15 Correct 136 ms 122104 KB Output is correct
16 Correct 122 ms 122104 KB Output is correct
17 Correct 144 ms 122160 KB Output is correct
18 Correct 144 ms 122104 KB Output is correct
19 Correct 142 ms 122104 KB Output is correct
20 Correct 136 ms 121976 KB Output is correct
21 Correct 136 ms 122104 KB Output is correct
22 Correct 131 ms 122084 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 745 ms 141900 KB Output is correct
2 Correct 621 ms 141920 KB Output is correct
3 Correct 502 ms 141792 KB Output is correct
4 Correct 455 ms 141796 KB Output is correct
5 Correct 482 ms 141920 KB Output is correct
6 Correct 474 ms 141792 KB Output is correct
7 Correct 484 ms 141920 KB Output is correct
8 Correct 480 ms 141792 KB Output is correct
9 Correct 495 ms 141712 KB Output is correct
10 Correct 482 ms 141792 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 122056 KB Output is correct
2 Correct 174 ms 123832 KB Output is correct
3 Correct 448 ms 141768 KB Output is correct
4 Correct 685 ms 141920 KB Output is correct
5 Correct 474 ms 141668 KB Output is correct
6 Correct 833 ms 141808 KB Output is correct
7 Correct 506 ms 141908 KB Output is correct
8 Correct 592 ms 141920 KB Output is correct
9 Correct 524 ms 141796 KB Output is correct
10 Correct 453 ms 141664 KB Output is correct
11 Correct 625 ms 141792 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 122772 KB Output is correct
2 Correct 191 ms 122660 KB Output is correct
3 Correct 238 ms 122740 KB Output is correct
4 Correct 297 ms 122740 KB Output is correct
5 Correct 449 ms 122996 KB Output is correct
6 Correct 1072 ms 142948 KB Output is correct
7 Correct 1054 ms 142944 KB Output is correct
8 Correct 1092 ms 142832 KB Output is correct
9 Correct 1300 ms 142816 KB Output is correct
10 Correct 832 ms 159456 KB Output is correct
11 Correct 829 ms 159456 KB Output is correct
12 Correct 854 ms 159644 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 121792 KB Output is correct
2 Correct 110 ms 121848 KB Output is correct
3 Correct 125 ms 121848 KB Output is correct
4 Correct 117 ms 121748 KB Output is correct
5 Correct 103 ms 121848 KB Output is correct
6 Correct 117 ms 121720 KB Output is correct
7 Correct 113 ms 121780 KB Output is correct
8 Correct 121 ms 121832 KB Output is correct
9 Correct 123 ms 121848 KB Output is correct
10 Correct 128 ms 121800 KB Output is correct
11 Correct 140 ms 121764 KB Output is correct
12 Correct 104 ms 121848 KB Output is correct
13 Correct 164 ms 122060 KB Output is correct
14 Correct 165 ms 121992 KB Output is correct
15 Correct 136 ms 122104 KB Output is correct
16 Correct 122 ms 122104 KB Output is correct
17 Correct 144 ms 122160 KB Output is correct
18 Correct 144 ms 122104 KB Output is correct
19 Correct 142 ms 122104 KB Output is correct
20 Correct 136 ms 121976 KB Output is correct
21 Correct 136 ms 122104 KB Output is correct
22 Correct 131 ms 122084 KB Output is correct
23 Correct 745 ms 141900 KB Output is correct
24 Correct 621 ms 141920 KB Output is correct
25 Correct 502 ms 141792 KB Output is correct
26 Correct 455 ms 141796 KB Output is correct
27 Correct 482 ms 141920 KB Output is correct
28 Correct 474 ms 141792 KB Output is correct
29 Correct 484 ms 141920 KB Output is correct
30 Correct 480 ms 141792 KB Output is correct
31 Correct 495 ms 141712 KB Output is correct
32 Correct 482 ms 141792 KB Output is correct
33 Correct 168 ms 122056 KB Output is correct
34 Correct 174 ms 123832 KB Output is correct
35 Correct 448 ms 141768 KB Output is correct
36 Correct 685 ms 141920 KB Output is correct
37 Correct 474 ms 141668 KB Output is correct
38 Correct 833 ms 141808 KB Output is correct
39 Correct 506 ms 141908 KB Output is correct
40 Correct 592 ms 141920 KB Output is correct
41 Correct 524 ms 141796 KB Output is correct
42 Correct 453 ms 141664 KB Output is correct
43 Correct 625 ms 141792 KB Output is correct
44 Correct 149 ms 122772 KB Output is correct
45 Correct 191 ms 122660 KB Output is correct
46 Correct 238 ms 122740 KB Output is correct
47 Correct 297 ms 122740 KB Output is correct
48 Correct 449 ms 122996 KB Output is correct
49 Correct 1072 ms 142948 KB Output is correct
50 Correct 1054 ms 142944 KB Output is correct
51 Correct 1092 ms 142832 KB Output is correct
52 Correct 1300 ms 142816 KB Output is correct
53 Correct 832 ms 159456 KB Output is correct
54 Correct 829 ms 159456 KB Output is correct
55 Correct 854 ms 159644 KB Output is correct
56 Correct 210 ms 123440 KB Output is correct
57 Correct 343 ms 123408 KB Output is correct
58 Correct 607 ms 123904 KB Output is correct
59 Correct 1390 ms 159712 KB Output is correct
60 Correct 1966 ms 159428 KB Output is correct
61 Correct 1181 ms 159576 KB Output is correct
62 Correct 1014 ms 159488 KB Output is correct
63 Correct 1987 ms 159496 KB Output is correct
64 Correct 1196 ms 159648 KB Output is correct
65 Correct 1264 ms 159456 KB Output is correct
66 Correct 1488 ms 159456 KB Output is correct
67 Correct 1471 ms 159480 KB Output is correct
68 Correct 1031 ms 159528 KB Output is correct
69 Correct 1634 ms 159592 KB Output is correct