답안 #75156 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
75156	2018-09-08T14:08:19 Z	imeimi2000	자리 배치 (IOI18_seats)	C++17	70 / 100	4000 ms	128256 KB

seats

#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 {
        llong mn, ct, lz;
        node() : mn(0), ct(1), lz(0) {}
        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 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, llong 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 * (1ll << 30));
}

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;
    }
    for (int i = 0; i <= h; ++i) {
        for (int j = 0; j <= w; ++j) {
            update(i, j, 1);
        }
    }
}

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

#	결과	실행 시간	메모리	Grader output
1	Correct	60 ms	49784 KB	Output is correct
2	Correct	62 ms	49868 KB	Output is correct
3	Correct	77 ms	49976 KB	Output is correct
4	Correct	63 ms	49976 KB	Output is correct
5	Correct	59 ms	49976 KB	Output is correct
6	Correct	69 ms	49976 KB	Output is correct
7	Correct	70 ms	49976 KB	Output is correct
8	Correct	69 ms	49976 KB	Output is correct
9	Correct	68 ms	49996 KB	Output is correct
10	Correct	75 ms	49996 KB	Output is correct
11	Correct	71 ms	49996 KB	Output is correct
12	Correct	65 ms	50024 KB	Output is correct

Subtask #2
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	60 ms	49784 KB	Output is correct
2	Correct	62 ms	49868 KB	Output is correct
3	Correct	77 ms	49976 KB	Output is correct
4	Correct	63 ms	49976 KB	Output is correct
5	Correct	59 ms	49976 KB	Output is correct
6	Correct	69 ms	49976 KB	Output is correct
7	Correct	70 ms	49976 KB	Output is correct
8	Correct	69 ms	49976 KB	Output is correct
9	Correct	68 ms	49996 KB	Output is correct
10	Correct	75 ms	49996 KB	Output is correct
11	Correct	71 ms	49996 KB	Output is correct
12	Correct	65 ms	50024 KB	Output is correct
13	Correct	122 ms	50152 KB	Output is correct
14	Correct	144 ms	50152 KB	Output is correct
15	Correct	101 ms	50152 KB	Output is correct
16	Correct	85 ms	50692 KB	Output is correct
17	Correct	114 ms	50692 KB	Output is correct
18	Correct	112 ms	50692 KB	Output is correct
19	Correct	106 ms	50692 KB	Output is correct
20	Correct	96 ms	50692 KB	Output is correct
21	Correct	82 ms	50692 KB	Output is correct
22	Correct	84 ms	50692 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2650 ms	77356 KB	Output is correct
2	Correct	1410 ms	77404 KB	Output is correct
3	Correct	1389 ms	77404 KB	Output is correct
4	Correct	1433 ms	77404 KB	Output is correct
5	Correct	1190 ms	77404 KB	Output is correct
6	Correct	1150 ms	77404 KB	Output is correct
7	Correct	1228 ms	77456 KB	Output is correct
8	Correct	1305 ms	77456 KB	Output is correct
9	Correct	1333 ms	77456 KB	Output is correct
10	Correct	1327 ms	77456 KB	Output is correct

Subtask #4
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	123 ms	77456 KB	Output is correct
2	Correct	227 ms	77456 KB	Output is correct
3	Correct	1171 ms	77456 KB	Output is correct
4	Correct	2514 ms	77456 KB	Output is correct
5	Correct	1189 ms	77456 KB	Output is correct
6	Correct	2620 ms	128256 KB	Output is correct
7	Correct	1256 ms	128256 KB	Output is correct
8	Correct	1389 ms	128256 KB	Output is correct
9	Correct	1233 ms	128256 KB	Output is correct
10	Correct	1226 ms	128256 KB	Output is correct
11	Correct	1200 ms	128256 KB	Output is correct

Subtask #5
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	108 ms	128256 KB	Output is correct
2	Correct	171 ms	128256 KB	Output is correct
3	Correct	238 ms	128256 KB	Output is correct
4	Correct	326 ms	128256 KB	Output is correct
5	Correct	494 ms	128256 KB	Output is correct
6	Correct	1710 ms	128256 KB	Output is correct
7	Correct	2001 ms	128256 KB	Output is correct
8	Correct	1645 ms	128256 KB	Output is correct
9	Correct	3455 ms	128256 KB	Output is correct
10	Correct	1630 ms	128256 KB	Output is correct
11	Correct	1667 ms	128256 KB	Output is correct
12	Correct	1560 ms	128256 KB	Output is correct

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	60 ms	49784 KB	Output is correct
2	Correct	62 ms	49868 KB	Output is correct
3	Correct	77 ms	49976 KB	Output is correct
4	Correct	63 ms	49976 KB	Output is correct
5	Correct	59 ms	49976 KB	Output is correct
6	Correct	69 ms	49976 KB	Output is correct
7	Correct	70 ms	49976 KB	Output is correct
8	Correct	69 ms	49976 KB	Output is correct
9	Correct	68 ms	49996 KB	Output is correct
10	Correct	75 ms	49996 KB	Output is correct
11	Correct	71 ms	49996 KB	Output is correct
12	Correct	65 ms	50024 KB	Output is correct
13	Correct	122 ms	50152 KB	Output is correct
14	Correct	144 ms	50152 KB	Output is correct
15	Correct	101 ms	50152 KB	Output is correct
16	Correct	85 ms	50692 KB	Output is correct
17	Correct	114 ms	50692 KB	Output is correct
18	Correct	112 ms	50692 KB	Output is correct
19	Correct	106 ms	50692 KB	Output is correct
20	Correct	96 ms	50692 KB	Output is correct
21	Correct	82 ms	50692 KB	Output is correct
22	Correct	84 ms	50692 KB	Output is correct
23	Correct	2650 ms	77356 KB	Output is correct
24	Correct	1410 ms	77404 KB	Output is correct
25	Correct	1389 ms	77404 KB	Output is correct
26	Correct	1433 ms	77404 KB	Output is correct
27	Correct	1190 ms	77404 KB	Output is correct
28	Correct	1150 ms	77404 KB	Output is correct
29	Correct	1228 ms	77456 KB	Output is correct
30	Correct	1305 ms	77456 KB	Output is correct
31	Correct	1333 ms	77456 KB	Output is correct
32	Correct	1327 ms	77456 KB	Output is correct
33	Correct	123 ms	77456 KB	Output is correct
34	Correct	227 ms	77456 KB	Output is correct
35	Correct	1171 ms	77456 KB	Output is correct
36	Correct	2514 ms	77456 KB	Output is correct
37	Correct	1189 ms	77456 KB	Output is correct
38	Correct	2620 ms	128256 KB	Output is correct
39	Correct	1256 ms	128256 KB	Output is correct
40	Correct	1389 ms	128256 KB	Output is correct
41	Correct	1233 ms	128256 KB	Output is correct
42	Correct	1226 ms	128256 KB	Output is correct
43	Correct	1200 ms	128256 KB	Output is correct
44	Correct	108 ms	128256 KB	Output is correct
45	Correct	171 ms	128256 KB	Output is correct
46	Correct	238 ms	128256 KB	Output is correct
47	Correct	326 ms	128256 KB	Output is correct
48	Correct	494 ms	128256 KB	Output is correct
49	Correct	1710 ms	128256 KB	Output is correct
50	Correct	2001 ms	128256 KB	Output is correct
51	Correct	1645 ms	128256 KB	Output is correct
52	Correct	3455 ms	128256 KB	Output is correct
53	Correct	1630 ms	128256 KB	Output is correct
54	Correct	1667 ms	128256 KB	Output is correct
55	Correct	1560 ms	128256 KB	Output is correct
56	Correct	189 ms	128256 KB	Output is correct
57	Correct	393 ms	128256 KB	Output is correct
58	Correct	677 ms	128256 KB	Output is correct
59	Correct	2334 ms	128256 KB	Output is correct
60	Execution timed out	4029 ms	128256 KB	Time limit exceeded
61	Halted	0 ms	0 KB	-

답안 #75156

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 6.0 / 6.0

Subtask #3 20.0 / 20.0

Subtask #4 6.0 / 6.0

Subtask #5 33.0 / 33.0

Subtask #6 0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
6.0 / 6.0

Subtask #3
20.0 / 20.0

Subtask #4
6.0 / 6.0

Subtask #5
33.0 / 33.0

Subtask #6
0 / 30.0