제출 #561311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
561311		MilosMilutinovic	Seats (IOI18_seats)	C++14	0 / 100	2647 ms	121112 KiB

seats

#include "seats.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX = 1000005;

tuple<int, int, int, int, int> st[4 * MAX];
tuple<int, int, int, int, int> lzy[4 * MAX];

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

void pull(int node, int l, int r) {
  if (l == r || get<4>(st[node + node]) == 0) {
    get<4>(st[node]) = r - l + 1;
    return;
  }
  bool same = true;
  if (get<0>(st[node + node]) != get<0>(st[node + node + 1])) {
    same = false;
  }
  if (get<1>(st[node + node]) != get<1>(st[node + node + 1])) {
    same = false;
  }
  if (get<2>(st[node + node]) != get<2>(st[node + node + 1])) {
    same = false;
  }
  if (get<3>(st[node + node]) != get<3>(st[node + node + 1])) {
    same = false;
  }
  if (!same) {
    st[node] = min(st[node + node], st[node + node + 1]);
  } else {
    st[node] = st[node + node];
    get<4>(st[node]) += get<4>(st[node + node + 1]);
  }
}

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

int solve() {
  bool valid = true;
  if (get<0>(st[1]) != 1) {
    valid = false;
  }
  if (get<1>(st[1]) != 1) {
    valid = false;
  }
  if (get<2>(st[1]) != 1) {
    valid = false;
  }
  if (get<3>(st[1]) != 1) {
    valid = false;
  }
  if (!valid) {
    return 0;
  } else {
    return get<4>(st[1]);
  }
}

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

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

void add(int p, int i, int j, int v) {
  for (int dir = 0; dir < 4; dir++) {
    int q = h * w;
    for (int d = 0; d < 3; d++) {
      int ni = i + dx[dir][d];
      int nj = j + dy[dir][d];
      if (d == 0 && ni >= 0 && ni < h) {
        q = min(q, a[ni][j]);
      }
      if (d == 1 && nj >= 0 && nj < w) {
        q = min(q, a[i][nj]);
      }
      if (d == 2 && ni >= 0 && ni < h && nj >= 0 && nj < w) {
        q = min(q, a[ni][nj]);
      }
    }
    --q;
    if (q < p) {
      continue;
    }
    modify(1, 0, h * w - 1, p, q, dir, v);
  }
}

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;
  }
  for (int i = 0; i < H * W; i++) {
    add(i, x[i], y[i], 1);
  }
  solve();
}

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

set<pair<int, int>> was;

bool Valid(int i, int j) {
  return i >= 0 && i < h && j >= 0 && j < w && !was.count(make_pair(i, j));
}

int swap_seats(int i, int j) {
  was.clear();
  for (int d = 0; d < 9; d++) {
    {
      int ni = x[i] + di[d];
      int nj = y[i] + dj[d];
      if (Valid(ni, nj)) {
        add(a[ni][nj], ni, nj, -1);
      }
      was.insert(make_pair(ni, nj));
    }
    {
      int ni = x[j] + di[d];
      int nj = y[j] + dj[d];
      if (Valid(ni, nj)) {
        add(a[ni][nj], ni, nj, -1);
      }
      was.insert(make_pair(ni, nj));
    }
  }
  swap(a[x[i]][y[i]], a[x[j]][y[j]]);
  swap(x[i], x[j]);
  swap(y[i], y[j]);
  was.clear();
  for (int d = 0; d < 9; d++) {
    {
      int ni = x[i] + di[d];
      int nj = y[i] + dj[d];
      if (Valid(ni, nj)) {
        add(a[ni][nj], ni, nj, 1);
      }
      was.insert(make_pair(ni, nj));
    }
    {
      int ni = x[j] + di[d];
      int nj = y[j] + dj[d];
      if (Valid(ni, nj)) {
        add(a[ni][nj], ni, nj, 1);
      }
      was.insert(make_pair(ni, nj));
    }
  }
  return solve();
}

/*
2 3 2
0 0
1 0
1 1
0 1
0 2
1 2
0 5
0 5
*/

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 20
• Subtask 4: 0 / 6
• Subtask 5: 0 / 33
• Subtask 6: 0 / 30