Submission #411372

#	Time	Username	Problem	Language	Result	Execution time	Memory
411372		usachevd0	Seats (IOI18_seats)	C++14	17 / 100	4057 ms	56624 KiB

seats

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

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define Time (clock() * 1.0 / CLOCKS_PER_SEC)
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using ld = long double;
template<typename T1, typename T2> bool chkmin(T1& x, T2 y) {
    return y < x ? (x = y, true) : false;
}
template<typename T1, typename T2> bool chkmax(T1& x, T2 y) {
    return y > x ? (x = y, true) : false;
}
void debug_out() {
    cerr << endl;
}
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) {
    cerr << ' ' << A;
    debug_out(B...);
}
template<typename T> void mdebug_out(T* a, int n) {
    for (int i = 0; i < n; ++i)
        cerr << a[i] << ' ';
    cerr << endl;
}
#ifdef LOCAL
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
    #define mdebug(a, n) cerr << #a << ": ", mdebug_out(a, n)
#else
    #define debug(...) 1337
    #define mdebug(a, n) 1337
#endif
template<typename T> ostream& operator << (ostream& stream, const vector<T>& v) {
    for (auto& x : v)
        stream << x << ' ';
    return stream;
}
template<typename T1, typename T2> ostream& operator << (ostream& stream, const pair<T1, T2>& p) {
    return stream << p.first << ' ' << p.second;
}


const int INF32 = 1e9;
const int logS = 20;
const int maxS = 1e6 + 6;
int N, M, S;
int X[maxS], Y[maxS];

int cur;
int minX[maxS], maxX[maxS], minY[maxS], maxY[maxS];
bool good[maxS];

void give_initial_chart(int _N, int _M, vector<int> _X, vector<int> _Y) {
    N = _N, M = _M;
    S = N * M;
    for (int i = 0; i < S; ++i) {
        X[i] = _X[i];
        Y[i] = _Y[i];
    }
    
    cur = 0;
    minX[0] = minY[0] = +INF32;
    maxX[0] = maxY[0] = -INF32;
    for (int k = 0; k < S; ++k) {
        minX[k + 1] = min(minX[k], X[k]);
        maxX[k + 1] = max(maxX[k], X[k]);
        minY[k + 1] = min(minY[k], Y[k]);
        maxY[k + 1] = max(maxY[k], Y[k]);
        good[k] = (maxX[k + 1] - minX[k + 1] + 1) * (maxY[k + 1] - minY[k + 1] + 1) == k + 1;
        cur += good[k];
    }
}

int swap_seats(int a, int b) {
    if (a > b) swap(a, b);
    swap(X[a], X[b]);
    swap(Y[a], Y[b]);
    for (int k = a; k <= b; ++k) {
        cur -= good[k];
        minX[k + 1] = min(minX[k], X[k]);
        maxX[k + 1] = max(maxX[k], X[k]);
        minY[k + 1] = min(minY[k], Y[k]);
        maxY[k + 1] = max(maxY[k], Y[k]);
        good[k] = (maxX[k + 1] - minX[k + 1] + 1) * (maxY[k + 1] - minY[k + 1] + 1) == k + 1;
        cur += good[k];
    }
    return cur;
}

#ifdef LOCAL

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

int32_t main() {
#ifdef LOCAL
    freopen("in", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    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