Submission #117990

#	Time	Username	Problem	Language	Result	Execution time	Memory
117990		Osama_Alkhodairy	Seats (IOI18_seats)	C++17	0 / 100	4097 ms	47860 KiB

seats

#include <bits/stdc++.h>
#include "seats.h"
//#include "grader.cpp"
using namespace std;

const int N = 1000001;

int n, m, mnx[N], mny[N], mxx[N], mxy[N], pref[N], suff[N];
vector <int> x, y;

bool check(int g){
    return (mxx[g] - mnx[g] + 1) * (mxy[g] - mny[g] + 1) == g + 1;
}
void update(int i){
    mnx[i] = i == 0 ? x[i] : min(x[i], mnx[i - 1]);
    mxx[i] = i == 0 ? x[i] : max(x[i], mxx[i - 1]);
    mny[i] = i == 0 ? y[i] : min(y[i], mny[i - 1]);
    mxy[i] = i == 0 ? y[i] : max(y[i], mxy[i - 1]);
}
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    n = H;
    m = W;
    x = R;
    y = C;
    for(int i = 0 ; i < n * m ; i++){
        update(i);
        pref[i] = check(i) + (i == 0 ? 0 : pref[i - 1]);
    }
    for(int i = n * m - 1 ; i >= 0 ; i--){
        suff[i] = check(i) + (i == n * m - 1 ? 0 : suff[i + 1]);
    }
}
int swap_seats(int a, int b) {
    if(a > b) swap(a, b);
    swap(x[a], x[b]);
    swap(y[a], y[b]);
    int ret = (a == 0 ? 0 : pref[a - 1]) + (b == n * m + 1 ? 0 : suff[b + 1]);
    for(int i = a ; i <= b ; i++){
        update(i);
        ret += check(i);
        pref[i] = check(i) + (i == 0 ? 0 : pref[i - 1]);
    }
    for(int i = b ; i >= a ; i--){
        suff[i] = check(i) + (i == n * m - 1 ? 0 : suff[i + 1]);
    }
    return ret;
}

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