HDU 1542 HDU 1225 (선분 트 리 스캐닝 라인)
19610 단어 데이터 구조
HDU1542
제목:
, , 。
, , [l,r+1],
, , ,
[l,r] , ,
, , [l,r+1]
, [l,r+1], 。
코드:
//
// Created by CQU_CST_WuErli
// Copyright (c) 2016 CQU_CST_WuErli. All rights reserved.
//
// #include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define CLR(x) memset(x,0,sizeof(x))
#define OFF(x) memset(x,-1,sizeof(x))
#define MEM(x,a) memset((x),(a),sizeof(x))
#define For_UVa if (kase!=1) cout << endl
#define BUG cout << "I am here" << endl
#define lookln(x) cout << #x << "=" << x << endl
#define SI(a) scanf("%d",&a)
#define SII(a,b) scanf("%d%d",&a,&b)
#define SIII(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define rep(flag,start,end) for(int flag=start;flag<=end;flag++)
#define Rep(flag,start,end) for(int flag=start;flag>=end;flag--)
#define Lson l,mid,rt<<1
#define Rson mid+1,r,rt<<1|1
#define Root 1,n,1
#define BigInteger bign
const int MAX_L=2005;// For BigInteger
const int INF_INT=0x3f3f3f3f;
const long long INF_LL=0x7fffffff;
const int MOD=1e9+7;
const double eps=1e-9;
const double pi=acos(-1);
typedef long long ll;
using namespace std;
const int N=220;
int num[N<<2];
double sum[N<<2];
struct Seg {
double l,r,h;
int val;
Seg(){}
Seg(double l,double r,double h,int val):l(l),r(r),h(h),val(val){}
bool operator < (const Seg& rhs) const {
return hvector v;
vector<double> mp;
int n;
void pushup(int l,int r,int rt) {
if (num[rt]) sum[rt]=mp[r]-mp[l-1];
else if (l==r) sum[rt]=0;
else sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void update(int L,int R,int val,int l,int r,int rt) {
if (L<=l && r<=R) {
num[rt]+=val;
pushup(l,r,rt);
return;
}
int mid=(l+r)>>1;
if (L<=mid) update(L,R,val,Lson);
if (R>mid) update(L,R,val,Rson);
pushup(l,r,rt);
}
int main(int argc, char const *argv[]) {
#ifdef LOCAL
freopen("C:\\Users\\john\\Desktop\\in.txt","r",stdin);
// freopen("C:\\Users\\john\\Desktop\\out.txt","w",stdout);
#endif
// BUG;
int kase=1;
while(SI(n)==1 && n) {
v.clear();mp.clear();
rep(i,1,n) {
double X1,Y1,X2,Y2;
cin >> X1 >> Y1 >> X2 >> Y2;
v.push_back(Seg(X1,X2,Y1,1));
v.push_back(Seg(X1,X2,Y2,-1));
mp.push_back(X1);mp.push_back(X2);
}
sort(v.begin(),v.end());
sort(mp.begin(),mp.end());
mp.resize(unique(mp.begin(),mp.end())-mp.begin());
// for (auto i: mp) cout << i << ' ';
// cout << endl;
CLR(num);CLR(sum);
double ans=0;
int m=mp.size();
rep(i,0,v.size()-2) {
// lookln(v[i].h);
int l=lower_bound(mp.begin(),mp.end(),v[i].l)-mp.begin();
int r=lower_bound(mp.begin(),mp.end(),v[i].r)-mp.begin();
l++,r++;
// cout << l << ' ' << r << endl;
update(l,r-1,v[i].val,1,m,1);
// lookln(sum[1]);
ans+=sum[1]*(v[i+1].h-v[i].h);
}
printf("Test case #%d
",kase++);
printf("Total explored area: %.2f
", ans);
}
return 0;
}
HDU1225
제목:
, , ,
。 , pushdown
, [1,5],[1,3],[4,5],
, ,
, 。
코드:
//
// Created by CQU_CST_WuErli
// Copyright (c) 2016 CQU_CST_WuErli. All rights reserved.
//
// #include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define CLR(x) memset(x,0,sizeof(x))
#define OFF(x) memset(x,-1,sizeof(x))
#define MEM(x,a) memset((x),(a),sizeof(x))
#define For_UVa if (kase!=1) cout << endl
#define BUG cout << "I am here" << endl
#define lookln(x) cout << #x << "=" << x << endl
#define SI(a) scanf("%d",&a)
#define SII(a,b) scanf("%d%d",&a,&b)
#define SIII(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define rep(flag,start,end) for(int flag=start;flag<=end;flag++)
#define Rep(flag,start,end) for(int flag=start;flag>=end;flag--)
#define Lson l,mid,rt<<1
#define Rson mid+1,r,rt<<1|1
#define Root 1,n,1
#define BigInteger bign
const int MAX_L=2005;// For BigInteger
const int INF_INT=0x3f3f3f3f;
const long long INF_LL=0x7fffffff;
const int MOD=1e9+7;
const double eps=1e-9;
const double pi=acos(-1);
typedef long long ll;
using namespace std;
const int N=2e4;
int T;
int n;
int cnt[N<<2];
double one[N<<2],two[N<<2];
struct Seg {
double l,r,h;
int val;
Seg(){}
Seg(double l,double r,double h,int val):l(l),r(r),h(h),val(val){}
bool operator < (const Seg& rhs) const {
return hvector v;
vector<double> mp;
void pushup(int l,int r,int rt) {
if (cnt[rt]>=2) two[rt]=one[rt]=mp[r]-mp[l-1];
else if (cnt[rt]==1) {
one[rt]=mp[r]-mp[l-1];
if (l==r) two[rt]=0;
else two[rt]=one[rt<<1]+one[rt<<1|1];
}
else {
if (l==r) one[rt]=two[rt]=0;
else {
one[rt]=one[rt<<1]+one[rt<<1|1];
two[rt]=two[rt<<1]+two[rt<<1|1];
}
}
}
void update(int L,int R,int val,int l,int r,int rt) {
if (L<=l && r<=R) {
cnt[rt]+=val;
pushup(l,r,rt);
return;
}
int mid=(l+r)>>1;
if (L<=mid) update(L,R,val,Lson);
if (R>mid) update(L,R,val,Rson);
pushup(l,r,rt);
}
int main(int argc, char const *argv[]) {
#ifdef LOCAL
freopen("C:\\Users\\john\\Desktop\\in.txt","r",stdin);
// freopen("C:\\Users\\john\\Desktop\\out.txt","w",stdout);
#endif
SI(T);
while (T--) {
// BUG;
double X1,X2,Y1,Y2;
SI(n);
mp.clear();
v.clear();
rep(i,1,n) {
scanf("%lf%lf%lf%lf",&X1,&Y1,&X2,&Y2);
v.push_back(Seg(X1,X2,Y1,1));
v.push_back(Seg(X1,X2,Y2,-1));
mp.push_back(X1);mp.push_back(X2);
}
sort(v.begin(),v.end());
sort(mp.begin(),mp.end());
mp.resize(unique(mp.begin(),mp.end())-mp.begin());
CLR(cnt);
CLR(one);CLR(two);
int m=mp.size();
double ans=0.0;
// BUG;
rep(i,0,v.size()-2) {
int l=lower_bound(mp.begin(),mp.end(),v[i].l)-mp.begin();
// BUG;
int r=lower_bound(mp.begin(),mp.end(),v[i].r)-mp.begin();
l++,r++;
if (l1,v[i].val,1,m,1);
// BUG;
ans+=two[1]*(v[i+1].h-v[i].h);
}
printf("%.2f
",ans+eps);
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
정수 반전Udemy 에서 공부 한 것을 중얼거린다 Chapter3【Integer Reversal】 (예) 문자열로 숫자를 반전 (toString, split, reverse, join) 인수의 수치 (n)가 0보다 위 또는 ...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.