oj.uz

Submission #623513

# Submission time Handle Problem Language Result Execution time Memory
623513 2022-08-05T17:51:52 Z Ronin13 Seats (IOI18_seats) C++14
100 / 100
 3271 ms 189660 KB 
#include "seats.h"
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;


std::vector<int> r;
std :: vector <int> c;
const  int NMAX = 1e6 + 5;
void add(int val);
void rem(int val);
int lazy[4 * NMAX];
pii t[4 * NMAX];
int n, m;
void push(int v){
    if(lazy[v] == 0) return;
    t[2 * v].f += lazy[v];
    t[2 * v + 1].f += lazy[v];
    lazy[2 * v] += lazy[v];
    lazy[2 * v + 1] += lazy[v];
    lazy[v] = 0;
    return;
}

pii merg(pii a, pii b){
    if(a.f < b.f)return a;
    if(a.f > b.f)return b;
    return {a.f, b.s + a.s};
}

void update(int v, int l, int r, int st, int fin, int val){
    if(st > fin) return;
    if(l > fin || r < st) return;
    if(l >= st && r <= fin) {
        t[v].f += val;
        lazy[v] += val;
        return;
    }
    int m = (l + r) / 2;
    push(v);
    update(2 * v, l, m, st, fin, val);
    update(2 * v +1, m + 1, r, st, fin, val);
    t[v] = merg(t[2 * v], t[2 * v + 1]);
}

void go(int v, int l, int r){
    if(l == r){
        t[v] = {0, 1};
        return;
    }
    int m = (l + r) / 2;
    go(2 * v, l, m);
    go(2 * v + 1, m + 1, r);
    t[v]= {0, t[2 * v].s + t[2 * v + 1].s};
}

vector <vector <int> > a;
vector <vector <bool> > used;
set <pii> st;
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    r = R;
    c = C;
    n = H, m = W;
    a.resize(n + 2);
    used.resize(n + 2);
    for(int i = 0; i <= n + 1; i++) a[i].resize(m + 2), used[i].resize(m + 2);
    go(1, 1, n * m);
    for(int i = 0; i <= n + 1; i++){
        for(int j = 0; j <= m + 1; j++) a[i][j] = n * m;
    }
    for(int i = 0; i < n * m; i++){
        int x = ++r[i], y= ++c[i];
        a[x][y] = i;
    }
    for(int i = 0; i < n * m; i++) add(i);
    for(int i = 0; i <= n + 1; i++) {
        for(int j = 0; j <= m + 1; j ++) used[i][j] = false;
    }
}

void add(int val){
    int x = r[val];
    int y = c[val];
    for(int i = x - 1; i <= x; i++){
        for(int j = y - 1; j <= y; j++){
            if(used[i][j]) continue;
            used[i][j] = true;
            vector <int> vec;
            vec.pb(a[i][j]);
            vec.pb(a[i][j + 1]);
            vec.pb(a[i + 1][j]);
            vec.pb(a[i + 1][j + 1]);
            sort(vec.begin(), vec.end());
            update(1, 1, n * m, vec[0] + 1, vec[1], 1);
           // update(1, 1, n * m, vec[1] + 1, vec[2], -1);
            update(1, 1, n * m, vec[2] + 1, vec[3], 1);
        }
    }
}

void rem(int val){
    int x = r[val];
    int y = c[val];
    for(int i = x - 1; i <= x; i++){
        for(int j = y - 1; j <= y; j++){
            if(used[i][j]) continue;
            used[i][j] = true;
            vector <int> vec;
            vec.pb(a[i][j]);
            vec.pb(a[i][j + 1]);
            vec.pb(a[i + 1][j]);
            vec.pb(a[i + 1][j + 1]);
            sort(vec.begin(), vec.end());
            update(1, 1, n * m, vec[0] + 1, vec[1], -1);
           // update(1, 1, n * m, vec[1] + 1, vec[2], 1);
            update(1, 1, n * m, vec[2] + 1, vec[3], -1);
        }
    }
}

void cl(int val){
    int x = r[val];
    int y = c[val];
    for(int i = x - 1; i <= x; i++){
        for(int j = y - 1; j <= y; j++){
            used[i][j] = false;
        }
    }
}

int swap_seats(int A, int B) {
    //cout << t[1].s << "\n";
    rem(A);
    rem(B);
    cl(A);
    cl(B);
    swap(r[A], r[B]);
    swap(c[A], c[B]);
    a[r[A]][c[A]] = A;
    a[r[B]][c[B]] = B;
    add(A);
    add(B);
    cl(A);
    cl(B);
    if(t[1].f == 4) return t[1].s;
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 340 KB Output is correct
2 Correct 34 ms 368 KB Output is correct
3 Correct 46 ms 396 KB Output is correct
4 Correct 31 ms 376 KB Output is correct
5 Correct 23 ms 416 KB Output is correct
6 Correct 33 ms 372 KB Output is correct
7 Correct 34 ms 392 KB Output is correct
8 Correct 31 ms 384 KB Output is correct
9 Correct 31 ms 388 KB Output is correct
10 Correct 33 ms 340 KB Output is correct
11 Correct 32 ms 368 KB Output is correct
12 Correct 23 ms 340 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 340 KB Output is correct
2 Correct 34 ms 368 KB Output is correct
3 Correct 46 ms 396 KB Output is correct
4 Correct 31 ms 376 KB Output is correct
5 Correct 23 ms 416 KB Output is correct
6 Correct 33 ms 372 KB Output is correct
7 Correct 34 ms 392 KB Output is correct
8 Correct 31 ms 384 KB Output is correct
9 Correct 31 ms 388 KB Output is correct
10 Correct 33 ms 340 KB Output is correct
11 Correct 32 ms 368 KB Output is correct
12 Correct 23 ms 340 KB Output is correct
13 Correct 79 ms 1012 KB Output is correct
14 Correct 90 ms 1000 KB Output is correct
15 Correct 50 ms 1100 KB Output is correct
16 Correct 40 ms 2252 KB Output is correct
17 Correct 61 ms 1044 KB Output is correct
18 Correct 60 ms 1012 KB Output is correct
19 Correct 58 ms 1108 KB Output is correct
20 Correct 51 ms 1592 KB Output is correct
21 Correct 41 ms 1092 KB Output is correct
22 Correct 45 ms 2216 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2190 ms 52672 KB Output is correct
2 Correct 1067 ms 52732 KB Output is correct
3 Correct 981 ms 52612 KB Output is correct
4 Correct 960 ms 68532 KB Output is correct
5 Correct 999 ms 68536 KB Output is correct
6 Correct 945 ms 68676 KB Output is correct
7 Correct 983 ms 68540 KB Output is correct
8 Correct 922 ms 68500 KB Output is correct
9 Correct 945 ms 68572 KB Output is correct
10 Correct 935 ms 68668 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 1012 KB Output is correct
2 Correct 154 ms 5820 KB Output is correct
3 Correct 976 ms 52648 KB Output is correct
4 Correct 2119 ms 52600 KB Output is correct
5 Correct 982 ms 76592 KB Output is correct
6 Correct 2176 ms 189660 KB Output is correct
7 Correct 974 ms 71028 KB Output is correct
8 Correct 981 ms 68464 KB Output is correct
9 Correct 891 ms 69428 KB Output is correct
10 Correct 1038 ms 80036 KB Output is correct
11 Correct 1046 ms 126984 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 1264 KB Output is correct
2 Correct 154 ms 1276 KB Output is correct
3 Correct 216 ms 1416 KB Output is correct
4 Correct 261 ms 1324 KB Output is correct
5 Correct 392 ms 2060 KB Output is correct
6 Correct 1481 ms 60992 KB Output is correct
7 Correct 1642 ms 60928 KB Output is correct
8 Correct 1454 ms 60988 KB Output is correct
9 Correct 2407 ms 60928 KB Output is correct
10 Correct 1425 ms 60996 KB Output is correct
11 Correct 1412 ms 60844 KB Output is correct
12 Correct 1375 ms 60996 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 340 KB Output is correct
2 Correct 34 ms 368 KB Output is correct
3 Correct 46 ms 396 KB Output is correct
4 Correct 31 ms 376 KB Output is correct
5 Correct 23 ms 416 KB Output is correct
6 Correct 33 ms 372 KB Output is correct
7 Correct 34 ms 392 KB Output is correct
8 Correct 31 ms 384 KB Output is correct
9 Correct 31 ms 388 KB Output is correct
10 Correct 33 ms 340 KB Output is correct
11 Correct 32 ms 368 KB Output is correct
12 Correct 23 ms 340 KB Output is correct
13 Correct 79 ms 1012 KB Output is correct
14 Correct 90 ms 1000 KB Output is correct
15 Correct 50 ms 1100 KB Output is correct
16 Correct 40 ms 2252 KB Output is correct
17 Correct 61 ms 1044 KB Output is correct
18 Correct 60 ms 1012 KB Output is correct
19 Correct 58 ms 1108 KB Output is correct
20 Correct 51 ms 1592 KB Output is correct
21 Correct 41 ms 1092 KB Output is correct
22 Correct 45 ms 2216 KB Output is correct
23 Correct 2190 ms 52672 KB Output is correct
24 Correct 1067 ms 52732 KB Output is correct
25 Correct 981 ms 52612 KB Output is correct
26 Correct 960 ms 68532 KB Output is correct
27 Correct 999 ms 68536 KB Output is correct
28 Correct 945 ms 68676 KB Output is correct
29 Correct 983 ms 68540 KB Output is correct
30 Correct 922 ms 68500 KB Output is correct
31 Correct 945 ms 68572 KB Output is correct
32 Correct 935 ms 68668 KB Output is correct
33 Correct 72 ms 1012 KB Output is correct
34 Correct 154 ms 5820 KB Output is correct
35 Correct 976 ms 52648 KB Output is correct
36 Correct 2119 ms 52600 KB Output is correct
37 Correct 982 ms 76592 KB Output is correct
38 Correct 2176 ms 189660 KB Output is correct
39 Correct 974 ms 71028 KB Output is correct
40 Correct 981 ms 68464 KB Output is correct
41 Correct 891 ms 69428 KB Output is correct
42 Correct 1038 ms 80036 KB Output is correct
43 Correct 1046 ms 126984 KB Output is correct
44 Correct 120 ms 1264 KB Output is correct
45 Correct 154 ms 1276 KB Output is correct
46 Correct 216 ms 1416 KB Output is correct
47 Correct 261 ms 1324 KB Output is correct
48 Correct 392 ms 2060 KB Output is correct
49 Correct 1481 ms 60992 KB Output is correct
50 Correct 1642 ms 60928 KB Output is correct
51 Correct 1454 ms 60988 KB Output is correct
52 Correct 2407 ms 60928 KB Output is correct
53 Correct 1425 ms 60996 KB Output is correct
54 Correct 1412 ms 60844 KB Output is correct
55 Correct 1375 ms 60996 KB Output is correct
56 Correct 181 ms 1936 KB Output is correct
57 Correct 359 ms 1988 KB Output is correct
58 Correct 548 ms 2660 KB Output is correct
59 Correct 1741 ms 69560 KB Output is correct
60 Correct 3271 ms 69556 KB Output is correct
61 Correct 1591 ms 69616 KB Output is correct
62 Correct 1471 ms 73528 KB Output is correct
63 Correct 2893 ms 72240 KB Output is correct
64 Correct 1973 ms 70300 KB Output is correct
65 Correct 1631 ms 69480 KB Output is correct
66 Correct 1818 ms 70384 KB Output is correct
67 Correct 2088 ms 81072 KB Output is correct
68 Correct 1592 ms 107116 KB Output is correct
69 Correct 3008 ms 128068 KB Output is correct