oj.uz

Submission #296766

# Submission time Handle Problem Language Result Execution time Memory
296766 2020-09-10T21:14:20 Z Bruteforceman Seats (IOI18_seats) C++11
100 / 100
 3576 ms 173944 KB 
#include "bits/stdc++.h"
#include "seats.h"
using namespace std;
const int maxn = 1e6 + 10;
vector <vector <int>> a;
vector <vector <bool>> can;
vector <int> row, col;
int h, w;
int arr[maxn];

bool inside(int x, int y) {
  return (0 <= x && x < h) && (0 <= y && y < w);
}
struct node {
  int val, cnt;
  int lazy;
  void add(int x) {
    val += x;
    lazy += x;
  }
} t[maxn * 4];
void pushdown(int c) {
  if(!t[c].lazy) return ;
  int l = c << 1;
  int r = l + 1;
  t[l].add(t[c].lazy);
  t[r].add(t[c].lazy);
  t[c].lazy = 0;
}
void build(int c = 1, int b = 0, int e = h * w - 1) {
  t[c].val = t[c].lazy = 0;
  t[c].cnt = e - b + 1;
  if(b == e) return ;
  int m = (b + e) >> 1;
  int l = c << 1;
  int r = l + 1;
  build(l, b, m);
  build(r, m + 1, e);
}
void add(int x, int y, int val, int c = 1, int b = 0, int e = h * w - 1) {
  if(x > y) return ;
  if(x <= b && e <= y) {
    t[c].add(val);
    return ;
  }
  if(y < b || e < x) return ;
  pushdown(c);
  int m = (b + e) >> 1;
  int l = c << 1;
  int r = l + 1;
  add(x, y, val, l, b, m);
  add(x, y, val, r, m + 1, e);
  t[c].val = min(t[l].val, t[r].val);
  t[c].cnt = 0;
  if(t[c].val == t[l].val) t[c].cnt += t[l].cnt;
  if(t[c].val == t[r].val) t[c].cnt += t[r].cnt;
}
void process(int x, int y, int val) {
  for(int dx : {-1, 1}) {
    for(int dy : {-1, 1}) {
      if(dx == -1 && dy == -1) continue;
      if(inside(x + dx, y) && !can[x + dx][y] && 
         inside(x, y + dy) && !can[x][y + dy] && !can[x][y]) continue;
      int r = h * w;
      if(inside(x + dx, y)) r = min(r, a[x + dx][y]);
      if(inside(x, y + dy)) r = min(r, a[x][y + dy]);
      add(a[x][y], r - 1, val);
      if(dx != 1 || dy != 1) continue;
      r = 0;
      if(inside(x + dx, y)) r = max(r, a[x + dx][y]);
      else r = h * w;
      if(inside(x, y + dy)) r = max(r, a[x][y + dy]);
      else r = h * w;
      add(r, a[x][y] - 1, val);
    }
  }
}
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
  h = H;
  w = W;
  a = vector <vector <int>> (H, vector <int> (W, 0));
  can = vector <vector <bool>> (H, vector <bool> (W, true));
  row = R;
  col = C;
  for(int i = 0; i < H * W; i++) {
    a[row[i]][col[i]] = i;
  }
  build();
  for(int i = 0; i < h; i++) {
    for(int j = 0; j < w; j++) {
      process(i, j, 1);
    }
  }
  for(int i = 0; i < h; i++) {
    for(int j = 0; j < w; j++) {
      can[i][j] = false;
    }
  }
}
const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};

int swap_seats(int p, int q) {
  int ans = 0;
  set <pair <int, int>> change;
  change.insert(make_pair(row[p], col[p]));
  change.insert(make_pair(row[q], col[q]));
  can[row[p]][col[p]] = can[row[q]][col[q]] = true;
  for(int i = 0; i < 4; i++) {
    int x = row[p] + dx[i];
    int y = col[p] + dy[i];
    if(inside(x, y)) change.insert(make_pair(x, y));
  }
  for(int i = 0; i < 4; i++) {
    int x = row[q] + dx[i];
    int y = col[q] + dy[i];
    if(inside(x, y)) change.insert(make_pair(x, y));
  }
  for(auto i : change) {
    process(i.first, i.second, -1);  
  }
  swap(a[row[p]][col[p]], a[row[q]][col[q]]);
  swap(row[p], row[q]);
  swap(col[p], col[q]);
  for(auto i : change) {
    process(i.first, i.second, 1);  
  }
  can[row[p]][col[p]] = can[row[q]][col[q]] = false; 
  return t[1].cnt;
}

Compilation message

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:104:7: warning: unused variable 'ans' [-Wunused-variable]
  104 |   int ans = 0;
      |       ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 512 KB Output is correct
2 Correct 26 ms 384 KB Output is correct
3 Correct 35 ms 384 KB Output is correct
4 Correct 29 ms 416 KB Output is correct
5 Correct 27 ms 512 KB Output is correct
6 Correct 38 ms 384 KB Output is correct
7 Correct 36 ms 384 KB Output is correct
8 Correct 30 ms 384 KB Output is correct
9 Correct 31 ms 384 KB Output is correct
10 Correct 36 ms 504 KB Output is correct
11 Correct 36 ms 504 KB Output is correct
12 Correct 25 ms 384 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 512 KB Output is correct
2 Correct 26 ms 384 KB Output is correct
3 Correct 35 ms 384 KB Output is correct
4 Correct 29 ms 416 KB Output is correct
5 Correct 27 ms 512 KB Output is correct
6 Correct 38 ms 384 KB Output is correct
7 Correct 36 ms 384 KB Output is correct
8 Correct 30 ms 384 KB Output is correct
9 Correct 31 ms 384 KB Output is correct
10 Correct 36 ms 504 KB Output is correct
11 Correct 36 ms 504 KB Output is correct
12 Correct 25 ms 384 KB Output is correct
13 Correct 61 ms 1024 KB Output is correct
14 Correct 72 ms 1024 KB Output is correct
15 Correct 71 ms 1104 KB Output is correct
16 Correct 58 ms 2296 KB Output is correct
17 Correct 74 ms 1188 KB Output is correct
18 Correct 55 ms 1144 KB Output is correct
19 Correct 52 ms 1152 KB Output is correct
20 Correct 50 ms 1664 KB Output is correct
21 Correct 50 ms 1024 KB Output is correct
22 Correct 56 ms 2304 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2177 ms 52756 KB Output is correct
2 Correct 1194 ms 52600 KB Output is correct
3 Correct 875 ms 52856 KB Output is correct
4 Correct 920 ms 52748 KB Output is correct
5 Correct 959 ms 52748 KB Output is correct
6 Correct 904 ms 52600 KB Output is correct
7 Correct 973 ms 52620 KB Output is correct
8 Correct 1034 ms 52728 KB Output is correct
9 Correct 1045 ms 52748 KB Output is correct
10 Correct 1006 ms 52728 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 1144 KB Output is correct
2 Correct 151 ms 5880 KB Output is correct
3 Correct 830 ms 52728 KB Output is correct
4 Correct 2114 ms 52728 KB Output is correct
5 Correct 870 ms 52660 KB Output is correct
6 Correct 2445 ms 173944 KB Output is correct
7 Correct 1076 ms 52832 KB Output is correct
8 Correct 1111 ms 52600 KB Output is correct
9 Correct 986 ms 53756 KB Output is correct
10 Correct 1057 ms 62840 KB Output is correct
11 Correct 1095 ms 111352 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 1396 KB Output is correct
2 Correct 159 ms 1452 KB Output is correct
3 Correct 243 ms 1396 KB Output is correct
4 Correct 324 ms 1528 KB Output is correct
5 Correct 629 ms 2104 KB Output is correct
6 Correct 1765 ms 53188 KB Output is correct
7 Correct 1954 ms 53040 KB Output is correct
8 Correct 1496 ms 53168 KB Output is correct
9 Correct 3352 ms 53064 KB Output is correct
10 Correct 1696 ms 53040 KB Output is correct
11 Correct 1591 ms 53168 KB Output is correct
12 Correct 1940 ms 53160 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 512 KB Output is correct
2 Correct 26 ms 384 KB Output is correct
3 Correct 35 ms 384 KB Output is correct
4 Correct 29 ms 416 KB Output is correct
5 Correct 27 ms 512 KB Output is correct
6 Correct 38 ms 384 KB Output is correct
7 Correct 36 ms 384 KB Output is correct
8 Correct 30 ms 384 KB Output is correct
9 Correct 31 ms 384 KB Output is correct
10 Correct 36 ms 504 KB Output is correct
11 Correct 36 ms 504 KB Output is correct
12 Correct 25 ms 384 KB Output is correct
13 Correct 61 ms 1024 KB Output is correct
14 Correct 72 ms 1024 KB Output is correct
15 Correct 71 ms 1104 KB Output is correct
16 Correct 58 ms 2296 KB Output is correct
17 Correct 74 ms 1188 KB Output is correct
18 Correct 55 ms 1144 KB Output is correct
19 Correct 52 ms 1152 KB Output is correct
20 Correct 50 ms 1664 KB Output is correct
21 Correct 50 ms 1024 KB Output is correct
22 Correct 56 ms 2304 KB Output is correct
23 Correct 2177 ms 52756 KB Output is correct
24 Correct 1194 ms 52600 KB Output is correct
25 Correct 875 ms 52856 KB Output is correct
26 Correct 920 ms 52748 KB Output is correct
27 Correct 959 ms 52748 KB Output is correct
28 Correct 904 ms 52600 KB Output is correct
29 Correct 973 ms 52620 KB Output is correct
30 Correct 1034 ms 52728 KB Output is correct
31 Correct 1045 ms 52748 KB Output is correct
32 Correct 1006 ms 52728 KB Output is correct
33 Correct 57 ms 1144 KB Output is correct
34 Correct 151 ms 5880 KB Output is correct
35 Correct 830 ms 52728 KB Output is correct
36 Correct 2114 ms 52728 KB Output is correct
37 Correct 870 ms 52660 KB Output is correct
38 Correct 2445 ms 173944 KB Output is correct
39 Correct 1076 ms 52832 KB Output is correct
40 Correct 1111 ms 52600 KB Output is correct
41 Correct 986 ms 53756 KB Output is correct
42 Correct 1057 ms 62840 KB Output is correct
43 Correct 1095 ms 111352 KB Output is correct
44 Correct 64 ms 1396 KB Output is correct
45 Correct 159 ms 1452 KB Output is correct
46 Correct 243 ms 1396 KB Output is correct
47 Correct 324 ms 1528 KB Output is correct
48 Correct 629 ms 2104 KB Output is correct
49 Correct 1765 ms 53188 KB Output is correct
50 Correct 1954 ms 53040 KB Output is correct
51 Correct 1496 ms 53168 KB Output is correct
52 Correct 3352 ms 53064 KB Output is correct
53 Correct 1696 ms 53040 KB Output is correct
54 Correct 1591 ms 53168 KB Output is correct
55 Correct 1940 ms 53160 KB Output is correct
56 Correct 196 ms 1396 KB Output is correct
57 Correct 348 ms 1544 KB Output is correct
58 Correct 442 ms 2080 KB Output is correct
59 Correct 1705 ms 53112 KB Output is correct
60 Correct 3140 ms 53240 KB Output is correct
61 Correct 1564 ms 53144 KB Output is correct
62 Correct 1462 ms 53204 KB Output is correct
63 Correct 3319 ms 53088 KB Output is correct
64 Correct 1743 ms 52980 KB Output is correct
65 Correct 1672 ms 53008 KB Output is correct
66 Correct 1983 ms 54008 KB Output is correct
67 Correct 1952 ms 63096 KB Output is correct
68 Correct 1659 ms 90748 KB Output is correct
69 Correct 3576 ms 111608 KB Output is correct