oj.uz

답안 #792087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792087 2023-07-24T14:57:46 Z 1bin 자리 배치 (IOI18_seats) C++14
100 / 100
 3253 ms 103428 KB 
#include <bits/stdc++.h>
#include "seats.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;
 
#define all(v) v.begin(), v.end()
typedef long long ll;
const int b = 1 << 20;
int n, lazy[b * 2], seg[b * 2], cnt[b * 2];
vector<int> Y, X;
vector<vector<int>> v;
 
void upd_lazy(int ix, int l, int r){
    if(l < n && seg[ix] == b) seg[ix] = 0, cnt[ix] = min(n - 1, r) - l + 1;
    if(!lazy[ix]) return;
    seg[ix] += lazy[ix];
    if(l ^ r){
        lazy[ix * 2] += lazy[ix];
        lazy[ix * 2 + 1] += lazy[ix];
    }
    lazy[ix] = 0;
    return;
}
 
void upd(int ix, int nl, int nr, int l, int r, int v){
    upd_lazy(ix, nl, nr);
    if(nl > r || nr < l) return;
    if(nl >= l && nr <= r){
        lazy[ix] += v;
        upd_lazy(ix, nl, nr);
        return;
    }
    int m = (nl + nr) / 2;
    upd(ix * 2, nl, m, l, r, v);
    upd(ix * 2 + 1, m + 1, nr, l, r, v);
    seg[ix] = min(seg[ix * 2], seg[ix * 2 + 1]);
    cnt[ix] = (seg[ix * 2] == seg[ix] ? cnt[ix * 2] : 0) + (seg[ix * 2 + 1] == seg[ix] ? cnt[ix * 2 + 1] : 0);
    return;
}
 
void calc(int y, int x, int p){
    vector<int> t;
    for(int i = -1; i <= 0; i++)
        for(int j = -1; j <= 0; j++)
            t.emplace_back(v[y + i][x + j]);
    sort(all(t));
    upd(1, 0, b - 1, t[0], t[1] - 1, p);
    upd(1, 0, b - 1, t[2], t[3] - 1, p);
    return;
}
 
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
    Y = R; X = C;
    n = H * W;
    v = vector<vector<int>> (H + 2, vector<int> (W + 2, n));
    for(int i = 0; i < n; i++) v[++Y[i]][++X[i]] = i;
    for(int i = 1; i < b * 2; i++) seg[i] = b;
    for(int i = 1; i <= H + 1; i++)
        for(int j = 1; j <= W + 1; j++) calc(i, j, 1);
    return;
}
 
int swap_seats(int i1, int i2) {
    for(int i = 0; i < 2; i++)
        for(int j = 0; j < 2; j++){
            calc(Y[i1] + i, X[i1] + j, -1);
            calc(Y[i2] + i, X[i2] + j, -1);
        }
    swap(Y[i1], Y[i2]);
    swap(X[i1], X[i2]);
    swap(v[Y[i1]][X[i1]], v[Y[i2]][X[i2]]);
    for(int i = 0; i < 2; i++)
        for(int j = 0; j < 2; j++){
            calc(Y[i1] + i, X[i1] + j, 1);
            calc(Y[i2] + i, X[i2] + j, 1);
        }
    if(seg[1] == 4) return cnt[1];
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 8652 KB Output is correct
2 Correct 62 ms 8712 KB Output is correct
3 Correct 68 ms 8728 KB Output is correct
4 Correct 58 ms 8720 KB Output is correct
5 Correct 56 ms 8756 KB Output is correct
6 Correct 68 ms 8720 KB Output is correct
7 Correct 66 ms 8720 KB Output is correct
8 Correct 64 ms 8788 KB Output is correct
9 Correct 60 ms 8744 KB Output is correct
10 Correct 67 ms 8716 KB Output is correct
11 Correct 64 ms 8724 KB Output is correct
12 Correct 57 ms 8756 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 8652 KB Output is correct
2 Correct 62 ms 8712 KB Output is correct
3 Correct 68 ms 8728 KB Output is correct
4 Correct 58 ms 8720 KB Output is correct
5 Correct 56 ms 8756 KB Output is correct
6 Correct 68 ms 8720 KB Output is correct
7 Correct 66 ms 8720 KB Output is correct
8 Correct 64 ms 8788 KB Output is correct
9 Correct 60 ms 8744 KB Output is correct
10 Correct 67 ms 8716 KB Output is correct
11 Correct 64 ms 8724 KB Output is correct
12 Correct 57 ms 8756 KB Output is correct
13 Correct 90 ms 9240 KB Output is correct
14 Correct 110 ms 9292 KB Output is correct
15 Correct 81 ms 9352 KB Output is correct
16 Correct 62 ms 9684 KB Output is correct
17 Correct 84 ms 9312 KB Output is correct
18 Correct 73 ms 9252 KB Output is correct
19 Correct 69 ms 9288 KB Output is correct
20 Correct 66 ms 9484 KB Output is correct
21 Correct 64 ms 9372 KB Output is correct
22 Correct 65 ms 9772 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2005 ms 51696 KB Output is correct
2 Correct 1014 ms 57496 KB Output is correct
3 Correct 918 ms 57432 KB Output is correct
4 Correct 823 ms 57492 KB Output is correct
5 Correct 878 ms 57472 KB Output is correct
6 Correct 794 ms 57444 KB Output is correct
7 Correct 856 ms 57424 KB Output is correct
8 Correct 904 ms 57488 KB Output is correct
9 Correct 910 ms 57548 KB Output is correct
10 Correct 862 ms 57360 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 9088 KB Output is correct
2 Correct 170 ms 13056 KB Output is correct
3 Correct 843 ms 57408 KB Output is correct
4 Correct 2098 ms 57480 KB Output is correct
5 Correct 1080 ms 60368 KB Output is correct
6 Correct 2163 ms 103428 KB Output is correct
7 Correct 976 ms 55168 KB Output is correct
8 Correct 958 ms 52736 KB Output is correct
9 Correct 886 ms 52936 KB Output is correct
10 Correct 923 ms 57204 KB Output is correct
11 Correct 960 ms 74996 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 630 ms 9604 KB Output is correct
2 Correct 618 ms 10072 KB Output is correct
3 Correct 557 ms 10152 KB Output is correct
4 Correct 506 ms 10112 KB Output is correct
5 Correct 610 ms 10616 KB Output is correct
6 Correct 1701 ms 65396 KB Output is correct
7 Correct 1928 ms 65268 KB Output is correct
8 Correct 1659 ms 65196 KB Output is correct
9 Correct 3209 ms 65268 KB Output is correct
10 Correct 1622 ms 65316 KB Output is correct
11 Correct 1647 ms 65512 KB Output is correct
12 Correct 1567 ms 65232 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 8652 KB Output is correct
2 Correct 62 ms 8712 KB Output is correct
3 Correct 68 ms 8728 KB Output is correct
4 Correct 58 ms 8720 KB Output is correct
5 Correct 56 ms 8756 KB Output is correct
6 Correct 68 ms 8720 KB Output is correct
7 Correct 66 ms 8720 KB Output is correct
8 Correct 64 ms 8788 KB Output is correct
9 Correct 60 ms 8744 KB Output is correct
10 Correct 67 ms 8716 KB Output is correct
11 Correct 64 ms 8724 KB Output is correct
12 Correct 57 ms 8756 KB Output is correct
13 Correct 90 ms 9240 KB Output is correct
14 Correct 110 ms 9292 KB Output is correct
15 Correct 81 ms 9352 KB Output is correct
16 Correct 62 ms 9684 KB Output is correct
17 Correct 84 ms 9312 KB Output is correct
18 Correct 73 ms 9252 KB Output is correct
19 Correct 69 ms 9288 KB Output is correct
20 Correct 66 ms 9484 KB Output is correct
21 Correct 64 ms 9372 KB Output is correct
22 Correct 65 ms 9772 KB Output is correct
23 Correct 2005 ms 51696 KB Output is correct
24 Correct 1014 ms 57496 KB Output is correct
25 Correct 918 ms 57432 KB Output is correct
26 Correct 823 ms 57492 KB Output is correct
27 Correct 878 ms 57472 KB Output is correct
28 Correct 794 ms 57444 KB Output is correct
29 Correct 856 ms 57424 KB Output is correct
30 Correct 904 ms 57488 KB Output is correct
31 Correct 910 ms 57548 KB Output is correct
32 Correct 862 ms 57360 KB Output is correct
33 Correct 92 ms 9088 KB Output is correct
34 Correct 170 ms 13056 KB Output is correct
35 Correct 843 ms 57408 KB Output is correct
36 Correct 2098 ms 57480 KB Output is correct
37 Correct 1080 ms 60368 KB Output is correct
38 Correct 2163 ms 103428 KB Output is correct
39 Correct 976 ms 55168 KB Output is correct
40 Correct 958 ms 52736 KB Output is correct
41 Correct 886 ms 52936 KB Output is correct
42 Correct 923 ms 57204 KB Output is correct
43 Correct 960 ms 74996 KB Output is correct
44 Correct 630 ms 9604 KB Output is correct
45 Correct 618 ms 10072 KB Output is correct
46 Correct 557 ms 10152 KB Output is correct
47 Correct 506 ms 10112 KB Output is correct
48 Correct 610 ms 10616 KB Output is correct
49 Correct 1701 ms 65396 KB Output is correct
50 Correct 1928 ms 65268 KB Output is correct
51 Correct 1659 ms 65196 KB Output is correct
52 Correct 3209 ms 65268 KB Output is correct
53 Correct 1622 ms 65316 KB Output is correct
54 Correct 1647 ms 65512 KB Output is correct
55 Correct 1567 ms 65232 KB Output is correct
56 Correct 665 ms 10276 KB Output is correct
57 Correct 659 ms 10324 KB Output is correct
58 Correct 634 ms 10932 KB Output is correct
59 Correct 1686 ms 52072 KB Output is correct
60 Correct 3195 ms 52072 KB Output is correct
61 Correct 1529 ms 52044 KB Output is correct
62 Correct 1505 ms 55904 KB Output is correct
63 Correct 3253 ms 54644 KB Output is correct
64 Correct 1887 ms 52944 KB Output is correct
65 Correct 1535 ms 52044 KB Output is correct
66 Correct 1721 ms 52324 KB Output is correct
67 Correct 1851 ms 56840 KB Output is correct
68 Correct 1601 ms 66332 KB Output is correct
69 Correct 3026 ms 75496 KB Output is correct