제출 #294722

#제출 시각아이디문제언어결과실행 시간메모리
294722AutoratchSeats (IOI18_seats)C++14
0 / 100
4027 ms43648 KiB
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1e6;

int m,n,ans[N];
vector<int> x,y,mnx(N),mxx(N),mny(N),mxy(N);
 
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(i) ans[i] = ans[i-1];
        if((mxx[i]-mnx[i]+1)*(mxy[i]-mny[i]+1)==i+1) ans[i]++;
    }
}
 
int swap_seats(int a,int b) 
{
    swap(x[a],x[b]),swap(y[a],y[b]);
    int oans = ans[m*n-1];
    if(min(a,b)==0) oans-=ans[max(a,b)];
    else oans-=ans[max(a,b)]-ans[min(a,b)-1];
    for(int i = min(a,b);i <= max(a,b);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(i) ans[i] = ans[i-1];
        if((mxx[i]-mnx[i]+1)*(mxy[i]-mny[i]+1)==i+1) ans[i]++,oans++;
    }
    return oans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...