oj.uz

Submission #80221

# Submission time Handle Problem Language Result Execution time Memory
80221 2018-10-19T15:02:23 Z zubec Seats (IOI18_seats) C++14
100 / 100
 3647 ms 239032 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<int> r;

const int SZ = 1000100;

pair<int, int> t[SZ*4];

int ob[SZ*4];

vector <vector<int> > arr;

void build(int v, int l, int r){
    if (l == r){
        t[v].second = 1;
        return;
    }
    int mid = (l+r)>>1;
    build(v+v, l, mid);
    build(v+v+1, mid+1, r);
    t[v].second = t[v+v].second + t[v+v+1].second;
}

void push(int v){
    if (ob[v] == 0)
        return;
    t[v+v].first += ob[v];
    t[v+v+1].first += ob[v];
    ob[v+v] += ob[v];
    ob[v+v+1] += ob[v];
    ob[v] = 0;
}

void update(int v, int l, int r, int tl, int tr, int x){
    if (l > r || tl > r || l > tr || tl > tr)
        return;
    if (tl <= l && r <= tr){
        t[v].first += x;
        ob[v] += x;
        return;
    }
    int mid = (l+r)>>1;
    push(v);
    update(v+v, l, mid, tl, tr, x);
    update(v+v+1, mid+1, r, tl, tr, x);
    if (t[v+v].first < t[v+v+1].first){
        t[v] = t[v+v];
    } else
    if (t[v+v].first > t[v+v+1].first){
        t[v] = t[v+v+1];
    } else {
        t[v] = {t[v+v].first, t[v+v].second + t[v+v+1].second};
    }
}

int inf;

vector <int> R, C;

void upd(int x, int y, int add){
    update(1, 1, inf, arr[x][y] + 1, min({arr[x+1][y], arr[x][y+1], arr[x+1][y+1]}), add);
    update(1, 1, inf, arr[x+1][y] + 1, min({arr[x][y], arr[x][y+1], arr[x+1][y+1]}), add);
    update(1, 1, inf, arr[x][y+1] + 1, min({arr[x][y], arr[x+1][y], arr[x+1][y+1]}), add);
    update(1, 1, inf, arr[x+1][y+1] + 1, min({arr[x][y], arr[x+1][y], arr[x][y+1]}), add);
    update(1, 1, inf, max({arr[x+1][y], arr[x][y+1], arr[x+1][y+1]}) + 1, arr[x][y], add);
    update(1, 1, inf, max({arr[x][y], arr[x][y+1], arr[x+1][y+1]}) + 1, arr[x+1][y], add);
    update(1, 1, inf, max({arr[x][y], arr[x+1][y], arr[x+1][y+1]}) + 1, arr[x][y+1], add);
    update(1, 1, inf, max({arr[x][y], arr[x+1][y], arr[x][y+1]}) + 1, arr[x+1][y+1], add);
}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    ::R = R;
    ::C = C;
    inf = H*W;
    arr.resize(H+2, vector<int>(W+2, inf));
    for (int i = 0; i < H*W; i++){
        arr[R[i]+1][C[i]+1] = i;
    }
    build(1, 1, inf);

    for (int i = 0; i + 1 < arr.size(); i++){
        for (int j = 0; j + 1 < arr[i].size(); j++){
            upd(i, j, 1);
        }
    }

}


int swap_seats(int a, int b) {
    int x1 = R[a]+1, y1 = C[a]+1, x2 = R[b]+1, y2 = C[b]+1;
    swap(R[a], R[b]);
    swap(C[a], C[b]);
    map<pair<int, int>, int> mp1;
    mp1[{x1-1, y1-1}] = 1;
    mp1[{x1-1, y1}] = 1;
    mp1[{x1, y1-1}] = 1;
    mp1[{x1, y1}] = 1;
    mp1[{x2-1, y2-1}] = 1;
    mp1[{x2-1, y2}] = 1;
    mp1[{x2, y2-1}] = 1;
    mp1[{x2, y2}] = 1;
    for (auto it = mp1.begin(); it != mp1.end(); it++){
        int x = it->first.first, y = it->first.second;
        upd(x, y, -1);
    }
    swap(arr[x1][y1], arr[x2][y2]);
    for (auto it = mp1.begin(); it != mp1.end(); it++){
        int x = it->first.first, y = it->first.second;
        upd(x, y, 1);
    }

    return t[1].second;
}

/**

0 3 4
1 2 5

2 3 2
0 0
1 0
1 1
0 1
0 2
1 2
0 5
0 5

*/

Compilation message

seats.cpp: In function 'void give_initial_chart(int, int, std::vector<int>, std::vector<int>)':
seats.cpp:83:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i + 1 < arr.size(); i++){
                     ~~~~~~^~~~~~~~~~~~
seats.cpp:84:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j + 1 < arr[i].size(); j++){
                         ~~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 504 KB Output is correct
2 Correct 29 ms 560 KB Output is correct
3 Correct 42 ms 656 KB Output is correct
4 Correct 27 ms 760 KB Output is correct
5 Correct 23 ms 780 KB Output is correct
6 Correct 35 ms 820 KB Output is correct
7 Correct 38 ms 840 KB Output is correct
8 Correct 36 ms 944 KB Output is correct
9 Correct 37 ms 944 KB Output is correct
10 Correct 39 ms 964 KB Output is correct
11 Correct 35 ms 1024 KB Output is correct
12 Correct 24 ms 1028 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 504 KB Output is correct
2 Correct 29 ms 560 KB Output is correct
3 Correct 42 ms 656 KB Output is correct
4 Correct 27 ms 760 KB Output is correct
5 Correct 23 ms 780 KB Output is correct
6 Correct 35 ms 820 KB Output is correct
7 Correct 38 ms 840 KB Output is correct
8 Correct 36 ms 944 KB Output is correct
9 Correct 37 ms 944 KB Output is correct
10 Correct 39 ms 964 KB Output is correct
11 Correct 35 ms 1024 KB Output is correct
12 Correct 24 ms 1028 KB Output is correct
13 Correct 83 ms 1904 KB Output is correct
14 Correct 98 ms 1904 KB Output is correct
15 Correct 56 ms 1952 KB Output is correct
16 Correct 41 ms 2352 KB Output is correct
17 Correct 68 ms 2352 KB Output is correct
18 Correct 64 ms 2352 KB Output is correct
19 Correct 62 ms 2352 KB Output is correct
20 Correct 52 ms 2440 KB Output is correct
21 Correct 41 ms 2612 KB Output is correct
22 Correct 43 ms 3184 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2302 ms 68772 KB Output is correct
2 Correct 1314 ms 84520 KB Output is correct
3 Correct 1171 ms 98520 KB Output is correct
4 Correct 993 ms 108556 KB Output is correct
5 Correct 1122 ms 108576 KB Output is correct
6 Correct 949 ms 108576 KB Output is correct
7 Correct 1078 ms 118708 KB Output is correct
8 Correct 1106 ms 118708 KB Output is correct
9 Correct 1147 ms 118708 KB Output is correct
10 Correct 1166 ms 118708 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 118708 KB Output is correct
2 Correct 191 ms 118708 KB Output is correct
3 Correct 1074 ms 129828 KB Output is correct
4 Correct 2305 ms 130008 KB Output is correct
5 Correct 951 ms 137744 KB Output is correct
6 Correct 2264 ms 196696 KB Output is correct
7 Correct 991 ms 196696 KB Output is correct
8 Correct 1190 ms 196696 KB Output is correct
9 Correct 1092 ms 196696 KB Output is correct
10 Correct 1105 ms 196696 KB Output is correct
11 Correct 1016 ms 196696 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 196696 KB Output is correct
2 Correct 160 ms 196696 KB Output is correct
3 Correct 218 ms 196696 KB Output is correct
4 Correct 274 ms 196696 KB Output is correct
5 Correct 424 ms 196696 KB Output is correct
6 Correct 1491 ms 196696 KB Output is correct
7 Correct 1730 ms 199644 KB Output is correct
8 Correct 1464 ms 201056 KB Output is correct
9 Correct 2944 ms 201056 KB Output is correct
10 Correct 1456 ms 201132 KB Output is correct
11 Correct 1424 ms 201132 KB Output is correct
12 Correct 1351 ms 201176 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 504 KB Output is correct
2 Correct 29 ms 560 KB Output is correct
3 Correct 42 ms 656 KB Output is correct
4 Correct 27 ms 760 KB Output is correct
5 Correct 23 ms 780 KB Output is correct
6 Correct 35 ms 820 KB Output is correct
7 Correct 38 ms 840 KB Output is correct
8 Correct 36 ms 944 KB Output is correct
9 Correct 37 ms 944 KB Output is correct
10 Correct 39 ms 964 KB Output is correct
11 Correct 35 ms 1024 KB Output is correct
12 Correct 24 ms 1028 KB Output is correct
13 Correct 83 ms 1904 KB Output is correct
14 Correct 98 ms 1904 KB Output is correct
15 Correct 56 ms 1952 KB Output is correct
16 Correct 41 ms 2352 KB Output is correct
17 Correct 68 ms 2352 KB Output is correct
18 Correct 64 ms 2352 KB Output is correct
19 Correct 62 ms 2352 KB Output is correct
20 Correct 52 ms 2440 KB Output is correct
21 Correct 41 ms 2612 KB Output is correct
22 Correct 43 ms 3184 KB Output is correct
23 Correct 2302 ms 68772 KB Output is correct
24 Correct 1314 ms 84520 KB Output is correct
25 Correct 1171 ms 98520 KB Output is correct
26 Correct 993 ms 108556 KB Output is correct
27 Correct 1122 ms 108576 KB Output is correct
28 Correct 949 ms 108576 KB Output is correct
29 Correct 1078 ms 118708 KB Output is correct
30 Correct 1106 ms 118708 KB Output is correct
31 Correct 1147 ms 118708 KB Output is correct
32 Correct 1166 ms 118708 KB Output is correct
33 Correct 82 ms 118708 KB Output is correct
34 Correct 191 ms 118708 KB Output is correct
35 Correct 1074 ms 129828 KB Output is correct
36 Correct 2305 ms 130008 KB Output is correct
37 Correct 951 ms 137744 KB Output is correct
38 Correct 2264 ms 196696 KB Output is correct
39 Correct 991 ms 196696 KB Output is correct
40 Correct 1190 ms 196696 KB Output is correct
41 Correct 1092 ms 196696 KB Output is correct
42 Correct 1105 ms 196696 KB Output is correct
43 Correct 1016 ms 196696 KB Output is correct
44 Correct 80 ms 196696 KB Output is correct
45 Correct 160 ms 196696 KB Output is correct
46 Correct 218 ms 196696 KB Output is correct
47 Correct 274 ms 196696 KB Output is correct
48 Correct 424 ms 196696 KB Output is correct
49 Correct 1491 ms 196696 KB Output is correct
50 Correct 1730 ms 199644 KB Output is correct
51 Correct 1464 ms 201056 KB Output is correct
52 Correct 2944 ms 201056 KB Output is correct
53 Correct 1456 ms 201132 KB Output is correct
54 Correct 1424 ms 201132 KB Output is correct
55 Correct 1351 ms 201176 KB Output is correct
56 Correct 186 ms 201176 KB Output is correct
57 Correct 419 ms 201176 KB Output is correct
58 Correct 612 ms 201176 KB Output is correct
59 Correct 2025 ms 201176 KB Output is correct
60 Correct 3647 ms 201176 KB Output is correct
61 Correct 1931 ms 201176 KB Output is correct
62 Correct 1539 ms 201176 KB Output is correct
63 Correct 3638 ms 201176 KB Output is correct
64 Correct 2191 ms 201176 KB Output is correct
65 Correct 1823 ms 201176 KB Output is correct
66 Correct 2100 ms 201176 KB Output is correct
67 Correct 2094 ms 201176 KB Output is correct
68 Correct 1677 ms 215500 KB Output is correct
69 Correct 3171 ms 239032 KB Output is correct