Submission #758303

#TimeUsernameProblemLanguageResultExecution timeMemory
758303alexander707070Seats (IOI18_seats)C++14
0 / 100
4018 ms39360 KiB
#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;

int n,m,minx[MAXN],miny[MAXN],maxx[MAXN],maxy[MAXN],curr,old;
pair<int,int> w[MAXN];

int swap_seats(int x,int y){
    x++; y++;
    int ans=old;

    for(int i=x;i<=y;i++){
        minx[i]=minx[i-1];
        maxx[i]=maxx[i-1];
        miny[i]=miny[i-1];
        maxy[i]=maxy[i-1];

        minx[i]=min(minx[i],w[i].first);
        maxx[i]=max(maxx[i],w[i].first);
        miny[i]=min(miny[i],w[i].second);
        maxy[i]=max(maxy[i],w[i].second);

        if((maxx[i]-minx[i]+1)*(maxy[i]-miny[i]+1)==i)ans--;
    }

    ans=max(ans,0);
    swap(w[x],w[y]);

    for(int i=x;i<=y;i++){
        minx[i]=minx[i-1];
        maxx[i]=maxx[i-1];
        miny[i]=miny[i-1];
        maxy[i]=maxy[i-1];

        minx[i]=min(minx[i],w[i].first);
        maxx[i]=max(maxx[i],w[i].first);
        miny[i]=min(miny[i],w[i].second);
        maxy[i]=max(maxy[i],w[i].second);

        if((maxx[i]-minx[i]+1)*(maxy[i]-miny[i]+1)==i)ans++;
    }

    old=ans;
    return ans;
}

void give_initial_chart(int H, int W,vector<int> R,vector<int> C){
    n=H; m=W;
    for(int i=1;i<=n*m;i++){
        w[i]={R[i-1],C[i-1]};
    }
    minx[0]=miny[0]=n+m;
    maxx[0]=maxy[0]=-1;

    swap_seats(0,n*m-1);
    swap_seats(0,n*m-1);
}

/*
int main(){

    give_initial_chart(2, 3, {0, 1, 1, 0, 0, 1}, {0, 0, 1,1, 2, 2});
    cout<<swap_seats(0, 5)<<" "<<swap_seats(0, 5)<<"\n";
}
*/
#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...