| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 364586 | daniel920712 | 운세 보기 2 (JOI14_fortune_telling2) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <string.h>
#include <map>
#include <vector>
#include <set>
using namespace std;
int K;
int x[200005],y[200005];
pair < int , int > all[200005];
vector < pair < pair < int , int > , pair < int , int > > > a,b;
bool F(pair < int , int > a,pair < int , int > b)
{
if(a.first>b.first) return 1;
if(a.first<b.first) return 0;
return a.second<b.second;
}
set < int > vis,have;
vector < int > Cha;
map < pair < int ,int > , int > all2;
pair < pair < vector < pair < pair < int ,int > , int > > , vector < pair < pair < int ,int > , int > > > , vector < pair < int , pair < int , int > > > > query[1000005];
struct B
{
int l,r;
int nxl,nxr;
int con;
}Node2[2000005];
int now=1,now2=1;
int Find(int y,int here)
{
int t=0;
if(here==-1) return 0;
if(all2.upper_bound((make_pair(y+1,(int) -1)))==all2.begin()) t=0;
else
{
auto a=*prev(all2.upper_bound(make_pair(y+1,(int) -1)));
if(a.first.first<=y&&a.first.second>=y) t+=a.second;
}
return t;
}
int Find2(int l,int r,int here)
{
int t=0;
if(here==-1) return 0;
t=0;
if(l==Node2[here].l&&r==Node2[here].r) return Node2[here].con;
if(r<=(Node2[here].l+Node2[here].r)/2) return Find2(l,r,Node2[here].nxl);
else if(l>(Node2[here].l+Node2[here].r)/2) return Find2(l,r,Node2[here].nxr);
else return Find2(l,(Node2[here].l+Node2[here].r)/2,Node2[here].nxl)+Find2((Node2[here].l+Node2[here].r)/2+1,r,Node2[here].nxr);
}
void add2(int where,int here)
{
Node2[here].con++;
if(where==Node2[here].l&&where==Node2[here].r) return;
if(where<=(Node2[here].l+Node2[here].r)/2)
{
add2(where,Node2[here].nxl);
}
else
{
add2(where,Node2[here].nxr);
}
}
int cha(int here)
{
return lower_bound(Cha.begin(),Cha.end(),here)-Cha.begin();
}
void add(int l1,int r1,int l2,int r2,int con,int here)
{
l1=cha(l1);
r1=cha(r1+1);
query[l1].first.first.push_back(make_pair(make_pair(l2,r2),con));
query[r1].first.second.push_back(make_pair(make_pair(l2,r2),con));
}
void build2(int l,int r,int here)
{
Node2[here].l=l;
Node2[here].r=r;
Node2[here].con=0;
if(l==r) return;
Node2[here].nxl=now2++;
Node2[here].nxr=now2++;
build2(l,(l+r)/2,Node2[here].nxl);
build2((l+r)/2+1,r,Node2[here].nxr);
}
int main()
{
//freopen("03-01.in","rt",stdin);
int N,K,i,j,con,ok=0,con2=0,tt,tt2,ttt=0;
long long ans=0;
scanf("%d %d",&N,&K);
assert(K<=200000);
//printf("%d\n",);
build2(0,1e6,0);
//printf("bb\n");
for(i=0;i<N;i++)
{
scanf("%d %d",&x[i],&y[i]);
have.insert(x[i]);
}
//printf("aa\n");
for(i=1;i<=K;i++)
{
scanf("%d",&all[i].first);
//if(i%1000==0) printf("%d %d\n",i,K);
all[i].second=i;
have.insert(all[i].first);
have.insert(all[i].first+1);
}
have.insert(0);
have.insert(0+1);
have.insert(1e9+5);
have.insert(1e9+5+1);
printf("%d\n",have.size());
for(auto i:have) Cha.push_back(i);
for(i=0;i<N;i++) query[cha(x[i])].second.push_back(make_pair(y[i],make_pair(x[i],y[i])));
vis.insert(0);
vis.insert(1e9+5);
for(i=K;i>=1;i--)
{
con=0;
con2=0;
con=Find2(cha(all[i].first+1),cha(1e9+5),0);
for(j=i+1;j<=K;j++) if(all[j].first>all[i].first) con2++;
if(vis.find(all[i].first)!=vis.end())
{
add2(cha(all[i].first),0);
continue;
}
tt=*vis.upper_bound(all[i].first);
tt2=*prev(vis.upper_bound(all[i].first));
if(con2%2==0)
{
a.push_back(make_pair(make_pair(all[i].first+1,tt),make_pair(tt2+1,all[i].first)));
b.push_back(make_pair(make_pair(tt2+1,all[i].first),make_pair(all[i].first+1,tt)));
}
else
{
b.push_back(make_pair(make_pair(all[i].first+1,tt),make_pair(tt2+1,all[i].first)));
a.push_back(make_pair(make_pair(tt2+1,all[i].first),make_pair(all[i].first+1,tt)));
}
vis.insert(all[i].first);
add2(cha(all[i].first),0);
}
//if(N>1000||K>1000) return 0;
all[0].first=1e9+5;
all[0].second=0;
sort(all+1,all+K+1,F);
all[K+1].first=0;
all[K+1].second=K+1;
for(i=1;i<=K+1;i++)
{
con=0;
con2=i;
if(all[i].first!=all[i-1].first)
{
if(con2%2==1) a.push_back(make_pair(make_pair(all[i].first+1,all[i-1].first),make_pair(all[i].first+1,all[i-1].first)));
else b.push_back(make_pair(make_pair(all[i].first+1,all[i-1].first),make_pair(all[i].first+1,all[i-1].first)));
}
}
for(auto j:a) add(j.first.first,j.first.second,j.second.first,j.second.second,1,0);
for(auto j:b) add(j.first.first,j.first.second,j.second.first,j.second.second,1e9,0);
for(i=0;i<1000000;i++)
{
//if(i%1000==0) printf("%d\n",i);
for(auto j:query[i].first.second) all2.erase(j.first);
for(auto j:query[i].first.first) all2[j.first]=j.second;
for(auto j:query[i].second)
{
if(Find(j.first,0)==1) ans+=j.second.first;
else ans+=j.second.second;
}
}
printf("%lld\n",ans);
return 0;
}