제출 #777419

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777419		NeroZein	Seats (IOI18_seats)	C++17	0 / 100	4101 ms	49144 KiB

seats

#include "seats.h"
#include "bits/stdc++.h"
using namespace std; 

int n, m;
vector<vector<int>> a;

int ans; 
vector<int> s;
vector<int> r, c;
vector<int> mxR, mnR, mxC, mnC;

void edit (int ll, int rr) {
  if (ll == 0) {
    mxR[0] = mnR[0] = r[0];
    mxC[0] = mnC[0] = c[0];
    ll = 1; 
  }
  for (int i = ll; i <= rr; ++i) {
    if (s[i]) {
      s[i] = 0;
      ans--; 
    }
    mxR[i] = max(mxR[i - 1], r[i]);
    mxC[i] = max(mxC[i - 1], c[i]);
    mnR[i] = min(mnR[i - 1], r[i]);
    mnC[i] = min(mnC[i - 1], c[i]);
    if ((mxR[i] - mnR[i] + 1) * (mxC[i] - mnC[i] + 1) == i + 1) {
      s[i] = 1;
      ans++; 
    }
  }
}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
  n = H, m = W;
  r = R; c = C; 
  a.resize(n);
  s.resize(n * m); 
  mxR.resize(n * m); 
  mxC.resize(n * m); 
  mnR.resize(n * m); 
  mnC.resize(n * m); 
  for (int i = 0; i < n; ++i) {
    a[i].resize(m); 
  }
  for (int i = 0; i < n * m; ++i) {
    a[r[i]][c[i]] = i;
  }
  s[0] = 1; 
  mxR[0] = mnR[0] = r[0];
  mxC[0] = mnC[0] = c[0];
  edit(0, n * m - 1); 
}

int swap_seats(int x, int y) {
  swap(c[x], c[y]);
  swap(r[x], r[y]);
  edit(x, y); 
  return ans + 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