QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#163693 | #7105. Pixel Art | ucup-team1479 | RE | 3ms | 6120kb | C++14 | 2.6kb | 2023-09-04 14:06:52 | 2023-09-04 14:06:52 |
Judging History
answer
//prepare for coding{{{
#include<bits/stdc++.h>
#define RELEASE
#ifndef RELEASE
#define FL
#define DB(...) fprintf(stderr,__VA_ARGS__)
#else
#define DB(...) ;
#endif
#define PB push_back
typedef long long LL;
const int N=100000,M=100000,Q=100000;
using namespace std;
inline int Read(){
char c=getchar();
int res=0;
bool b=0;
while(c>'9'||c<'0')
b=(c=='-'),c=getchar();
while(c>='0'&&c<='9')
res=(res<<3)+(res<<1)+c-'0',c=getchar();
return b?-res:res;
}
int n,m,q;
LL ans1,ans2,ad1;
//}}}
//operations{{{
struct OPRT{
int l,r,id;
bool op;
inline bool operator<(const OPRT &x)const{
return op==x.op?l<x.l:op<x.op;
}
inline OPRT(int l_,int r_,bool op_,int id_){
l=l_,r=r_,op=op_,id=id_;
}
};
vector<OPRT> op[N+10];
//}}}
//set{{{
struct RNG{
int l,r,id;
inline RNG(int l_,int r_,int id_){
l=l_,r=r_,id=id_;
}
inline bool operator<(const RNG &x)const{
return l==x.l?r<x.r:l<x.l;
}
};
set<RNG> s;
//}}}
//unionable and findable set{{{
struct UFS{
int f[N+10];
inline int GetRt(int u){
return f[u]?f[u]=GetRt(f[u]):u;
}
inline void Union(int u,int v){
u=GetRt(u),v=GetRt(v);
if(u==v)
return;
--ans2;
f[u]=v;
}
inline void Clear(){
for(int i=1;i<=q;++i)
f[i]=0;
}
}ufs;
//}}}
//solve{{{
inline void Query(int l,int r,int id){
++ans2;
auto it=s.upper_bound(RNG(l,n+1,0)),ed=s.upper_bound(RNG(r,n+1,0));
if(it!=s.begin())
--it;
if(it!=ed&&it->r<l)
++it;
if(n==3&&m==100&&l==1)
printf("%lld\n",it==s.begin());
while(it!=ed)
ufs.Union((*it).id,id),++it;
}
inline void Del(int l,int r,int id){
ad1-=r-l+1;
s.erase(s.find(RNG(l,r,id)));
}
inline void Add(int l,int r,int id){
ad1+=r-l+1;
auto it=s.insert(RNG(l,r,id)).first;
if(it!=s.begin()&&(--it)->r==l-1)
ufs.Union(it->id,id);
}
//}}}
//main{{{
inline void Solve(){
n=Read(),m=Read(),q=Read();
for(int i=1;i<=q;++i){
int xx=Read(),xy=Read(),yx=Read(),yy=Read();
op[xx].PB(OPRT(xy,yy,1,i));
op[yx+1].PB(OPRT(xy,yy,0,i));
}
for(int i=1;i<=n;++i){
for(OPRT x:op[i])
if(x.op)
Query(x.l,x.r,x.id);
for(OPRT x:op[i]){
int l=x.l,r=x.r,id=x.id;
if(x.op)
Add(l,r,id);
else
Del(l,r,id);
}
ans1+=ad1;
printf("%lld %lld\n",ans1,ans2);
}
ans1=ans2=ad1=0;
s.clear();
ufs.Clear();
for(int i=1;i<=n+1;++i)
op[i].clear();
}
int main(){
#ifdef FL
freopen(".in","r",stdin);
freopen(".out","w",stdout);
#endif
int T=Read()+1;
while(--T)
Solve();
return 0;
}
//}}}
//《象》曰:泽灭木,大过。君子以独立不惧,遁世无
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 6120kb
input:
3 2 5 2 1 1 1 2 2 3 2 5 2 5 2 1 1 1 3 2 3 2 5 3 3 3 1 1 1 2 3 1 3 2 1 3 2 3
output:
2 1 5 2 3 1 6 1 3 1 4 1 6 2
result:
ok 7 lines
Test #2:
score: -100
Dangerous Syscalls
input:
2130 2 5 2 1 1 1 2 2 3 2 5 2 5 2 1 1 1 3 2 3 2 5 3 3 3 1 1 1 2 3 1 3 2 1 3 2 3 3 100 51 1 2 2 2 1 4 2 4 1 6 2 6 1 8 2 8 1 10 2 10 1 12 2 12 1 14 2 14 1 16 2 16 1 18 2 18 1 20 2 20 1 22 2 22 1 24 2 24 1 26 2 26 1 28 2 28 1 30 2 30 1 32 2 32 1 34 2 34 1 36 2 36 1 38 2 38 1 40 2 40 1 42 2 42 1 44 2 44 ...
output:
2 1 5 2 3 1 6 1 3 1 4 1 6 2 50 50 100 50 1 200 2 1 50 50 150 50 200 50 2 1 4 1 6 1 8 1 10 1 12 1 14 1 16 1 18 1 20 1 22 1 24 1 26 1 28 1 30 1 32 1 34 1 36 1 38 1 40 1 42 1 44 1 46 1 48 1 50 1 52 1 54 1 56 1 58 1 60 1 62 1 64 1 66 1 68 1 70 1 72 1 74 1 76 1 78 1 80 1 82 1 84 1 86 1 88 1 90 1 92 1 94 ...