Submission #766701

#	Time	Username	Problem	Language	Result	Execution time	Memory
766701		marvinthang	Seats (IOI18_seats)	C++17	17 / 100	4086 ms	47928 KiB

seats

/*************************************
*    author: marvinthang             *
*    created: 26.06.2023 11:25:22    *
*************************************/

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

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

std::vector<int> r;

int H, W, cnt;
vector <int> R, C, min_r, max_r, min_c, max_c;

bool check(int i) {
    return (max_r[i] - min_r[i] + 1) * (max_c[i] - min_c[i] + 1) == i + 1;
}

void give_initial_chart(int h, int w, vector <int> r, vector <int> c) {
    H = h; W = w; R = r; C = c;
    min_r.resize(H * W);
    max_r.resize(H * W);
    min_c.resize(H * W);
    max_c.resize(H * W);
    REP(i, H * W) {
        min_r[i] = max_r[i] = R[i];
        min_c[i] = max_c[i] = C[i];
        if (i) {
            minimize(min_r[i], min_r[i - 1]);
            maximize(max_r[i], max_r[i - 1]);
            minimize(min_c[i], min_c[i - 1]);
            maximize(max_c[i], max_c[i - 1]);
        }
        cnt += check(i);
    }
}

int swap_seats(int a, int b) {
    swap(R[a], R[b]);
    swap(C[a], C[b]);
    FORE(i, min(a, b), max(a, b)) {
        cnt -= check(i);
        min_r[i] = max_r[i] = R[i];
        min_c[i] = max_c[i] = C[i];
        if (i) {
            minimize(min_r[i], min_r[i - 1]);
            maximize(max_r[i], max_r[i - 1]);
            minimize(min_c[i], min_c[i - 1]);
            maximize(max_c[i], max_c[i - 1]);
        }
        cnt += check(i);
    }
    return cnt;
}

#ifdef LOCAL
#include <cstdio>
#include <cstdlib>
#include <vector>
#include "seats.h"

namespace {

int read_int() {
  int x;
  if (scanf("%d", &x) != 1) {
    fprintf(stderr, "Error while reading input\n");
    exit(1);
  }
  return x;
}

}  // namespace

int main() {
    file("seats");
  int H = read_int();
  int W = read_int();
  int Q = read_int();
  std::vector<int> R(H * W), C(H * W);
  for (int i = 0; i < H * W; ++i) {
    R[i] = read_int();
    C[i] = read_int();
  }
  std::vector<int> A(Q), B(Q);
  for (int j = 0; j < Q; ++j) {
    A[j] = read_int();
    B[j] = read_int();
  }

  give_initial_chart(H, W, R, C);
  for (int j = 0; j < Q; ++j) {
    int answer = swap_seats(A[j], B[j]);
    printf("%d\n", answer);
  }
  return 0;
}
#endif

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