제출 #294754

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
294754		Autoratch	자리 배치 (IOI18_seats)	C++14	17 / 100	4096 ms	59384 KiB

seats

#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1e6 + 3;

int m,n,ans[N];
vector<int> x,y,mnx(N),mxx(N),mny(N),mxy(N);
int fw[N+1];

void update(int idx,int val){ idx++; while(idx<N) fw[idx]+=val,idx+=(idx & -idx); }

int read(int idx){ idx++; int val = 0; while(idx>0) val+=fw[idx],idx-=(idx & -idx); return val; }

void give_initial_chart(int H, int W,vector<int> R,vector<int> C) 
{
    m = H,n = W,x = R,y = C;
    for(int i = 0;i < m*n;i++) 
    {
        if(!i) mnx[i] = mxx[i] = x[i],mny[i] = mxy[i] = y[i];
        else mnx[i] = min(mnx[i-1],x[i]),mxx[i] = max(mxx[i-1],x[i]),mny[i] = min(mny[i-1],y[i]),mxy[i] = max(mxy[i-1],y[i]);
        if((mxx[i]-mnx[i]+1)*(mxy[i]-mny[i]+1)==i+1) update(i,1);
    }
}
 
int swap_seats(int a,int b) 
{
    swap(x[a],x[b]),swap(y[a],y[b]);
    for(int i = min(a,b);i <= max(a,b);i++)
    {
        if(read(i)-read(i-1)) update(i,-1);
        if(!i) mnx[i] = mxx[i] = x[i],mny[i] = mxy[i] = y[i];
        else mnx[i] = min(mnx[i-1],x[i]),mxx[i] = max(mxx[i-1],x[i]),mny[i] = min(mny[i-1],y[i]),mxy[i] = max(mxy[i-1],y[i]);
        if((mxx[i]-mnx[i]+1)*(mxy[i]-mny[i]+1)==i+1) update(i,1);
    }
    return read(m*n-1);
}

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