Submission #1176307

#TimeUsernameProblemLanguageResultExecution timeMemory
1176307LuvidiSeats (IOI18_seats)C++20
17 / 100
4094 ms39960 KiB
#include "seats.h" #include <bits/stdc++.h> using namespace std; const int maxnm=1e6; #define pii pair<int,int> #define fs first #define sc second int n,m,cnt; vector<int> r,c; pair<pii,pii> a[maxnm+1]; pair<pii,pii> mrg(pair<pii,pii> p1,pair<pii,pii> p2){ return {{min(p1.fs.fs,p2.fs.fs),max(p1.fs.sc,p2.fs.sc)},{min(p1.sc.fs,p2.sc.fs),max(p1.sc.sc,p2.sc.sc)}}; } void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) { r=c={0}; for(int i:R)r.push_back(i); for(int i:C)c.push_back(i); n=H,m=W; a[0]={{1e9,-1e9},{1e9,-1e9}}; for(int i=1;i<=n*m;i++){ a[i]=mrg(a[i-1],{{r[i],r[i]},{c[i],c[i]}}); cnt+=1LL*(a[i].fs.sc-a[i].fs.fs+1)*(a[i].sc.sc-a[i].sc.fs+1)==i; } } int swap_seats(int x, int y) { if(x>y)swap(x,y); x++;y++; swap(r[x],r[y]); swap(c[x],c[y]); for(int i=x;i<y;i++){ cnt-=1LL*(a[i].fs.sc-a[i].fs.fs+1)*(a[i].sc.sc-a[i].sc.fs+1)==i; a[i]=mrg(a[i-1],{{r[i],r[i]},{c[i],c[i]}}); cnt+=1LL*(a[i].fs.sc-a[i].fs.fs+1)*(a[i].sc.sc-a[i].sc.fs+1)==i; } return cnt; }
#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...