oj.uz

Submission #607484

# Submission time Handle Problem Language Result Execution time Memory
607484 2022-07-26T18:18:55 Z piOOE Seats (IOI18_seats) C++17
100 / 100
 2350 ms 83728 KB 
#include "seats.h"
#include <bits/stdc++.h>

using namespace std;

constexpr int N = 1 << 20, dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1}; //Up, Right, Down, Left

int tag[N << 1], mn[N << 1], cnt[N << 1], sz = 1;

void apply(int x, int v) {
  tag[x] += v;
  mn[x] += v;
}

void pull(int x) {
  mn[x] = min(mn[x << 1], mn[x << 1 | 1]);
  cnt[x] = 0;
  if (mn[x] == mn[x << 1]) {
    cnt[x] += cnt[x << 1];
  }
  if (mn[x] == mn[x << 1 | 1]) {
    cnt[x] += cnt[x << 1 | 1];
  }
  mn[x] += tag[x];
}

void modify(int l, int r, int val, int x = 1, int lx = 0, int rx = sz) {
  if (l >= rx || lx >= r) {
    return;
  }
  if (l <= lx && rx <= r) {
    apply(x, val);
    return;
  }
  int mid = (lx + rx) >> 1;
  modify(l, r, val, x << 1, lx, mid), modify(l, r, val, x << 1 | 1, mid, rx);
  pull(x);
}

void build(int a[], int x = 1, int lx = 0, int rx = sz) {
  if (lx + 1 == rx) {
    mn[x] = a[lx];
    cnt[x] = 1;
    return;
  }
  int mid = (lx + rx) >> 1;
  build(a, x << 1, lx, mid), build(a, x << 1 | 1, mid, rx);
  pull(x);
}


int n, m, S;
int R[N], C[N];
int **p;

bool inside(int a, int b) {
  return a >= 0 && a < n && b >= 0 && b < m;
}

int prefix[N];

void update(int i, int val, bool O1 = false) {
  int x = R[i], y = C[i];
  int nx[4], ny[4], time[4];
  for (int j = 0; j < 4; ++j) {
    nx[j] = x + dx[j], ny[j] = y + dy[j];
    time[j] = inside(nx[j], ny[j]) ? p[nx[j]][ny[j]] : S;
  }
  for (int j = 0; j < 4; ++j) {
    int r = min(time[j], time[j == 3 ? 0 : j + 1]);
    if (!O1) {
      modify(i, r, val);
    } else {
      prefix[i] += 1;
      prefix[max(i, r)] -= 1;
    }
    r = max(time[j], time[j == 3 ? 0 : j + 1]);
    if (r < i) {
      if (!O1) {
        modify(min(i, r), max(i, r), val);
      } else {
        prefix[min(i, r)] += 1;
        prefix[max(i, r)] -= 1;
      }
    }
  }
}

void give_initial_chart(int H, int W, vector<int> _R, vector<int> _C) {
  memcpy(R, _R.data(), sizeof(int) * H * W);
  memcpy(C, _C.data(), sizeof(int) * H * W);
  n = H, m = W;
  S = n * m;
  p = new int*[n];
  for (int i = 0; i < n; ++i) {
    p[i] = new int[m];
  }
  for (int i = 0; i < S; ++i) {
    p[R[i]][C[i]] = i;
  }
  sz = S;
  for (int i = 0; i < S; ++i) {
    update(i, 1, true);
  }
  for (int i = 0; i < S; ++i) {
    if (i > 0) {
      prefix[i] += prefix[i - 1];
    }
  }
  build(prefix);
}

int swap_seats(int a, int b) {
  if (a > b) {
    swap(a, b);
  }
  vector<int> yy = {a, b};
  for (int _ = 0; _ < 2; ++_) {
    for (int i = 0; i < 4; ++i) {
      int nx = R[a] + dx[i], ny = C[a] + dy[i];
      if (inside(nx, ny)) {
        yy.push_back(p[nx][ny]);
      }
    }
    swap(a, b);
  }
  sort(yy.begin(), yy.end());
  yy.resize(unique(yy.begin(), yy.end()) - yy.begin());
  for (int i: yy) {
    update(i, -1);
  }
  swap(R[a], R[b]), swap(C[a], C[b]);
  p[R[a]][C[a]] = a, p[R[b]][C[b]] = b;
  for (int i: yy) {
    update(i, 1);
  }
  return cnt[1];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 416 KB Output is correct
2 Correct 36 ms 468 KB Output is correct
3 Correct 57 ms 416 KB Output is correct
4 Correct 32 ms 416 KB Output is correct
5 Correct 32 ms 400 KB Output is correct
6 Correct 37 ms 412 KB Output is correct
7 Correct 40 ms 340 KB Output is correct
8 Correct 42 ms 396 KB Output is correct
9 Correct 44 ms 392 KB Output is correct
10 Correct 47 ms 392 KB Output is correct
11 Correct 39 ms 468 KB Output is correct
12 Correct 24 ms 432 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 416 KB Output is correct
2 Correct 36 ms 468 KB Output is correct
3 Correct 57 ms 416 KB Output is correct
4 Correct 32 ms 416 KB Output is correct
5 Correct 32 ms 400 KB Output is correct
6 Correct 37 ms 412 KB Output is correct
7 Correct 40 ms 340 KB Output is correct
8 Correct 42 ms 396 KB Output is correct
9 Correct 44 ms 392 KB Output is correct
10 Correct 47 ms 392 KB Output is correct
11 Correct 39 ms 468 KB Output is correct
12 Correct 24 ms 432 KB Output is correct
13 Correct 121 ms 1068 KB Output is correct
14 Correct 100 ms 1076 KB Output is correct
15 Correct 63 ms 1080 KB Output is correct
16 Correct 54 ms 1412 KB Output is correct
17 Correct 82 ms 984 KB Output is correct
18 Correct 97 ms 1064 KB Output is correct
19 Correct 96 ms 1076 KB Output is correct
20 Correct 81 ms 1228 KB Output is correct
21 Correct 47 ms 1072 KB Output is correct
22 Correct 65 ms 1420 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 629 ms 48556 KB Output is correct
2 Correct 484 ms 48500 KB Output is correct
3 Correct 502 ms 48524 KB Output is correct
4 Correct 498 ms 48524 KB Output is correct
5 Correct 445 ms 48424 KB Output is correct
6 Correct 460 ms 48548 KB Output is correct
7 Correct 442 ms 48484 KB Output is correct
8 Correct 454 ms 48500 KB Output is correct
9 Correct 477 ms 48524 KB Output is correct
10 Correct 466 ms 48524 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 1064 KB Output is correct
2 Correct 150 ms 5676 KB Output is correct
3 Correct 463 ms 48528 KB Output is correct
4 Correct 559 ms 48520 KB Output is correct
5 Correct 368 ms 48440 KB Output is correct
6 Correct 744 ms 83728 KB Output is correct
7 Correct 466 ms 48504 KB Output is correct
8 Correct 469 ms 48508 KB Output is correct
9 Correct 463 ms 48736 KB Output is correct
10 Correct 436 ms 50092 KB Output is correct
11 Correct 398 ms 64076 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1264 KB Output is correct
2 Correct 125 ms 1288 KB Output is correct
3 Correct 254 ms 1308 KB Output is correct
4 Correct 342 ms 1396 KB Output is correct
5 Correct 539 ms 2020 KB Output is correct
6 Correct 1042 ms 49584 KB Output is correct
7 Correct 1071 ms 49544 KB Output is correct
8 Correct 1062 ms 49488 KB Output is correct
9 Correct 1252 ms 49580 KB Output is correct
10 Correct 996 ms 49480 KB Output is correct
11 Correct 1014 ms 49588 KB Output is correct
12 Correct 1002 ms 49508 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 416 KB Output is correct
2 Correct 36 ms 468 KB Output is correct
3 Correct 57 ms 416 KB Output is correct
4 Correct 32 ms 416 KB Output is correct
5 Correct 32 ms 400 KB Output is correct
6 Correct 37 ms 412 KB Output is correct
7 Correct 40 ms 340 KB Output is correct
8 Correct 42 ms 396 KB Output is correct
9 Correct 44 ms 392 KB Output is correct
10 Correct 47 ms 392 KB Output is correct
11 Correct 39 ms 468 KB Output is correct
12 Correct 24 ms 432 KB Output is correct
13 Correct 121 ms 1068 KB Output is correct
14 Correct 100 ms 1076 KB Output is correct
15 Correct 63 ms 1080 KB Output is correct
16 Correct 54 ms 1412 KB Output is correct
17 Correct 82 ms 984 KB Output is correct
18 Correct 97 ms 1064 KB Output is correct
19 Correct 96 ms 1076 KB Output is correct
20 Correct 81 ms 1228 KB Output is correct
21 Correct 47 ms 1072 KB Output is correct
22 Correct 65 ms 1420 KB Output is correct
23 Correct 629 ms 48556 KB Output is correct
24 Correct 484 ms 48500 KB Output is correct
25 Correct 502 ms 48524 KB Output is correct
26 Correct 498 ms 48524 KB Output is correct
27 Correct 445 ms 48424 KB Output is correct
28 Correct 460 ms 48548 KB Output is correct
29 Correct 442 ms 48484 KB Output is correct
30 Correct 454 ms 48500 KB Output is correct
31 Correct 477 ms 48524 KB Output is correct
32 Correct 466 ms 48524 KB Output is correct
33 Correct 101 ms 1064 KB Output is correct
34 Correct 150 ms 5676 KB Output is correct
35 Correct 463 ms 48528 KB Output is correct
36 Correct 559 ms 48520 KB Output is correct
37 Correct 368 ms 48440 KB Output is correct
38 Correct 744 ms 83728 KB Output is correct
39 Correct 466 ms 48504 KB Output is correct
40 Correct 469 ms 48508 KB Output is correct
41 Correct 463 ms 48736 KB Output is correct
42 Correct 436 ms 50092 KB Output is correct
43 Correct 398 ms 64076 KB Output is correct
44 Correct 66 ms 1264 KB Output is correct
45 Correct 125 ms 1288 KB Output is correct
46 Correct 254 ms 1308 KB Output is correct
47 Correct 342 ms 1396 KB Output is correct
48 Correct 539 ms 2020 KB Output is correct
49 Correct 1042 ms 49584 KB Output is correct
50 Correct 1071 ms 49544 KB Output is correct
51 Correct 1062 ms 49488 KB Output is correct
52 Correct 1252 ms 49580 KB Output is correct
53 Correct 996 ms 49480 KB Output is correct
54 Correct 1014 ms 49588 KB Output is correct
55 Correct 1002 ms 49508 KB Output is correct
56 Correct 163 ms 1364 KB Output is correct
57 Correct 479 ms 1440 KB Output is correct
58 Correct 978 ms 1992 KB Output is correct
59 Correct 1773 ms 49532 KB Output is correct
60 Correct 2298 ms 49612 KB Output is correct
61 Correct 1685 ms 49528 KB Output is correct
62 Correct 1324 ms 49524 KB Output is correct
63 Correct 2350 ms 49580 KB Output is correct
64 Correct 1651 ms 49508 KB Output is correct
65 Correct 1730 ms 49556 KB Output is correct
66 Correct 1717 ms 49924 KB Output is correct
67 Correct 1610 ms 51160 KB Output is correct
68 Correct 1362 ms 58736 KB Output is correct
69 Correct 1832 ms 65260 KB Output is correct