oj.uz

Submission #104696

# Submission time Handle Problem Language Result Execution time Memory
104696 2019-04-08T20:45:52 Z eriksuenderhauf Seats (IOI18_seats) C++11
100 / 100
 3109 ms 119320 KB 
#pragma GCC optimize("O3")
#include "seats.h"
#include <bits/stdc++.h>
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
int seg[MAXN*4][2], lazy[MAXN*4];
int h, w, dx[4] = {0, 0, -1, -1}, dy[4] = {0, -1, 0, -1};
vi arr[MAXN];
pii pos[MAXN];

int get(int i, int j) {
    if (0 > i || i >= h || 0 > j || j >= w)
        return h * w;
    return arr[i][j];
}

void build(int l, int r, int k) {
    lazy[k] = 0;
    seg[k][0] = r - l + 1;
    if (l == r) {
        seg[k][1] = 0;
        return;
    }
    int m = (l + r) / 2;
    build(l, m, k * 2);
    build(m + 1, r, k*2+1);
    //seg[k][0] = seg[k*2][0] + seg[k*2+1][0];
    seg[k][1] = 0;
}

void prop(int l, int r, int k) {
    if (l != r) {
        lazy[k*2] += lazy[k];
        lazy[k*2+1] += lazy[k];
    }
    lazy[k] = 0;
}

void upd(int l, int r, int k, int a, int b, int v) {
    if (b < l || r < a) return;
    if (a <= l && r <= b) {
        seg[k][1] += v;
        lazy[k] += v;
        return;
    }
    int m = (l + r) / 2;
    upd(l, m, k*2, a, b, v);
    upd(m+1, r, k*2+1, a, b, v);
    if (seg[k*2][1] < seg[k*2+1][1])
        seg[k][0] = seg[k*2][0], seg[k][1] = seg[k*2][1];
    else if (seg[k*2][1] > seg[k*2+1][1])
        seg[k][0] = seg[k*2+1][0], seg[k][1] = seg[k*2+1][1];
    else
        seg[k][0] = seg[k*2][0]+seg[k*2+1][0], seg[k][1] = seg[k*2][1];
    seg[k][1] += lazy[k];
}

void calc(int x, int y, int v) {
    vi tmp = {0, 0, 0, 0};
    for (int i = 0; i < 4; i++) {
        int nx = x + dx[i], ny = y + dy[i];
        tmp[i] = get(nx, ny);
    }
    sort(tmp.begin(), tmp.end());
    if (tmp[0] < tmp[1])
        upd(0, h*w - 1, 1, tmp[0], tmp[1] - 1, v);
    if (tmp[2] < tmp[3])
        upd(0, h*w - 1, 1, tmp[2], tmp[3] - 1, v);
}

void give_initial_chart(int H, int W, vector<int> r, vector<int> c) {
    h = H, w = W;
    for (int i = 0; i < h; i++)
        arr[i].resize(w);
    for (int i = 0; i < h * w; i++) {
        arr[r[i]][c[i]] = i;
        pos[i] = {r[i], c[i]};
    }
    build(0, h*w - 1, 1);
    for (int i = 0; i <= h; i++)
        for (int j = 0; j <= w; j++)
            calc(i, j, 1);
}

int swap_seats(int a, int b) {
    int x = pos[a].fi, y = pos[a].se;
    for (int i = 0; i < 4; i++) {
        int nx = x - dx[i], ny = y - dy[i];
        calc(nx, ny, -1);
    }
    arr[x][y] = b;
    for (int i = 0; i < 4; i++) {
        int nx = x - dx[i], ny = y - dy[i];
        calc(nx, ny, 1);
    }
    x = pos[b].fi, y = pos[b].se;
    for (int i = 0; i < 4; i++) {
        int nx = x - dx[i], ny = y - dy[i];
        calc(nx, ny, -1);
    }
    arr[x][y] = a;
    for (int i = 0; i < 4; i++) {
        int nx = x - dx[i], ny = y - dy[i];
        calc(nx, ny, 1);
    }
    swap(pos[a], pos[b]);
    return seg[1][0];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 23928 KB Output is correct
2 Correct 45 ms 23936 KB Output is correct
3 Correct 54 ms 23924 KB Output is correct
4 Correct 43 ms 23936 KB Output is correct
5 Correct 41 ms 23928 KB Output is correct
6 Correct 54 ms 23936 KB Output is correct
7 Correct 50 ms 23936 KB Output is correct
8 Correct 47 ms 23928 KB Output is correct
9 Correct 49 ms 23936 KB Output is correct
10 Correct 53 ms 23928 KB Output is correct
11 Correct 52 ms 23936 KB Output is correct
12 Correct 40 ms 23928 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 23928 KB Output is correct
2 Correct 45 ms 23936 KB Output is correct
3 Correct 54 ms 23924 KB Output is correct
4 Correct 43 ms 23936 KB Output is correct
5 Correct 41 ms 23928 KB Output is correct
6 Correct 54 ms 23936 KB Output is correct
7 Correct 50 ms 23936 KB Output is correct
8 Correct 47 ms 23928 KB Output is correct
9 Correct 49 ms 23936 KB Output is correct
10 Correct 53 ms 23928 KB Output is correct
11 Correct 52 ms 23936 KB Output is correct
12 Correct 40 ms 23928 KB Output is correct
13 Correct 84 ms 24708 KB Output is correct
14 Correct 89 ms 24708 KB Output is correct
15 Correct 65 ms 24704 KB Output is correct
16 Correct 73 ms 24952 KB Output is correct
17 Correct 76 ms 24704 KB Output is correct
18 Correct 78 ms 24696 KB Output is correct
19 Correct 73 ms 24756 KB Output is correct
20 Correct 90 ms 24952 KB Output is correct
21 Correct 61 ms 24908 KB Output is correct
22 Correct 61 ms 25080 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2252 ms 91904 KB Output is correct
2 Correct 1271 ms 91896 KB Output is correct
3 Correct 1262 ms 91776 KB Output is correct
4 Correct 820 ms 91916 KB Output is correct
5 Correct 969 ms 91900 KB Output is correct
6 Correct 791 ms 91896 KB Output is correct
7 Correct 976 ms 92000 KB Output is correct
8 Correct 1143 ms 91896 KB Output is correct
9 Correct 1071 ms 91896 KB Output is correct
10 Correct 948 ms 92024 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 24720 KB Output is correct
2 Correct 168 ms 30716 KB Output is correct
3 Correct 920 ms 92072 KB Output is correct
4 Correct 2072 ms 91812 KB Output is correct
5 Correct 867 ms 92000 KB Output is correct
6 Correct 1795 ms 119320 KB Output is correct
7 Correct 855 ms 92024 KB Output is correct
8 Correct 994 ms 91980 KB Output is correct
9 Correct 942 ms 92132 KB Output is correct
10 Correct 1010 ms 92808 KB Output is correct
11 Correct 944 ms 103768 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 25660 KB Output is correct
2 Correct 129 ms 25656 KB Output is correct
3 Correct 187 ms 25676 KB Output is correct
4 Correct 217 ms 25540 KB Output is correct
5 Correct 305 ms 26424 KB Output is correct
6 Correct 1152 ms 93064 KB Output is correct
7 Correct 1399 ms 92920 KB Output is correct
8 Correct 1217 ms 93048 KB Output is correct
9 Correct 2791 ms 92932 KB Output is correct
10 Correct 1244 ms 92920 KB Output is correct
11 Correct 1165 ms 92792 KB Output is correct
12 Correct 1278 ms 92996 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 23928 KB Output is correct
2 Correct 45 ms 23936 KB Output is correct
3 Correct 54 ms 23924 KB Output is correct
4 Correct 43 ms 23936 KB Output is correct
5 Correct 41 ms 23928 KB Output is correct
6 Correct 54 ms 23936 KB Output is correct
7 Correct 50 ms 23936 KB Output is correct
8 Correct 47 ms 23928 KB Output is correct
9 Correct 49 ms 23936 KB Output is correct
10 Correct 53 ms 23928 KB Output is correct
11 Correct 52 ms 23936 KB Output is correct
12 Correct 40 ms 23928 KB Output is correct
13 Correct 84 ms 24708 KB Output is correct
14 Correct 89 ms 24708 KB Output is correct
15 Correct 65 ms 24704 KB Output is correct
16 Correct 73 ms 24952 KB Output is correct
17 Correct 76 ms 24704 KB Output is correct
18 Correct 78 ms 24696 KB Output is correct
19 Correct 73 ms 24756 KB Output is correct
20 Correct 90 ms 24952 KB Output is correct
21 Correct 61 ms 24908 KB Output is correct
22 Correct 61 ms 25080 KB Output is correct
23 Correct 2252 ms 91904 KB Output is correct
24 Correct 1271 ms 91896 KB Output is correct
25 Correct 1262 ms 91776 KB Output is correct
26 Correct 820 ms 91916 KB Output is correct
27 Correct 969 ms 91900 KB Output is correct
28 Correct 791 ms 91896 KB Output is correct
29 Correct 976 ms 92000 KB Output is correct
30 Correct 1143 ms 91896 KB Output is correct
31 Correct 1071 ms 91896 KB Output is correct
32 Correct 948 ms 92024 KB Output is correct
33 Correct 96 ms 24720 KB Output is correct
34 Correct 168 ms 30716 KB Output is correct
35 Correct 920 ms 92072 KB Output is correct
36 Correct 2072 ms 91812 KB Output is correct
37 Correct 867 ms 92000 KB Output is correct
38 Correct 1795 ms 119320 KB Output is correct
39 Correct 855 ms 92024 KB Output is correct
40 Correct 994 ms 91980 KB Output is correct
41 Correct 942 ms 92132 KB Output is correct
42 Correct 1010 ms 92808 KB Output is correct
43 Correct 944 ms 103768 KB Output is correct
44 Correct 123 ms 25660 KB Output is correct
45 Correct 129 ms 25656 KB Output is correct
46 Correct 187 ms 25676 KB Output is correct
47 Correct 217 ms 25540 KB Output is correct
48 Correct 305 ms 26424 KB Output is correct
49 Correct 1152 ms 93064 KB Output is correct
50 Correct 1399 ms 92920 KB Output is correct
51 Correct 1217 ms 93048 KB Output is correct
52 Correct 2791 ms 92932 KB Output is correct
53 Correct 1244 ms 92920 KB Output is correct
54 Correct 1165 ms 92792 KB Output is correct
55 Correct 1278 ms 92996 KB Output is correct
56 Correct 161 ms 25488 KB Output is correct
57 Correct 308 ms 25640 KB Output is correct
58 Correct 503 ms 26404 KB Output is correct
59 Correct 1729 ms 93064 KB Output is correct
60 Correct 3109 ms 93016 KB Output is correct
61 Correct 1524 ms 93064 KB Output is correct
62 Correct 1177 ms 92920 KB Output is correct
63 Correct 2686 ms 93048 KB Output is correct
64 Correct 1787 ms 93064 KB Output is correct
65 Correct 1792 ms 92920 KB Output is correct
66 Correct 1615 ms 93176 KB Output is correct
67 Correct 1687 ms 93780 KB Output is correct
68 Correct 1330 ms 99448 KB Output is correct
69 Correct 2715 ms 104724 KB Output is correct