oj.uz

Submission #722456

# Submission time Handle Problem Language Result Execution time Memory
722456 2023-04-12T02:57:44 Z definitelynotmee Seats (IOI18_seats) C++17
100 / 100
 2587 ms 72020 KB 
#include "seats.h"
#include <bits/stdc++.h>
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;
int n, m;

vector<int> v, rev;

inline int translate(int x, int y){
    return m*x+y;
}

inline pii detranslate(int id){
    return {id/m,id%m};
}

struct SegTree{
    struct seg{
        int mn, ct, sum;

        inline seg operator+(seg b){

            b.sum+=sum;
            b.mn+=sum;

            if(mn == b.mn)
                b.ct+=ct;
            if(mn < b.mn){
                b.ct = ct;
                b.mn = mn;
            }

            return b;
        }
    };

    vector<seg> tree;

    int q, val, sz;
    
    void build(int id, int l, int r){
        if(l == r){
            tree[id] = {0,1,0};
            return;
        }

        int e = id*2+1, d = id*2+2, m = (l+r)>>1;
        build(e,l,m);
        build(d,m+1,r);

        tree[id] = tree[e]+tree[d];
    }

    SegTree(int n = 1){
        tree.resize(4*n+4);
        sz = n;
        build(0,0,sz-1);
    }

    void update(int id, int l, int r){
        if(l > q || r < q)
            return;
        if(q <= l && r <= q){
            tree[id].mn+=val;
            tree[id].sum+=val;
            return;
        }

        int e = id*2+1, d = id*2+2, m = (l+r)>>1;
        update(e,l,m);
        update(d,m+1,r);
        tree[id] = tree[e] + tree[d];
    }    

    inline void makeupd(int l, int v){
        val = v;
        q = l;
        update(0,0,sz-1);
    }
} st;


inline void update(int x, int y, int type = 1){
    vector<int> vals;

    int dx[] = {0,0,1,1}, dy[] = {0,1,0,1};

    for(int i = 0; i < 4; i++){
        int xi = x+dx[i], yi = y + dy[i];

        if(xi < n && yi < m && xi >=0 && yi >= 0){
            vals.push_back(v[translate(xi,yi)]);
        }
    }
    sort(all(vals));

    int summing[] = {1,-1,1,-1};
    // cout << x << ' ' << y << endl;
    for(int i = 0; i < vals.size();i++){
        // cout << "update " << vals[i] << ' ' << n*m-1 << " => " << summing[i]*type << endl; 
        st.makeupd(vals[i],summing[i]*type);
    }
}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    //cout << 'a' << endl;
    
    n = H;
    m = W;
    v = vector<int>(n*m);
    rev = vector<int>(n*m);

    for(int i = 0; i < n*m; i++){
        v[R[i]*m+C[i]] = i;
        rev[i] = R[i]*m+C[i];
    }
    st = SegTree(n*m);

    for(int x = -1; x < n; x++){
        for(int y = -1; y < m; y++){
            update(x,y);
        }
    }

}

int swap_seats(int a, int b) {
    array<pii,2> c({detranslate(rev[a]), detranslate(rev[b])});
    int dx[] = {0,0,-1,-1};
    int dy[] = {0,-1,-1,0};


    for(int i = 0; i < 4; i ++){
        for(int j = 0; j < 2; j++){
            int x = c[j].ff + dx[i], y = c[j].ss + dy[i];
            update(x,y,-1);
        }
    }

    swap(v[rev[a]],v[rev[b]]);
    swap(rev[a],rev[b]);

    for(int i = 0; i < 4; i ++){
        for(int j = 0; j < 2; j++){
            int x = c[j].ff + dx[i], y = c[j].ss + dy[i];
            update(x,y,1);
        }
    }

    //cout << "-> " << st.tree[0].mn << ' ' << st.tree[0].ct << '\n';
    return st.tree[0].ct;
}

Compilation message

seats.cpp: In function 'void update(int, int, int)':
seats.cpp:106:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |     for(int i = 0; i < vals.size();i++){
      |                    ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 340 KB Output is correct
2 Correct 28 ms 368 KB Output is correct
3 Correct 34 ms 368 KB Output is correct
4 Correct 21 ms 352 KB Output is correct
5 Correct 23 ms 368 KB Output is correct
6 Correct 31 ms 340 KB Output is correct
7 Correct 35 ms 500 KB Output is correct
8 Correct 34 ms 376 KB Output is correct
9 Correct 33 ms 376 KB Output is correct
10 Correct 30 ms 360 KB Output is correct
11 Correct 28 ms 340 KB Output is correct
12 Correct 21 ms 360 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 28 ms 368 KB Output is correct
3 Correct 34 ms 368 KB Output is correct
4 Correct 21 ms 352 KB Output is correct
5 Correct 23 ms 368 KB Output is correct
6 Correct 31 ms 340 KB Output is correct
7 Correct 35 ms 500 KB Output is correct
8 Correct 34 ms 376 KB Output is correct
9 Correct 33 ms 376 KB Output is correct
10 Correct 30 ms 360 KB Output is correct
11 Correct 28 ms 340 KB Output is correct
12 Correct 21 ms 360 KB Output is correct
13 Correct 72 ms 1032 KB Output is correct
14 Correct 77 ms 1036 KB Output is correct
15 Correct 46 ms 980 KB Output is correct
16 Correct 49 ms 1044 KB Output is correct
17 Correct 56 ms 980 KB Output is correct
18 Correct 63 ms 980 KB Output is correct
19 Correct 64 ms 1036 KB Output is correct
20 Correct 56 ms 1036 KB Output is correct
21 Correct 52 ms 1044 KB Output is correct
22 Correct 42 ms 980 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1664 ms 70788 KB Output is correct
2 Correct 1274 ms 70800 KB Output is correct
3 Correct 1393 ms 70788 KB Output is correct
4 Correct 1136 ms 70796 KB Output is correct
5 Correct 1182 ms 70788 KB Output is correct
6 Correct 1201 ms 70788 KB Output is correct
7 Correct 1261 ms 70788 KB Output is correct
8 Correct 1336 ms 70860 KB Output is correct
9 Correct 1265 ms 70704 KB Output is correct
10 Correct 1260 ms 70860 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 980 KB Output is correct
2 Correct 174 ms 6644 KB Output is correct
3 Correct 1182 ms 70788 KB Output is correct
4 Correct 1592 ms 70816 KB Output is correct
5 Correct 1143 ms 70788 KB Output is correct
6 Correct 1524 ms 70852 KB Output is correct
7 Correct 1163 ms 70784 KB Output is correct
8 Correct 1336 ms 70860 KB Output is correct
9 Correct 1224 ms 70792 KB Output is correct
10 Correct 1173 ms 70792 KB Output is correct
11 Correct 1151 ms 70796 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 1224 KB Output is correct
2 Correct 140 ms 1364 KB Output is correct
3 Correct 218 ms 1456 KB Output is correct
4 Correct 292 ms 1412 KB Output is correct
5 Correct 328 ms 2000 KB Output is correct
6 Correct 1612 ms 71260 KB Output is correct
7 Correct 1682 ms 71136 KB Output is correct
8 Correct 1533 ms 71148 KB Output is correct
9 Correct 2139 ms 71144 KB Output is correct
10 Correct 1538 ms 71136 KB Output is correct
11 Correct 1459 ms 71140 KB Output is correct
12 Correct 1501 ms 71224 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 28 ms 368 KB Output is correct
3 Correct 34 ms 368 KB Output is correct
4 Correct 21 ms 352 KB Output is correct
5 Correct 23 ms 368 KB Output is correct
6 Correct 31 ms 340 KB Output is correct
7 Correct 35 ms 500 KB Output is correct
8 Correct 34 ms 376 KB Output is correct
9 Correct 33 ms 376 KB Output is correct
10 Correct 30 ms 360 KB Output is correct
11 Correct 28 ms 340 KB Output is correct
12 Correct 21 ms 360 KB Output is correct
13 Correct 72 ms 1032 KB Output is correct
14 Correct 77 ms 1036 KB Output is correct
15 Correct 46 ms 980 KB Output is correct
16 Correct 49 ms 1044 KB Output is correct
17 Correct 56 ms 980 KB Output is correct
18 Correct 63 ms 980 KB Output is correct
19 Correct 64 ms 1036 KB Output is correct
20 Correct 56 ms 1036 KB Output is correct
21 Correct 52 ms 1044 KB Output is correct
22 Correct 42 ms 980 KB Output is correct
23 Correct 1664 ms 70788 KB Output is correct
24 Correct 1274 ms 70800 KB Output is correct
25 Correct 1393 ms 70788 KB Output is correct
26 Correct 1136 ms 70796 KB Output is correct
27 Correct 1182 ms 70788 KB Output is correct
28 Correct 1201 ms 70788 KB Output is correct
29 Correct 1261 ms 70788 KB Output is correct
30 Correct 1336 ms 70860 KB Output is correct
31 Correct 1265 ms 70704 KB Output is correct
32 Correct 1260 ms 70860 KB Output is correct
33 Correct 70 ms 980 KB Output is correct
34 Correct 174 ms 6644 KB Output is correct
35 Correct 1182 ms 70788 KB Output is correct
36 Correct 1592 ms 70816 KB Output is correct
37 Correct 1143 ms 70788 KB Output is correct
38 Correct 1524 ms 70852 KB Output is correct
39 Correct 1163 ms 70784 KB Output is correct
40 Correct 1336 ms 70860 KB Output is correct
41 Correct 1224 ms 70792 KB Output is correct
42 Correct 1173 ms 70792 KB Output is correct
43 Correct 1151 ms 70796 KB Output is correct
44 Correct 94 ms 1224 KB Output is correct
45 Correct 140 ms 1364 KB Output is correct
46 Correct 218 ms 1456 KB Output is correct
47 Correct 292 ms 1412 KB Output is correct
48 Correct 328 ms 2000 KB Output is correct
49 Correct 1612 ms 71260 KB Output is correct
50 Correct 1682 ms 71136 KB Output is correct
51 Correct 1533 ms 71148 KB Output is correct
52 Correct 2139 ms 71144 KB Output is correct
53 Correct 1538 ms 71136 KB Output is correct
54 Correct 1459 ms 71140 KB Output is correct
55 Correct 1501 ms 71224 KB Output is correct
56 Correct 162 ms 1224 KB Output is correct
57 Correct 334 ms 1352 KB Output is correct
58 Correct 603 ms 1884 KB Output is correct
59 Correct 2024 ms 71140 KB Output is correct
60 Correct 2587 ms 71144 KB Output is correct
61 Correct 2040 ms 71884 KB Output is correct
62 Correct 1646 ms 71400 KB Output is correct
63 Correct 2472 ms 71704 KB Output is correct
64 Correct 1976 ms 71352 KB Output is correct
65 Correct 2079 ms 72020 KB Output is correct
66 Correct 2093 ms 71328 KB Output is correct
67 Correct 2090 ms 71992 KB Output is correct
68 Correct 1936 ms 72016 KB Output is correct
69 Correct 2270 ms 71324 KB Output is correct