oj.uz

Submission #104697

# Submission time Handle Problem Language Result Execution time Memory
104697 2019-04-08T20:57:14 Z eriksuenderhauf Seats (IOI18_seats) C++11
100 / 100
 3264 ms 104312 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;
    if (l == r) {
        seg[k][0] = 1;
        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 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 x1 = pos[a].fi, y1 = pos[a].se;
    int x2 = pos[b].fi, y2 = pos[b].se;
    for (int i = 0; i < 4; i++) {
        int nx = x1 - dx[i], ny = y1 - dy[i];
        calc(nx, ny, -1);
        nx = x2 - dx[i], ny = y2 - dy[i];
        calc(nx, ny, -1);
    }
    arr[x2][y2] = a;
    arr[x1][y1] = b;
    for (int i = 0; i < 4; i++) {
        int nx = x1 - dx[i], ny = y1 - dy[i];
        calc(nx, ny, 1);
        nx = x2 - dx[i], ny = y2 - 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 42 ms 23928 KB Output is correct
2 Correct 47 ms 24056 KB Output is correct
3 Correct 57 ms 23936 KB Output is correct
4 Correct 59 ms 23928 KB Output is correct
5 Correct 39 ms 23932 KB Output is correct
6 Correct 48 ms 23928 KB Output is correct
7 Correct 55 ms 23936 KB Output is correct
8 Correct 50 ms 23936 KB Output is correct
9 Correct 65 ms 23928 KB Output is correct
10 Correct 70 ms 23936 KB Output is correct
11 Correct 48 ms 23936 KB Output is correct
12 Correct 43 ms 23928 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 23928 KB Output is correct
2 Correct 47 ms 24056 KB Output is correct
3 Correct 57 ms 23936 KB Output is correct
4 Correct 59 ms 23928 KB Output is correct
5 Correct 39 ms 23932 KB Output is correct
6 Correct 48 ms 23928 KB Output is correct
7 Correct 55 ms 23936 KB Output is correct
8 Correct 50 ms 23936 KB Output is correct
9 Correct 65 ms 23928 KB Output is correct
10 Correct 70 ms 23936 KB Output is correct
11 Correct 48 ms 23936 KB Output is correct
12 Correct 43 ms 23928 KB Output is correct
13 Correct 95 ms 24704 KB Output is correct
14 Correct 103 ms 24668 KB Output is correct
15 Correct 65 ms 24704 KB Output is correct
16 Correct 58 ms 24960 KB Output is correct
17 Correct 85 ms 24696 KB Output is correct
18 Correct 91 ms 24776 KB Output is correct
19 Correct 74 ms 24824 KB Output is correct
20 Correct 63 ms 24792 KB Output is correct
21 Correct 55 ms 24704 KB Output is correct
22 Correct 56 ms 24960 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2158 ms 77308 KB Output is correct
2 Correct 1182 ms 77404 KB Output is correct
3 Correct 1153 ms 77412 KB Output is correct
4 Correct 954 ms 77304 KB Output is correct
5 Correct 997 ms 77348 KB Output is correct
6 Correct 871 ms 77432 KB Output is correct
7 Correct 1004 ms 77432 KB Output is correct
8 Correct 1116 ms 77304 KB Output is correct
9 Correct 1205 ms 77432 KB Output is correct
10 Correct 1147 ms 77432 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 24696 KB Output is correct
2 Correct 191 ms 30668 KB Output is correct
3 Correct 1014 ms 77304 KB Output is correct
4 Correct 2219 ms 77176 KB Output is correct
5 Correct 955 ms 77176 KB Output is correct
6 Correct 2220 ms 104312 KB Output is correct
7 Correct 1016 ms 77048 KB Output is correct
8 Correct 1212 ms 77028 KB Output is correct
9 Correct 1307 ms 76920 KB Output is correct
10 Correct 1055 ms 77688 KB Output is correct
11 Correct 977 ms 88660 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 25612 KB Output is correct
2 Correct 168 ms 25520 KB Output is correct
3 Correct 208 ms 25588 KB Output is correct
4 Correct 249 ms 25588 KB Output is correct
5 Correct 341 ms 26296 KB Output is correct
6 Correct 1366 ms 76408 KB Output is correct
7 Correct 1703 ms 76280 KB Output is correct
8 Correct 1329 ms 76396 KB Output is correct
9 Correct 2842 ms 76320 KB Output is correct
10 Correct 1310 ms 76480 KB Output is correct
11 Correct 1323 ms 76380 KB Output is correct
12 Correct 1359 ms 76288 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 23928 KB Output is correct
2 Correct 47 ms 24056 KB Output is correct
3 Correct 57 ms 23936 KB Output is correct
4 Correct 59 ms 23928 KB Output is correct
5 Correct 39 ms 23932 KB Output is correct
6 Correct 48 ms 23928 KB Output is correct
7 Correct 55 ms 23936 KB Output is correct
8 Correct 50 ms 23936 KB Output is correct
9 Correct 65 ms 23928 KB Output is correct
10 Correct 70 ms 23936 KB Output is correct
11 Correct 48 ms 23936 KB Output is correct
12 Correct 43 ms 23928 KB Output is correct
13 Correct 95 ms 24704 KB Output is correct
14 Correct 103 ms 24668 KB Output is correct
15 Correct 65 ms 24704 KB Output is correct
16 Correct 58 ms 24960 KB Output is correct
17 Correct 85 ms 24696 KB Output is correct
18 Correct 91 ms 24776 KB Output is correct
19 Correct 74 ms 24824 KB Output is correct
20 Correct 63 ms 24792 KB Output is correct
21 Correct 55 ms 24704 KB Output is correct
22 Correct 56 ms 24960 KB Output is correct
23 Correct 2158 ms 77308 KB Output is correct
24 Correct 1182 ms 77404 KB Output is correct
25 Correct 1153 ms 77412 KB Output is correct
26 Correct 954 ms 77304 KB Output is correct
27 Correct 997 ms 77348 KB Output is correct
28 Correct 871 ms 77432 KB Output is correct
29 Correct 1004 ms 77432 KB Output is correct
30 Correct 1116 ms 77304 KB Output is correct
31 Correct 1205 ms 77432 KB Output is correct
32 Correct 1147 ms 77432 KB Output is correct
33 Correct 84 ms 24696 KB Output is correct
34 Correct 191 ms 30668 KB Output is correct
35 Correct 1014 ms 77304 KB Output is correct
36 Correct 2219 ms 77176 KB Output is correct
37 Correct 955 ms 77176 KB Output is correct
38 Correct 2220 ms 104312 KB Output is correct
39 Correct 1016 ms 77048 KB Output is correct
40 Correct 1212 ms 77028 KB Output is correct
41 Correct 1307 ms 76920 KB Output is correct
42 Correct 1055 ms 77688 KB Output is correct
43 Correct 977 ms 88660 KB Output is correct
44 Correct 112 ms 25612 KB Output is correct
45 Correct 168 ms 25520 KB Output is correct
46 Correct 208 ms 25588 KB Output is correct
47 Correct 249 ms 25588 KB Output is correct
48 Correct 341 ms 26296 KB Output is correct
49 Correct 1366 ms 76408 KB Output is correct
50 Correct 1703 ms 76280 KB Output is correct
51 Correct 1329 ms 76396 KB Output is correct
52 Correct 2842 ms 76320 KB Output is correct
53 Correct 1310 ms 76480 KB Output is correct
54 Correct 1323 ms 76380 KB Output is correct
55 Correct 1359 ms 76288 KB Output is correct
56 Correct 171 ms 25484 KB Output is correct
57 Correct 306 ms 25536 KB Output is correct
58 Correct 542 ms 26140 KB Output is correct
59 Correct 1810 ms 76324 KB Output is correct
60 Correct 3078 ms 76408 KB Output is correct
61 Correct 1734 ms 76424 KB Output is correct
62 Correct 1331 ms 76408 KB Output is correct
63 Correct 3264 ms 76408 KB Output is correct
64 Correct 1975 ms 76440 KB Output is correct
65 Correct 1863 ms 76380 KB Output is correct
66 Correct 1811 ms 76664 KB Output is correct
67 Correct 2036 ms 77180 KB Output is correct
68 Correct 1479 ms 83064 KB Output is correct
69 Correct 2698 ms 88128 KB Output is correct