oj.uz

Submission #764205

# Submission time Handle Problem Language Result Execution time Memory
764205 2023-06-23T08:35:56 Z qwerasdfzxcl Seats (IOI18_seats) C++17
100 / 100
 495 ms 176700 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 = n;
        for (int i=sz;i<sz*2;i++) tree[i] = Node(a[i-sz], a[i-sz], 1);
        for (int i=sz-1;i;i--) tree[i] = tree[i<<1] + tree[i<<1|1];
    }
    void update(int p, int x){
        p += sz;
        if (tree[p].prf==x) return;
        tree[p] = Node(x, x, 1);
        for (p>>=1;p;p>>=1) tree[p] = tree[p<<1] + tree[p<<1|1];
    }
    Node query(int l, int r){
        Node retl(INF, 0, 0), retr(INF, 0, 0);
        ++r;
        for (l+=sz, r+=sz;l<r;l>>=1, r>>=1){
            if (l&1) retl = retl + tree[l++];
            if (r&1) retr = tree[--r] + retr;
        }
        return retl + retr;
    }
}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+1, d);
    //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]]);
            }
        }
    }
 
    auto N = tree.query(1, n*m);
    assert(N.prf==4);
    return N.cnt;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 7 ms 460 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 6 ms 416 KB Output is correct
7 Correct 7 ms 448 KB Output is correct
8 Correct 7 ms 468 KB Output is correct
9 Correct 7 ms 468 KB Output is correct
10 Correct 7 ms 468 KB Output is correct
11 Correct 6 ms 468 KB Output is correct
12 Correct 4 ms 468 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 7 ms 460 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 6 ms 416 KB Output is correct
7 Correct 7 ms 448 KB Output is correct
8 Correct 7 ms 468 KB Output is correct
9 Correct 7 ms 468 KB Output is correct
10 Correct 7 ms 468 KB Output is correct
11 Correct 6 ms 468 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 10 ms 1108 KB Output is correct
14 Correct 10 ms 1108 KB Output is correct
15 Correct 7 ms 1336 KB Output is correct
16 Correct 9 ms 2108 KB Output is correct
17 Correct 9 ms 1212 KB Output is correct
18 Correct 11 ms 1148 KB Output is correct
19 Correct 11 ms 1224 KB Output is correct
20 Correct 10 ms 1620 KB Output is correct
21 Correct 7 ms 1364 KB Output is correct
22 Correct 8 ms 2132 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 75048 KB Output is correct
2 Correct 221 ms 75060 KB Output is correct
3 Correct 224 ms 75080 KB Output is correct
4 Correct 221 ms 74996 KB Output is correct
5 Correct 217 ms 75108 KB Output is correct
6 Correct 223 ms 75000 KB Output is correct
7 Correct 222 ms 75064 KB Output is correct
8 Correct 225 ms 75052 KB Output is correct
9 Correct 222 ms 75096 KB Output is correct
10 Correct 217 ms 75068 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1144 KB Output is correct
2 Correct 29 ms 6908 KB Output is correct
3 Correct 224 ms 75068 KB Output is correct
4 Correct 258 ms 75068 KB Output is correct
5 Correct 241 ms 94536 KB Output is correct
6 Correct 418 ms 176700 KB Output is correct
7 Correct 230 ms 81444 KB Output is correct
8 Correct 228 ms 75176 KB Output is correct
9 Correct 243 ms 75704 KB Output is correct
10 Correct 231 ms 84412 KB Output is correct
11 Correct 268 ms 121976 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1976 KB Output is correct
2 Correct 37 ms 1980 KB Output is correct
3 Correct 38 ms 2028 KB Output is correct
4 Correct 46 ms 2100 KB Output is correct
5 Correct 46 ms 2852 KB Output is correct
6 Correct 346 ms 95608 KB Output is correct
7 Correct 348 ms 95536 KB Output is correct
8 Correct 349 ms 95636 KB Output is correct
9 Correct 385 ms 95536 KB Output is correct
10 Correct 318 ms 95512 KB Output is correct
11 Correct 326 ms 95500 KB Output is correct
12 Correct 367 ms 95508 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 7 ms 460 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 6 ms 416 KB Output is correct
7 Correct 7 ms 448 KB Output is correct
8 Correct 7 ms 468 KB Output is correct
9 Correct 7 ms 468 KB Output is correct
10 Correct 7 ms 468 KB Output is correct
11 Correct 6 ms 468 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 10 ms 1108 KB Output is correct
14 Correct 10 ms 1108 KB Output is correct
15 Correct 7 ms 1336 KB Output is correct
16 Correct 9 ms 2108 KB Output is correct
17 Correct 9 ms 1212 KB Output is correct
18 Correct 11 ms 1148 KB Output is correct
19 Correct 11 ms 1224 KB Output is correct
20 Correct 10 ms 1620 KB Output is correct
21 Correct 7 ms 1364 KB Output is correct
22 Correct 8 ms 2132 KB Output is correct
23 Correct 239 ms 75048 KB Output is correct
24 Correct 221 ms 75060 KB Output is correct
25 Correct 224 ms 75080 KB Output is correct
26 Correct 221 ms 74996 KB Output is correct
27 Correct 217 ms 75108 KB Output is correct
28 Correct 223 ms 75000 KB Output is correct
29 Correct 222 ms 75064 KB Output is correct
30 Correct 225 ms 75052 KB Output is correct
31 Correct 222 ms 75096 KB Output is correct
32 Correct 217 ms 75068 KB Output is correct
33 Correct 10 ms 1144 KB Output is correct
34 Correct 29 ms 6908 KB Output is correct
35 Correct 224 ms 75068 KB Output is correct
36 Correct 258 ms 75068 KB Output is correct
37 Correct 241 ms 94536 KB Output is correct
38 Correct 418 ms 176700 KB Output is correct
39 Correct 230 ms 81444 KB Output is correct
40 Correct 228 ms 75176 KB Output is correct
41 Correct 243 ms 75704 KB Output is correct
42 Correct 231 ms 84412 KB Output is correct
43 Correct 268 ms 121976 KB Output is correct
44 Correct 36 ms 1976 KB Output is correct
45 Correct 37 ms 1980 KB Output is correct
46 Correct 38 ms 2028 KB Output is correct
47 Correct 46 ms 2100 KB Output is correct
48 Correct 46 ms 2852 KB Output is correct
49 Correct 346 ms 95608 KB Output is correct
50 Correct 348 ms 95536 KB Output is correct
51 Correct 349 ms 95636 KB Output is correct
52 Correct 385 ms 95536 KB Output is correct
53 Correct 318 ms 95512 KB Output is correct
54 Correct 326 ms 95500 KB Output is correct
55 Correct 367 ms 95508 KB Output is correct
56 Correct 48 ms 2052 KB Output is correct
57 Correct 64 ms 2052 KB Output is correct
58 Correct 121 ms 2592 KB Output is correct
59 Correct 392 ms 76112 KB Output is correct
60 Correct 485 ms 76056 KB Output is correct
61 Correct 341 ms 76060 KB Output is correct
62 Correct 324 ms 85740 KB Output is correct
63 Correct 440 ms 82584 KB Output is correct
64 Correct 440 ms 77916 KB Output is correct
65 Correct 356 ms 76108 KB Output is correct
66 Correct 394 ms 76744 KB Output is correct
67 Correct 443 ms 85344 KB Output is correct
68 Correct 383 ms 104676 KB Output is correct
69 Correct 495 ms 122932 KB Output is correct