oj.uz

Submission #607348

# Submission time Handle Problem Language Result Execution time Memory
607348 2022-07-26T15:42:53 Z piOOE Seats (IOI18_seats) C++17
100 / 100
 2255 ms 99644 KB 
#include "seats.h"
#include <bits/stdc++.h>

using namespace std;

struct node {
  int mn, cnt;

  node() {
    cnt = 0, mn = 0x3f3f3f3f;
  }
};

node operator+(node a, node b) {
  if (b.cnt != 0) {
    if (b.mn < a.mn) {
      a.mn = b.mn, a.cnt = b.cnt;
    } else if (b.mn == a.mn) {
      a.cnt += b.cnt;
    }
  }
  return a;
}

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

int tag[N << 1], sz = 1;
node t[N << 1];

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

void push(int x) {
  if (tag[x] == 0) {
    return;
  }
  apply(x << 1, tag[x]);
  apply(x << 1 | 1, tag[x]);
  tag[x] = 0;
}

void pull(int x) {
  t[x] = t[x << 1] + t[x << 1 | 1];
}

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;
  push(x);
  modify(l, r, val, x << 1, lx, mid), modify(l, r, val, x << 1 | 1, mid, rx);
  pull(x);
}

node get(int l, int r, int x = 1, int lx = 0, int rx = sz) {
  if (l >= rx || lx >= r || l >= r) {
    return {};
  }
  if (l <= lx && rx <= r) {
    return t[x];
  }
  int mid = (lx + rx) >> 1;
  push(x);
  return get(l, r, x << 1, lx, mid) + get(l, r, x << 1 | 1, mid, rx);
}


int n, m, S;
vector<int> R, C;
vector<vector<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 + 1) % 4]);
    if (!O1) {
      modify(i, r, val);
    } else {
      prefix[i] += 1;
      prefix[max(i, r)] -= 1;
    }
    r = max(time[j], time[(j + 1) % 4]);
    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) {
  swap(R, _R), swap(C, _C);
  n = H, m = W;
  S = n * m;
  p.assign(n, vector<int>(m));
  for (int i = 0; i < S; ++i) {
    p[R[i]][C[i]] = i;
  }
  sz = 1;
  while (sz < S) sz <<= 1;
  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];
    }
    t[i + sz].mn = prefix[i];
    t[i + sz].cnt = 1;
  }
  for (int i = sz - 1; i > 0; --i) {
    pull(i);
  }
}

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 get(0, S).cnt;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 16852 KB Output is correct
2 Correct 39 ms 16840 KB Output is correct
3 Correct 57 ms 16832 KB Output is correct
4 Correct 33 ms 16852 KB Output is correct
5 Correct 37 ms 16840 KB Output is correct
6 Correct 59 ms 16852 KB Output is correct
7 Correct 65 ms 16864 KB Output is correct
8 Correct 49 ms 16840 KB Output is correct
9 Correct 50 ms 16836 KB Output is correct
10 Correct 50 ms 16864 KB Output is correct
11 Correct 48 ms 16840 KB Output is correct
12 Correct 36 ms 16836 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 16852 KB Output is correct
2 Correct 39 ms 16840 KB Output is correct
3 Correct 57 ms 16832 KB Output is correct
4 Correct 33 ms 16852 KB Output is correct
5 Correct 37 ms 16840 KB Output is correct
6 Correct 59 ms 16852 KB Output is correct
7 Correct 65 ms 16864 KB Output is correct
8 Correct 49 ms 16840 KB Output is correct
9 Correct 50 ms 16836 KB Output is correct
10 Correct 50 ms 16864 KB Output is correct
11 Correct 48 ms 16840 KB Output is correct
12 Correct 36 ms 16836 KB Output is correct
13 Correct 112 ms 17260 KB Output is correct
14 Correct 119 ms 17280 KB Output is correct
15 Correct 62 ms 17308 KB Output is correct
16 Correct 51 ms 17764 KB Output is correct
17 Correct 82 ms 17272 KB Output is correct
18 Correct 94 ms 17288 KB Output is correct
19 Correct 105 ms 17260 KB Output is correct
20 Correct 79 ms 17508 KB Output is correct
21 Correct 56 ms 17324 KB Output is correct
22 Correct 55 ms 17812 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 649 ms 48416 KB Output is correct
2 Correct 411 ms 48808 KB Output is correct
3 Correct 396 ms 48848 KB Output is correct
4 Correct 428 ms 48744 KB Output is correct
5 Correct 422 ms 48744 KB Output is correct
6 Correct 490 ms 48740 KB Output is correct
7 Correct 440 ms 48804 KB Output is correct
8 Correct 469 ms 48800 KB Output is correct
9 Correct 466 ms 48780 KB Output is correct
10 Correct 516 ms 48848 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 17236 KB Output is correct
2 Correct 160 ms 19744 KB Output is correct
3 Correct 451 ms 48292 KB Output is correct
4 Correct 576 ms 48740 KB Output is correct
5 Correct 381 ms 48780 KB Output is correct
6 Correct 823 ms 99644 KB Output is correct
7 Correct 430 ms 48720 KB Output is correct
8 Correct 480 ms 48792 KB Output is correct
9 Correct 441 ms 49120 KB Output is correct
10 Correct 489 ms 51820 KB Output is correct
11 Correct 378 ms 72196 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 17720 KB Output is correct
2 Correct 154 ms 17804 KB Output is correct
3 Correct 241 ms 17840 KB Output is correct
4 Correct 377 ms 17840 KB Output is correct
5 Correct 507 ms 18116 KB Output is correct
6 Correct 1018 ms 49252 KB Output is correct
7 Correct 978 ms 49292 KB Output is correct
8 Correct 974 ms 49224 KB Output is correct
9 Correct 1211 ms 49204 KB Output is correct
10 Correct 895 ms 49144 KB Output is correct
11 Correct 877 ms 49252 KB Output is correct
12 Correct 860 ms 49196 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 16852 KB Output is correct
2 Correct 39 ms 16840 KB Output is correct
3 Correct 57 ms 16832 KB Output is correct
4 Correct 33 ms 16852 KB Output is correct
5 Correct 37 ms 16840 KB Output is correct
6 Correct 59 ms 16852 KB Output is correct
7 Correct 65 ms 16864 KB Output is correct
8 Correct 49 ms 16840 KB Output is correct
9 Correct 50 ms 16836 KB Output is correct
10 Correct 50 ms 16864 KB Output is correct
11 Correct 48 ms 16840 KB Output is correct
12 Correct 36 ms 16836 KB Output is correct
13 Correct 112 ms 17260 KB Output is correct
14 Correct 119 ms 17280 KB Output is correct
15 Correct 62 ms 17308 KB Output is correct
16 Correct 51 ms 17764 KB Output is correct
17 Correct 82 ms 17272 KB Output is correct
18 Correct 94 ms 17288 KB Output is correct
19 Correct 105 ms 17260 KB Output is correct
20 Correct 79 ms 17508 KB Output is correct
21 Correct 56 ms 17324 KB Output is correct
22 Correct 55 ms 17812 KB Output is correct
23 Correct 649 ms 48416 KB Output is correct
24 Correct 411 ms 48808 KB Output is correct
25 Correct 396 ms 48848 KB Output is correct
26 Correct 428 ms 48744 KB Output is correct
27 Correct 422 ms 48744 KB Output is correct
28 Correct 490 ms 48740 KB Output is correct
29 Correct 440 ms 48804 KB Output is correct
30 Correct 469 ms 48800 KB Output is correct
31 Correct 466 ms 48780 KB Output is correct
32 Correct 516 ms 48848 KB Output is correct
33 Correct 117 ms 17236 KB Output is correct
34 Correct 160 ms 19744 KB Output is correct
35 Correct 451 ms 48292 KB Output is correct
36 Correct 576 ms 48740 KB Output is correct
37 Correct 381 ms 48780 KB Output is correct
38 Correct 823 ms 99644 KB Output is correct
39 Correct 430 ms 48720 KB Output is correct
40 Correct 480 ms 48792 KB Output is correct
41 Correct 441 ms 49120 KB Output is correct
42 Correct 489 ms 51820 KB Output is correct
43 Correct 378 ms 72196 KB Output is correct
44 Correct 62 ms 17720 KB Output is correct
45 Correct 154 ms 17804 KB Output is correct
46 Correct 241 ms 17840 KB Output is correct
47 Correct 377 ms 17840 KB Output is correct
48 Correct 507 ms 18116 KB Output is correct
49 Correct 1018 ms 49252 KB Output is correct
50 Correct 978 ms 49292 KB Output is correct
51 Correct 974 ms 49224 KB Output is correct
52 Correct 1211 ms 49204 KB Output is correct
53 Correct 895 ms 49144 KB Output is correct
54 Correct 877 ms 49252 KB Output is correct
55 Correct 860 ms 49196 KB Output is correct
56 Correct 245 ms 18396 KB Output is correct
57 Correct 540 ms 18340 KB Output is correct
58 Correct 810 ms 18748 KB Output is correct
59 Correct 1616 ms 49176 KB Output is correct
60 Correct 2255 ms 49104 KB Output is correct
61 Correct 1381 ms 49064 KB Output is correct
62 Correct 1136 ms 49236 KB Output is correct
63 Correct 1841 ms 49252 KB Output is correct
64 Correct 1481 ms 49248 KB Output is correct
65 Correct 1426 ms 49144 KB Output is correct
66 Correct 1562 ms 49456 KB Output is correct
67 Correct 1488 ms 52240 KB Output is correct
68 Correct 1268 ms 63384 KB Output is correct
69 Correct 1775 ms 72580 KB Output is correct