Submission #623370

#	Time	Username	Problem	Language	Result	Execution time	Memory
623370		Ronin13	Seats (IOI18_seats)	C++14	0 / 100	394 ms	40312 KiB

seats

#include "seats.h"
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;


std::vector<int> r;
std :: vector <int> c;
const  int NMAX = 1e6 + 1;

int lazy[4 * NMAX];
pii t[4 * NMAX];
int n, m;
void push(int v){
    if(lazy[v] == 0) return;
    t[2 * v].f += lazy[v];
    t[2 * v + 1].f += lazy[v];
    lazy[2 * v] += lazy[v];
    lazy[2 * v + 1] += lazy[v];
    lazy[v] = 0;
    return;
}

pii merg(pii a, pii b){
    if(a.f < b.f)return a;
    if(a.f > b.f)return b;
    return {a.f, b.s + a.s};
}

void update(int v, int l, int r, int st, int fin, int val){
    if(l > fin || r < st) return;
    if(l >= st && r <= fin) {
        t[v].f += val;
        lazy[v] += val;
        return;
    }
    int m = (l + r) / 2;
    push(v);
    update(2 * v, l, m, st, fin, val);
    update(2 * v +1, m + 1, r, st, fin, val);
    t[v] = merg(t[2 * v], t[2 * v + 1]);
}

void go(int v, int l, int r){
    if(l == r){
        t[v] = {0, 1};
        return;
    }
    int m = (l + r) / 2;
    go(2 * v, l, m);
    go(2 * v + 1, m + 1, r);
    t[v]= {0, t[2 * v].s + t[2 * v + 1].s};
}


void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    r = R;
    c = C;
    n = H, m = W;
    go(1, 1, n * m);
    for(int i = 1; i < n * m; i++){
       // cout << r[i] << ' ' <<  c[i] << "\n";
       if(c[i] < c[i - 1]) update(1, 1, n * m, c[i] + 1, c[i - 1], 1);
    }
    update(1, 1, n * m, c[0] + 1, n * m, 1);
}

int swap_seats(int a, int b) {
    //cout << t[1].f << ' ';
    if(a > 0&& c[a] < c[a - 1]) update(1, 1, n * m, c[a] + 1, c[a - 1], -1);
    if(a < n * m - 1 && c[a + 1] < c[a]) update(1, 1, n * m, c[a + 1] + 1, c[a], -1);
    if(b > 0 && c[b] < c[b - 1]) update(1, 1, n * m, c[b] + 1, c[b - 1], -1);
    if(b < n * m - 1 && c[b + 1] < c[b]) update(1, 1, n * m, c[b + 1] + 1, c[b], -1);
    if(a == 0) update(1, 1, n * m, c[0] + 1, n * m, -1);
    if(b == 0) update(1, 1, n * m, c[0] + 1, n * m, -1);
    swap(c[a], c[b]);
    if(a > 0 && c[a] < c[a - 1]) update(1, 1, n * m, c[a] + 1, c[a - 1], 1);
    if(a < n * m - 1 && c[a + 1] < c[a]) update(1, 1, n * m, c[a + 1] + 1, c[a], 1);
    if(b > 0 && c[b] < c[b - 1]) update(1, 1, n * m, c[b] + 1, c[b - 1], 1);
    if(b < n * m - 1 && c[b + 1] < c[b]) update(1, 1, n * m, c[b + 1] + 1, c[b], 1);
    if(a == 0) update(1, 1, n * m, c[0] + 1, n * m, 1);
    if(b == 0) update(1, 1, n * m, c[0] + 1, n * m, 1);
    //cout << t[1].f << ' ';
    if(t[1].f ==1) return t[1].s;
    return 0;
}

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