oj.uz

답안 #640048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
640048 2022-09-13T11:54:38 Z qwerasdfzxcl 자리 배치 (IOI18_seats) C++17
100 / 100
 690 ms 162880 KB 
#include "seats.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int INF = 1e9+100;

struct Node{
    int prf, sum, cnt;
    Node(){}
    Node(int _prf, int _sum, int _cnt): prf(_prf), sum(_sum), cnt(_cnt) {}
    Node operator + (const Node &N) const{
        int tmp = sum + N.prf;
        if (tmp < prf) return Node(tmp, sum + N.sum, N.cnt);
        if (tmp > prf) return Node(prf, sum + N.sum, cnt);
        return Node(prf, sum + N.sum, cnt + N.cnt);
    }
};

struct Seg{
    Node tree[2202000];
    int sz;
    void init(int n, int a[]){
        sz = 1048576;
        for (int i=sz;i<sz+n;i++) tree[i] = Node(a[i-sz], a[i-sz], 1);
        for (int i=sz+n;i<sz*2;i++) tree[i] = Node(INF, 0, 0);
        for (int i=sz-1;i;i--) tree[i] = tree[i<<1] + tree[i<<1|1];
    }
    void update(int p, int x){
        p += sz-1;
        tree[p] = Node(x, x, 1);
        for (p>>=1;p;p>>=1) tree[p] = tree[p<<1] + tree[p<<1|1];
    }
}tree;

vector<vector<int>> a, chk;
int n, m, d[1001000], X[1001000], Y[1001000], dx[4] = {0, 0, 1, 1}, dy[4] = {0, 1, 0, 1};

void calc(int x, int y, int o){
    pair<int, int> adj[4];
    for (int k=0;k<4;k++){
        adj[k] = {a[x+dx[k]][y+dy[k]], k};
    }
    sort(adj, adj+4);

    int tmp[5] = {0};
    tmp[1] = 1;
    tmp[2] = (adj[0].second+adj[1].second==3)?1:0;
    tmp[3] = 1;
    tmp[4] = 0;

    for (int i=1;i<=4;i++) if (adj[i-1].first < INF){
        if (o) d[adj[i-1].first] += (tmp[i] - tmp[i-1]);
        else d[adj[i-1].first] -= (tmp[i]-tmp[i-1]);
    }
}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    n = H, m = W;
    a.resize(n+2, vector<int>(m+2, INF));
    chk.resize(n+2, vector<int>(m+2, 0));
    for (int i=1;i<=n*m;i++){
        a[R[i-1] + 1][C[i-1] + 1] = i;
        X[i] = R[i-1] + 1;
        Y[i] = C[i-1] + 1;
    }

    for (int i=0;i<=n;i++){
        for (int j=0;j<=m;j++){
            calc(i, j, 1);
        }
    }

    tree.init(n*m, d+1);
    //for (int i=1;i<=n*m;i++) tree.update(i, d[i]);
}

int swap_seats(int A, int B) {
    ++A, ++B;
    int C[2] = {A, B};
    for (auto p:C){
        for (int i=-1;i<=0;i++){
            for (int j=-1;j<=0;j++) if (!chk[X[p]+i][Y[p]+j]){
                calc(X[p]+i, Y[p]+j, 0);
                chk[X[p]+i][Y[p]+j] = 1;
            }
        }
    }

    swap(a[X[A]][Y[A]], a[X[B]][Y[B]]);
    swap(X[A], X[B]);
    swap(Y[A], Y[B]);

    for (auto p:C){
        for (int i=-1;i<=0;i++){
            for (int j=-1;j<=0;j++) if (chk[X[p]+i][Y[p]+j]){
                calc(X[p]+i, Y[p]+j, 1);
                chk[X[p]+i][Y[p]+j] = 0;
            }
        }
    }

    for (auto p:C){
        for (int i=-1;i<=1;i++){
            for (int j=-1;j<=1;j++) if (a[X[p]+i][Y[p]+j] < INF){
                tree.update(a[X[p]+i][Y[p]+j], d[a[X[p]+i][Y[p]+j]]);
            }
        }
    }

    return tree.tree[1].cnt;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25044 KB Output is correct
2 Correct 25 ms 25068 KB Output is correct
3 Correct 26 ms 25044 KB Output is correct
4 Correct 21 ms 25080 KB Output is correct
5 Correct 20 ms 25076 KB Output is correct
6 Correct 24 ms 25116 KB Output is correct
7 Correct 28 ms 25044 KB Output is correct
8 Correct 26 ms 25108 KB Output is correct
9 Correct 26 ms 25044 KB Output is correct
10 Correct 26 ms 25100 KB Output is correct
11 Correct 23 ms 25084 KB Output is correct
12 Correct 21 ms 25120 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25044 KB Output is correct
2 Correct 25 ms 25068 KB Output is correct
3 Correct 26 ms 25044 KB Output is correct
4 Correct 21 ms 25080 KB Output is correct
5 Correct 20 ms 25076 KB Output is correct
6 Correct 24 ms 25116 KB Output is correct
7 Correct 28 ms 25044 KB Output is correct
8 Correct 26 ms 25108 KB Output is correct
9 Correct 26 ms 25044 KB Output is correct
10 Correct 26 ms 25100 KB Output is correct
11 Correct 23 ms 25084 KB Output is correct
12 Correct 21 ms 25120 KB Output is correct
13 Correct 31 ms 25436 KB Output is correct
14 Correct 31 ms 25468 KB Output is correct
15 Correct 23 ms 25620 KB Output is correct
16 Correct 29 ms 26560 KB Output is correct
17 Correct 32 ms 25620 KB Output is correct
18 Correct 31 ms 25536 KB Output is correct
19 Correct 31 ms 25600 KB Output is correct
20 Correct 27 ms 25956 KB Output is correct
21 Correct 23 ms 25732 KB Output is correct
22 Correct 26 ms 26536 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 344 ms 61284 KB Output is correct
2 Correct 297 ms 61244 KB Output is correct
3 Correct 288 ms 61144 KB Output is correct
4 Correct 289 ms 61172 KB Output is correct
5 Correct 287 ms 61224 KB Output is correct
6 Correct 296 ms 61240 KB Output is correct
7 Correct 285 ms 61104 KB Output is correct
8 Correct 288 ms 61068 KB Output is correct
9 Correct 284 ms 61136 KB Output is correct
10 Correct 291 ms 61140 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 25540 KB Output is correct
2 Correct 56 ms 28488 KB Output is correct
3 Correct 287 ms 61240 KB Output is correct
4 Correct 346 ms 61212 KB Output is correct
5 Correct 308 ms 80780 KB Output is correct
6 Correct 528 ms 162880 KB Output is correct
7 Correct 296 ms 67364 KB Output is correct
8 Correct 307 ms 61084 KB Output is correct
9 Correct 305 ms 61512 KB Output is correct
10 Correct 313 ms 70212 KB Output is correct
11 Correct 331 ms 107720 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 26184 KB Output is correct
2 Correct 76 ms 26184 KB Output is correct
3 Correct 79 ms 26216 KB Output is correct
4 Correct 88 ms 26260 KB Output is correct
5 Correct 87 ms 26652 KB Output is correct
6 Correct 452 ms 80828 KB Output is correct
7 Correct 469 ms 80648 KB Output is correct
8 Correct 430 ms 80772 KB Output is correct
9 Correct 476 ms 80780 KB Output is correct
10 Correct 396 ms 80776 KB Output is correct
11 Correct 408 ms 80672 KB Output is correct
12 Correct 408 ms 80432 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25044 KB Output is correct
2 Correct 25 ms 25068 KB Output is correct
3 Correct 26 ms 25044 KB Output is correct
4 Correct 21 ms 25080 KB Output is correct
5 Correct 20 ms 25076 KB Output is correct
6 Correct 24 ms 25116 KB Output is correct
7 Correct 28 ms 25044 KB Output is correct
8 Correct 26 ms 25108 KB Output is correct
9 Correct 26 ms 25044 KB Output is correct
10 Correct 26 ms 25100 KB Output is correct
11 Correct 23 ms 25084 KB Output is correct
12 Correct 21 ms 25120 KB Output is correct
13 Correct 31 ms 25436 KB Output is correct
14 Correct 31 ms 25468 KB Output is correct
15 Correct 23 ms 25620 KB Output is correct
16 Correct 29 ms 26560 KB Output is correct
17 Correct 32 ms 25620 KB Output is correct
18 Correct 31 ms 25536 KB Output is correct
19 Correct 31 ms 25600 KB Output is correct
20 Correct 27 ms 25956 KB Output is correct
21 Correct 23 ms 25732 KB Output is correct
22 Correct 26 ms 26536 KB Output is correct
23 Correct 344 ms 61284 KB Output is correct
24 Correct 297 ms 61244 KB Output is correct
25 Correct 288 ms 61144 KB Output is correct
26 Correct 289 ms 61172 KB Output is correct
27 Correct 287 ms 61224 KB Output is correct
28 Correct 296 ms 61240 KB Output is correct
29 Correct 285 ms 61104 KB Output is correct
30 Correct 288 ms 61068 KB Output is correct
31 Correct 284 ms 61136 KB Output is correct
32 Correct 291 ms 61140 KB Output is correct
33 Correct 30 ms 25540 KB Output is correct
34 Correct 56 ms 28488 KB Output is correct
35 Correct 287 ms 61240 KB Output is correct
36 Correct 346 ms 61212 KB Output is correct
37 Correct 308 ms 80780 KB Output is correct
38 Correct 528 ms 162880 KB Output is correct
39 Correct 296 ms 67364 KB Output is correct
40 Correct 307 ms 61084 KB Output is correct
41 Correct 305 ms 61512 KB Output is correct
42 Correct 313 ms 70212 KB Output is correct
43 Correct 331 ms 107720 KB Output is correct
44 Correct 66 ms 26184 KB Output is correct
45 Correct 76 ms 26184 KB Output is correct
46 Correct 79 ms 26216 KB Output is correct
47 Correct 88 ms 26260 KB Output is correct
48 Correct 87 ms 26652 KB Output is correct
49 Correct 452 ms 80828 KB Output is correct
50 Correct 469 ms 80648 KB Output is correct
51 Correct 430 ms 80772 KB Output is correct
52 Correct 476 ms 80780 KB Output is correct
53 Correct 396 ms 80776 KB Output is correct
54 Correct 408 ms 80672 KB Output is correct
55 Correct 408 ms 80432 KB Output is correct
56 Correct 105 ms 26088 KB Output is correct
57 Correct 144 ms 25996 KB Output is correct
58 Correct 186 ms 26300 KB Output is correct
59 Correct 533 ms 60824 KB Output is correct
60 Correct 607 ms 60744 KB Output is correct
61 Correct 460 ms 60748 KB Output is correct
62 Correct 445 ms 70380 KB Output is correct
63 Correct 549 ms 67260 KB Output is correct
64 Correct 523 ms 62664 KB Output is correct
65 Correct 502 ms 60772 KB Output is correct
66 Correct 515 ms 61640 KB Output is correct
67 Correct 527 ms 69972 KB Output is correct
68 Correct 495 ms 89300 KB Output is correct
69 Correct 690 ms 107608 KB Output is correct