oj.uz

답안 #365028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365028 2021-02-10T19:01:30 Z wiwiho 자리 배치 (IOI18_seats) C++14
100 / 100
 3903 ms 126720 KB 
#include "seats.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) (((a) + (b) - 1) / (b))
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream &operator<<(ostream &o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

struct Node{
//    int l = -1, r = -1;
    int mn = 0, cnt = 0, tag = 0;

    int rmn(){
        return mn + tag;
    }
};

int n;

#define lc(id) ((id) * 2 + 1)
#define rc(id) ((id) * 2 + 2)

struct SegmentTree{

    vector<Node> st;
    int ts = 0;

    void build(int l = 0, int r = n - 1, int id = 0){
        st[id].cnt = r - l + 1;
        if(l == r) return;
        int m = (l + r) / 2;
        build(l, m, lc(id));
        build(m + 1, r, rc(id));
    }

    void pull(int id){
        int l = lc(id), r = rc(id);
        st[id].mn = min(st[l].rmn(), st[r].rmn());
        st[id].cnt = 0;
        if(st[l].rmn() == st[id].mn) st[id].cnt += st[l].cnt;
        if(st[r].rmn() == st[id].mn) st[id].cnt += st[r].cnt;
    }

    void modify(int l, int r, int v, int L = 0, int R = n - 1, int id = 0){
//        cerr << l << " " << r << " " << L << " " << R << "\n";
        if(l == L && r == R){
            st[id].tag += v;
            return;
        }
        int M = (L + R) / 2;
        if(r <= M) modify(l, r, v, L, M, lc(id));
        else if(l > M) modify(l, r, v, M + 1, R, rc(id));
        else{
            modify(l, M, v, L, M, lc(id));
            modify(M + 1, r, v, M + 1, R, rc(id));
        }
        pull(id);
    }

};

SegmentTree st;
vector<vector<int>> seat;
int h, w;

void add(int x, int y){
    vector<int> t;
    for(int i = 0; i <= 1; i++){
        for(int j = 0; j <= 1; j++){
            if(seat[x + i][y + j] != -1) t.eb(seat[x + i][y + j]);
        }
    }
    lsort(t);
    if(!t.empty()){
        int l = t[0];
        int r = t.size() >= 2 ? t[1] : h * w;
        r--;
        if(l <= r) st.modify(l, r, 1);
    }
    if(t.size() >= 3){
        int l = t[2];
        int r = t.size() >= 4 ? t[3] : h * w;
        r--;
        if(l <= r) st.modify(l, r, 1);
    }
}

void del(int x, int y){
    vector<int> t;
    for(int i = 0; i <= 1; i++){
        for(int j = 0; j <= 1; j++){
            if(seat[x + i][y + j] != -1) t.eb(seat[x + i][y + j]);
        }
    }
    lsort(t);
    if(!t.empty()){
        int l = t[0];
        int r = t.size() >= 2 ? t[1] : h * w;
        r--;
        if(l <= r) st.modify(l, r, -1);
    }
    if(t.size() >= 3){
        int l = t[2];
        int r = t.size() >= 4 ? t[3] : h * w;
        r--;
        if(l <= r) st.modify(l, r, -1);
    }
}

void update(int x, int y, int v){
    for(int i = -1; i <= 0; i++){
        for(int j = -1; j <= 0; j++){
            del(x + i, y + j);
        }
    }
    seat[x][y] = v;
    for(int i = -1; i <= 0; i++){
        for(int j = -1; j <= 0; j++){
            add(x + i, y + j);
        }
    }
}

int ans(){
    return st.st[0].rmn() == 4 ? st.st[0].cnt : 0;
}

vector<pii> pos;

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C){
    h = H;
    w = W;
    seat.resize(h + 2, vector<int>(w + 2, -1));
    pos.resize(h * w);
    for(int i = 0; i < h * w; i++){
        seat[R[i] + 1][C[i] + 1] = i;
        pos[i] = mp(R[i] + 1, C[i] + 1);
    }
    st.st.resize(4 * H * W);
    n = H * W;
    st.build();
    for(int i = 0; i <= H; i++){
        for(int j = 0; j <= W; j++){
            add(i, j);
        }
    }
//    for(int i = 1; i <= h; i++){
//        for(int j = 0; j <= w; j++){
//            cerr << seat[i][j] << " ";
//        }
//        cerr << "\n";
//    }
//    cerr << ans() << "\n";
}

int swap_seats(int a, int b){
    update(pos[a].F, pos[a].S, b);
    update(pos[b].F, pos[b].S, a);
    swap(pos[a], pos[b]);
    return ans();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 640 KB Output is correct
2 Correct 32 ms 492 KB Output is correct
3 Correct 49 ms 492 KB Output is correct
4 Correct 22 ms 492 KB Output is correct
5 Correct 20 ms 492 KB Output is correct
6 Correct 33 ms 492 KB Output is correct
7 Correct 36 ms 620 KB Output is correct
8 Correct 34 ms 492 KB Output is correct
9 Correct 33 ms 492 KB Output is correct
10 Correct 41 ms 512 KB Output is correct
11 Correct 33 ms 512 KB Output is correct
12 Correct 23 ms 492 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 640 KB Output is correct
2 Correct 32 ms 492 KB Output is correct
3 Correct 49 ms 492 KB Output is correct
4 Correct 22 ms 492 KB Output is correct
5 Correct 20 ms 492 KB Output is correct
6 Correct 33 ms 492 KB Output is correct
7 Correct 36 ms 620 KB Output is correct
8 Correct 34 ms 492 KB Output is correct
9 Correct 33 ms 492 KB Output is correct
10 Correct 41 ms 512 KB Output is correct
11 Correct 33 ms 512 KB Output is correct
12 Correct 23 ms 492 KB Output is correct
13 Correct 83 ms 1340 KB Output is correct
14 Correct 98 ms 1260 KB Output is correct
15 Correct 59 ms 1664 KB Output is correct
16 Correct 45 ms 1792 KB Output is correct
17 Correct 72 ms 1388 KB Output is correct
18 Correct 80 ms 1260 KB Output is correct
19 Correct 67 ms 1408 KB Output is correct
20 Correct 58 ms 1516 KB Output is correct
21 Correct 44 ms 1388 KB Output is correct
22 Correct 44 ms 1772 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2637 ms 75784 KB Output is correct
2 Correct 1322 ms 75856 KB Output is correct
3 Correct 1307 ms 75856 KB Output is correct
4 Correct 1122 ms 75884 KB Output is correct
5 Correct 1160 ms 75884 KB Output is correct
6 Correct 1145 ms 75856 KB Output is correct
7 Correct 1202 ms 75884 KB Output is correct
8 Correct 1242 ms 75912 KB Output is correct
9 Correct 1355 ms 75884 KB Output is correct
10 Correct 1238 ms 75856 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 1388 KB Output is correct
2 Correct 194 ms 8044 KB Output is correct
3 Correct 1159 ms 76012 KB Output is correct
4 Correct 2517 ms 75884 KB Output is correct
5 Correct 1163 ms 83620 KB Output is correct
6 Correct 2446 ms 126720 KB Output is correct
7 Correct 1143 ms 78420 KB Output is correct
8 Correct 1355 ms 75928 KB Output is correct
9 Correct 1215 ms 76296 KB Output is correct
10 Correct 1260 ms 80492 KB Output is correct
11 Correct 1178 ms 99336 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 2024 KB Output is correct
2 Correct 136 ms 2188 KB Output is correct
3 Correct 201 ms 2024 KB Output is correct
4 Correct 278 ms 2152 KB Output is correct
5 Correct 427 ms 3060 KB Output is correct
6 Correct 1719 ms 83040 KB Output is correct
7 Correct 1982 ms 82980 KB Output is correct
8 Correct 1654 ms 83004 KB Output is correct
9 Correct 3233 ms 83004 KB Output is correct
10 Correct 1666 ms 82912 KB Output is correct
11 Correct 1648 ms 83108 KB Output is correct
12 Correct 1610 ms 83108 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 640 KB Output is correct
2 Correct 32 ms 492 KB Output is correct
3 Correct 49 ms 492 KB Output is correct
4 Correct 22 ms 492 KB Output is correct
5 Correct 20 ms 492 KB Output is correct
6 Correct 33 ms 492 KB Output is correct
7 Correct 36 ms 620 KB Output is correct
8 Correct 34 ms 492 KB Output is correct
9 Correct 33 ms 492 KB Output is correct
10 Correct 41 ms 512 KB Output is correct
11 Correct 33 ms 512 KB Output is correct
12 Correct 23 ms 492 KB Output is correct
13 Correct 83 ms 1340 KB Output is correct
14 Correct 98 ms 1260 KB Output is correct
15 Correct 59 ms 1664 KB Output is correct
16 Correct 45 ms 1792 KB Output is correct
17 Correct 72 ms 1388 KB Output is correct
18 Correct 80 ms 1260 KB Output is correct
19 Correct 67 ms 1408 KB Output is correct
20 Correct 58 ms 1516 KB Output is correct
21 Correct 44 ms 1388 KB Output is correct
22 Correct 44 ms 1772 KB Output is correct
23 Correct 2637 ms 75784 KB Output is correct
24 Correct 1322 ms 75856 KB Output is correct
25 Correct 1307 ms 75856 KB Output is correct
26 Correct 1122 ms 75884 KB Output is correct
27 Correct 1160 ms 75884 KB Output is correct
28 Correct 1145 ms 75856 KB Output is correct
29 Correct 1202 ms 75884 KB Output is correct
30 Correct 1242 ms 75912 KB Output is correct
31 Correct 1355 ms 75884 KB Output is correct
32 Correct 1238 ms 75856 KB Output is correct
33 Correct 82 ms 1388 KB Output is correct
34 Correct 194 ms 8044 KB Output is correct
35 Correct 1159 ms 76012 KB Output is correct
36 Correct 2517 ms 75884 KB Output is correct
37 Correct 1163 ms 83620 KB Output is correct
38 Correct 2446 ms 126720 KB Output is correct
39 Correct 1143 ms 78420 KB Output is correct
40 Correct 1355 ms 75928 KB Output is correct
41 Correct 1215 ms 76296 KB Output is correct
42 Correct 1260 ms 80492 KB Output is correct
43 Correct 1178 ms 99336 KB Output is correct
44 Correct 90 ms 2024 KB Output is correct
45 Correct 136 ms 2188 KB Output is correct
46 Correct 201 ms 2024 KB Output is correct
47 Correct 278 ms 2152 KB Output is correct
48 Correct 427 ms 3060 KB Output is correct
49 Correct 1719 ms 83040 KB Output is correct
50 Correct 1982 ms 82980 KB Output is correct
51 Correct 1654 ms 83004 KB Output is correct
52 Correct 3233 ms 83004 KB Output is correct
53 Correct 1666 ms 82912 KB Output is correct
54 Correct 1648 ms 83108 KB Output is correct
55 Correct 1610 ms 83108 KB Output is correct
56 Correct 175 ms 2024 KB Output is correct
57 Correct 381 ms 2024 KB Output is correct
58 Correct 650 ms 2988 KB Output is correct
59 Correct 2179 ms 75244 KB Output is correct
60 Correct 3903 ms 75244 KB Output is correct
61 Correct 2116 ms 91884 KB Output is correct
62 Correct 1798 ms 95816 KB Output is correct
63 Correct 3736 ms 94420 KB Output is correct
64 Correct 2376 ms 92516 KB Output is correct
65 Correct 2074 ms 91928 KB Output is correct
66 Correct 2245 ms 92012 KB Output is correct
67 Correct 2308 ms 96492 KB Output is correct
68 Correct 1910 ms 106216 KB Output is correct
69 Correct 3492 ms 115180 KB Output is correct