oj.uz

Submission #565851

# Submission time Handle Problem Language Result Execution time Memory
565851 2022-05-21T12:18:01 Z MilosMilutinovic Seats (IOI18_seats) C++14
100 / 100
 3822 ms 128260 KB 
#include "seats.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX = 1000005;

long long st[4 * MAX][2], lzy[4 * MAX];

void build(int node, int l, int r) {
  st[node][0] = 0;
  st[node][1] = r - l + 1;
  lzy[node] = 0;
  if (l == r) {
    return;
  }
  int mid = l + r >> 1;
  build(node + node, l, mid);
  build(node + node + 1, mid + 1, r);
}

void pull(int node, int l, int r) {
  st[node][0] = min(st[node + node][0], st[node + node + 1][0]);
  st[node][1] = 0;
  if (st[node][0] == st[node + node][0]) {
    st[node][1] += st[node + node][1];
  }
  if (st[node][0] == st[node + node + 1][0]) {
    st[node][1] += st[node + node + 1][1];
  }
}

void push(int node, int l, int r) {
  if (l == r) {
    return;
  }
  st[node + node][0] += lzy[node];
  st[node + node + 1][0] += lzy[node];
  lzy[node + node] += lzy[node];
  lzy[node + node + 1] += lzy[node];
  lzy[node] = 0;
}

void modify(int node, int l, int r, int ll, int rr, int v) {
  if (l > rr || r < ll) return;
  if (ll <= l && r <= rr) {
    st[node][0] += v;
    lzy[node] += v;
    push(node, l, r);
    return;
  }
  int mid = l + r >> 1;
  push(node, l, r);
  modify(node + node, l, mid, ll, rr, v);
  modify(node + node + 1, mid + 1, r, ll, rr, v);
  pull(node, l, r);
}

vector<vector<int>> a;
int h, w;
int x[MAX];
int y[MAX];

vector<int> dx = {1, 0, 1};
vector<int> dy = {0, 1, 1};

void add(int p, int i, int j, int v) {
  vector<int> vals(1, p);
  for (int d = 0; d < 3; d++) {
    int ni = i + dx[d];
    int nj = j + dy[d];
    if (ni >= 0 && ni < h && nj >= 0 && nj < w) {
      vals.push_back(a[ni][nj]);
    } else {
      vals.push_back(h * w);
    }
  }
  sort(vals.begin(), vals.end());
  if (vals[0] < vals[1]) {
    modify(1, 0, h * w - 1, vals[0], vals[1] - 1, v);
  }
  if (vals[2] < vals[3]) {
    modify(1, 0, h * w - 1, vals[2], vals[3] - 1, v * MAX);
  }
}

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
  h = H;
  w = W;
  a.resize(H);
  for (int i = 0; i < H; i++) {
    a[i].resize(W);
  }
  for (int i = 0; i < H * W; i++) {
    x[i] = R[i];
    y[i] = C[i];
    a[x[i]][y[i]] = i;
  }
  build(1, 0, h * w - 1);
  for (int i = 0; i < H * W; i++) {
    add(i, x[i], y[i], 1);
  }
  for (int i = 0; i < H; i++) {
    add(h * w, i, -1, 1);
  }
  for (int j = -1; j < W; j++) {
    add(h * w, -1, j, 1);
  }
}

vector<int> di = {0, 0, -1, -1};
vector<int> dj = {0, -1, 0, -1};

bool Valid(int i, int j) {
  return i >= 0 && i < h && j >= 0 && j < w;
}

vector<pair<int, int>> aux;

int swap_seats(int i, int j) {
  for (int d = 0; d < 4; d++) {
    {
      int ni = x[i] + di[d];
      int nj = y[i] + dj[d];
      aux.emplace_back(ni, nj);
    }
    {
      int ni = x[j] + di[d];
      int nj = y[j] + dj[d];
      aux.emplace_back(ni, nj);
    }
  }
  sort(aux.begin(), aux.end());
  aux.erase(unique(aux.begin(), aux.end()), aux.end());
  for (auto& c : aux) {
    if (Valid(c.first, c.second)) {
      add(a[c.first][c.second], c.first, c.second, -1);
    } else {
      add(h * w, c.first, c.second, -1);
    }
  }
  swap(a[x[i]][y[i]], a[x[j]][y[j]]);
  swap(x[i], x[j]);
  swap(y[i], y[j]);
  for (auto& c : aux) {
    if (Valid(c.first, c.second)) {
      add(a[c.first][c.second], c.first, c.second, 1);
    } else {
      add(h * w, c.first, c.second, 1);
    }
  }
  aux.clear();
  return st[1][1];
}

Compilation message

seats.cpp: In function 'void build(int, int, int)':
seats.cpp:17:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |   int mid = l + r >> 1;
      |             ~~^~~
seats.cpp: In function 'void modify(int, int, int, int, int, int)':
seats.cpp:52:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |   int mid = l + r >> 1;
      |             ~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 372 KB Output is correct
2 Correct 27 ms 384 KB Output is correct
3 Correct 36 ms 408 KB Output is correct
4 Correct 27 ms 340 KB Output is correct
5 Correct 21 ms 444 KB Output is correct
6 Correct 33 ms 428 KB Output is correct
7 Correct 34 ms 340 KB Output is correct
8 Correct 31 ms 416 KB Output is correct
9 Correct 32 ms 400 KB Output is correct
10 Correct 34 ms 340 KB Output is correct
11 Correct 34 ms 468 KB Output is correct
12 Correct 24 ms 404 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 372 KB Output is correct
2 Correct 27 ms 384 KB Output is correct
3 Correct 36 ms 408 KB Output is correct
4 Correct 27 ms 340 KB Output is correct
5 Correct 21 ms 444 KB Output is correct
6 Correct 33 ms 428 KB Output is correct
7 Correct 34 ms 340 KB Output is correct
8 Correct 31 ms 416 KB Output is correct
9 Correct 32 ms 400 KB Output is correct
10 Correct 34 ms 340 KB Output is correct
11 Correct 34 ms 468 KB Output is correct
12 Correct 24 ms 404 KB Output is correct
13 Correct 77 ms 1364 KB Output is correct
14 Correct 87 ms 1532 KB Output is correct
15 Correct 56 ms 1528 KB Output is correct
16 Correct 45 ms 2052 KB Output is correct
17 Correct 65 ms 1528 KB Output is correct
18 Correct 66 ms 1528 KB Output is correct
19 Correct 60 ms 1552 KB Output is correct
20 Correct 54 ms 1768 KB Output is correct
21 Correct 42 ms 1536 KB Output is correct
22 Correct 44 ms 2052 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2592 ms 77032 KB Output is correct
2 Correct 1066 ms 77440 KB Output is correct
3 Correct 985 ms 77544 KB Output is correct
4 Correct 974 ms 77496 KB Output is correct
5 Correct 1018 ms 77388 KB Output is correct
6 Correct 998 ms 77420 KB Output is correct
7 Correct 962 ms 77388 KB Output is correct
8 Correct 980 ms 77448 KB Output is correct
9 Correct 969 ms 77516 KB Output is correct
10 Correct 982 ms 77420 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1408 KB Output is correct
2 Correct 187 ms 9264 KB Output is correct
3 Correct 1012 ms 77396 KB Output is correct
4 Correct 2740 ms 77420 KB Output is correct
5 Correct 1010 ms 77472 KB Output is correct
6 Correct 2615 ms 128260 KB Output is correct
7 Correct 1024 ms 77388 KB Output is correct
8 Correct 1027 ms 77388 KB Output is correct
9 Correct 979 ms 77988 KB Output is correct
10 Correct 1062 ms 80516 KB Output is correct
11 Correct 1074 ms 100920 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 1364 KB Output is correct
2 Correct 162 ms 1352 KB Output is correct
3 Correct 235 ms 1340 KB Output is correct
4 Correct 283 ms 1356 KB Output is correct
5 Correct 435 ms 2328 KB Output is correct
6 Correct 1552 ms 77352 KB Output is correct
7 Correct 1747 ms 77352 KB Output is correct
8 Correct 1510 ms 77388 KB Output is correct
9 Correct 2935 ms 77352 KB Output is correct
10 Correct 1438 ms 77260 KB Output is correct
11 Correct 1449 ms 77412 KB Output is correct
12 Correct 1523 ms 77348 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 372 KB Output is correct
2 Correct 27 ms 384 KB Output is correct
3 Correct 36 ms 408 KB Output is correct
4 Correct 27 ms 340 KB Output is correct
5 Correct 21 ms 444 KB Output is correct
6 Correct 33 ms 428 KB Output is correct
7 Correct 34 ms 340 KB Output is correct
8 Correct 31 ms 416 KB Output is correct
9 Correct 32 ms 400 KB Output is correct
10 Correct 34 ms 340 KB Output is correct
11 Correct 34 ms 468 KB Output is correct
12 Correct 24 ms 404 KB Output is correct
13 Correct 77 ms 1364 KB Output is correct
14 Correct 87 ms 1532 KB Output is correct
15 Correct 56 ms 1528 KB Output is correct
16 Correct 45 ms 2052 KB Output is correct
17 Correct 65 ms 1528 KB Output is correct
18 Correct 66 ms 1528 KB Output is correct
19 Correct 60 ms 1552 KB Output is correct
20 Correct 54 ms 1768 KB Output is correct
21 Correct 42 ms 1536 KB Output is correct
22 Correct 44 ms 2052 KB Output is correct
23 Correct 2592 ms 77032 KB Output is correct
24 Correct 1066 ms 77440 KB Output is correct
25 Correct 985 ms 77544 KB Output is correct
26 Correct 974 ms 77496 KB Output is correct
27 Correct 1018 ms 77388 KB Output is correct
28 Correct 998 ms 77420 KB Output is correct
29 Correct 962 ms 77388 KB Output is correct
30 Correct 980 ms 77448 KB Output is correct
31 Correct 969 ms 77516 KB Output is correct
32 Correct 982 ms 77420 KB Output is correct
33 Correct 74 ms 1408 KB Output is correct
34 Correct 187 ms 9264 KB Output is correct
35 Correct 1012 ms 77396 KB Output is correct
36 Correct 2740 ms 77420 KB Output is correct
37 Correct 1010 ms 77472 KB Output is correct
38 Correct 2615 ms 128260 KB Output is correct
39 Correct 1024 ms 77388 KB Output is correct
40 Correct 1027 ms 77388 KB Output is correct
41 Correct 979 ms 77988 KB Output is correct
42 Correct 1062 ms 80516 KB Output is correct
43 Correct 1074 ms 100920 KB Output is correct
44 Correct 125 ms 1364 KB Output is correct
45 Correct 162 ms 1352 KB Output is correct
46 Correct 235 ms 1340 KB Output is correct
47 Correct 283 ms 1356 KB Output is correct
48 Correct 435 ms 2328 KB Output is correct
49 Correct 1552 ms 77352 KB Output is correct
50 Correct 1747 ms 77352 KB Output is correct
51 Correct 1510 ms 77388 KB Output is correct
52 Correct 2935 ms 77352 KB Output is correct
53 Correct 1438 ms 77260 KB Output is correct
54 Correct 1449 ms 77412 KB Output is correct
55 Correct 1523 ms 77348 KB Output is correct
56 Correct 181 ms 1488 KB Output is correct
57 Correct 356 ms 1496 KB Output is correct
58 Correct 573 ms 2516 KB Output is correct
59 Correct 1843 ms 77664 KB Output is correct
60 Correct 3822 ms 77624 KB Output is correct
61 Correct 1699 ms 93988 KB Output is correct
62 Correct 1545 ms 94028 KB Output is correct
63 Correct 3533 ms 93904 KB Output is correct
64 Correct 2065 ms 94212 KB Output is correct
65 Correct 1696 ms 93900 KB Output is correct
66 Correct 1888 ms 94284 KB Output is correct
67 Correct 2069 ms 97080 KB Output is correct
68 Correct 1637 ms 108312 KB Output is correct
69 Correct 3756 ms 117320 KB Output is correct