QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#102507 | #5433. Absolute Difference | lgvc# | WA | 3ms | 9884kb | C++23 | 3.7kb | 2023-05-03 14:06:59 | 2023-05-03 14:07:03 |
Judging History
answer
//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
//#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 1000000007
#define eps 0.0000000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
*pp++=ch;
}
inline void pcc(){
fwrite(buf2,1,pp-buf2,stdout);
pp=buf2;
}
inline int read(void) {
int w=1;
register int x(0);register char c(getchar());
while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
return w*x;
}
void write(int x) {
if(x<0) pc('-'),x=-x;
static int sta[20];
int top=0;
do {
sta[top++]=x%10,x/=10;
} while(x);
while(top) pc(sta[--top]+48);
}
void we(int x) {
write(x);
pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
int N,M,k;
long double l1[100009],l2[100009],r1[100009],r2[100009],a[400009],su,su2[400009],qw2[400009],qw1[400009],ans;
bool v1[400009],v2[400009];
signed main(void) {
//freopen("m.in","r",stdin);
//freopen("m.out","w",stdout);
N=read();M=read();
a[++k]=-INF;
a[++k]=INF;
for(int i=1;i<=N;i++) {
l1[i]=read();
r1[i]=read();
a[++k]=l1[i];
a[++k]=r1[i]+eps;
}
for(int i=1;i<=M;i++) {
l2[i]=read();
r2[i]=read();
a[++k]=l2[i];
a[++k]=r2[i]+eps;
}
std::sort(a+1,a+k+1);
k=std::unique(a+1,a+k+1)-a-1;
for(int i=1;i<=N;i++) {
int l=1,r=k,md;
while(l<r) {
md=(l+r)>>1;
if(a[md]>=l1[i]) {
r=md;
} else {
l=md+1;
}
}
while(r1[i]>=a[l]) {
v1[l]=1;
l++;
}
}
for(int i=1;i<=M;i++) {
int l=1,r=k,md;
while(l<r) {
md=(l+r)>>1;
if(a[md]>=l2[i]) {
r=md;
} else {
l=md+1;
}
}
while(r2[i]>=a[l]) {
v2[l]=1;
l++;
}
}
for(int i=1;i<k;i++) {
if(v1[i]) su+=a[i+1]-a[i];
}
if(su<1) {
su=0;
for(int i=1;i<k;i++) {
su2[i]=su2[i-1];
qw2[i]=qw2[i-1];
if(v2[i]) su2[i]+=a[i+1]-a[i],qw2[i]+=(a[i+1]-a[i])*(a[i+1]+a[i]-eps)/2;
if(v1[i]) su+=a[i+1]-a[i];
}
for(int i=k-1;i>=1;i--) {
qw1[i]=qw1[i+1];
if(v2[i]) qw1[i]+=(a[i+1]-a[i])*(a[i+1]+a[i]-eps)/2;
}
for(int i=1;i<k;i++) {
if(v1[i]) {
if(v2[i]) ans+=(a[i+1]-a[i])/3*(a[i+1]-a[i])/su*(a[i+1]-a[i])/su2[k-1];
if(su2[i-1]) ans+=((a[i]+a[i+1]-eps)/2-qw2[i-1]/su2[i-1])*(a[i+1]-a[i])/su*su2[i-1]/su2[k-1];
if(su2[k-1]!=su2[i]) ans+=(qw1[i+1]/(su2[k-1]-su2[i])-(a[i]+a[i+1]-eps)/2)*(a[i+1]-a[i])/su*(su2[k-1]-su2[i])/su2[k-1];
}
}
} else {
su=0;
for(int i=1;i<k;i++) {
su2[i]=su2[i-1];
qw2[i]=qw2[i-1];
if(v2[i]) su2[i]+=a[i+1]-a[i]-eps,qw2[i]+=(a[i+1]-a[i]-eps)*(a[i+1]+a[i]-eps)/2;
if(v1[i]) su+=a[i+1]-a[i]-eps;
}
for(int i=k-1;i>=1;i--) {
qw1[i]=qw1[i+1];
if(v2[i]) qw1[i]+=(a[i+1]-a[i]-eps)*(a[i+1]+a[i]-eps)/2;
}
for(int i=1;i<k;i++) {
if(v1[i]) {
if(v2[i]) ans+=(a[i+1]-a[i]-eps)/3*(a[i+1]-a[i]-eps)/su*(a[i+1]-a[i]-eps)/su2[k-1];
if(su2[i-1]) ans+=((a[i]+a[i+1]-eps)/2-qw2[i-1]/su2[i-1])*(a[i+1]-a[i]-eps)/su*su2[i-1]/su2[k-1];
if(su2[k-1]!=su2[i]) ans+=(qw1[i+1]/(su2[k-1]-su2[i])-(a[i]+a[i+1]-eps)/2)*(a[i+1]-a[i]-eps)/su*(su2[k-1]-su2[i])/su2[k-1];
}
}
}
printf("%.12Lf",ans);
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 3ms
memory: 9884kb
input:
1 1 0 1 0 1
output:
0.333333333333
result:
ok found '0.333333333', expected '0.333333333', error '0.000000000'
Test #2:
score: 0
Accepted
time: 2ms
memory: 7952kb
input:
1 1 0 1 1 1
output:
0.500000000050
result:
ok found '0.500000000', expected '0.500000000', error '0.000000000'
Test #3:
score: 0
Accepted
time: 2ms
memory: 7700kb
input:
1 1 -1000000000 1000000000 -1000000000 1000000000
output:
666666666.666666666686
result:
ok found '666666666.666666627', expected '666666666.666666627', error '0.000000000'
Test #4:
score: 0
Accepted
time: 2ms
memory: 7848kb
input:
1 1 -1000000000 0 0 1000000000
output:
1000000000.000000000058
result:
ok found '1000000000.000000000', expected '1000000000.000000000', error '0.000000000'
Test #5:
score: 0
Accepted
time: 3ms
memory: 7880kb
input:
1 1 -1000000000 -1000000000 -1000000000 1000000000
output:
1000000000.000000000000
result:
ok found '1000000000.000000000', expected '1000000000.000000000', error '0.000000000'
Test #6:
score: 0
Accepted
time: 0ms
memory: 7712kb
input:
1 1 -999999999 1000000000 -1000000000 -1000000000
output:
1000000000.499999999942
result:
ok found '1000000000.500000000', expected '1000000000.500000000', error '0.000000000'
Test #7:
score: 0
Accepted
time: 1ms
memory: 7696kb
input:
1 1 -1000000000 1000000000 -999999999 -999999999
output:
999999999.000000000524
result:
ok found '999999999.000000000', expected '999999999.000000000', error '0.000000000'
Test #8:
score: 0
Accepted
time: 0ms
memory: 7960kb
input:
1 1 1000000000 1000000000 -1000000000 -1000000000
output:
2000000000.000000000000
result:
ok found '2000000000.000000000', expected '2000000000.000000000', error '0.000000000'
Test #9:
score: 0
Accepted
time: 3ms
memory: 8092kb
input:
1000 1000 -2175 -2174 -1068 -1065 -1721 -1718 777 834 1162 1169 -3529 -3524 3966 3993 1934 1952 -234 -223 -4967 -4947 8500 8510 5272 5276 -6048 -6033 -34 -22 700 705 -7890 -7886 5538 5543 4114 4126 -9201 -9162 -1521 -1519 -5103 -5100 439 441 993 997 -1684 -1680 -8413 -8404 6724 6728 -3242 -3239 2616...
output:
6717.117145739308
result:
ok found '6717.117145739', expected '6717.117145739', error '0.000000000'
Test #10:
score: -100
Wrong Answer
time: 1ms
memory: 7980kb
input:
1000 1000 -5010 -4999 -2128 -2113 -5798 -5765 705 713 -3956 -3938 -5308 -5307 6759 6772 -772 -770 -860 -859 2308 2323 -5500 -5500 5140 5177 -6747 -6733 7509 7511 8864 8870 -6382 -6374 1901 1904 -5763 -5760 3019 3027 2962 2963 -314 -301 -222 -203 -726 -724 -62 -58 -1203 -1195 -5216 -5215 -4298 -4292 ...
output:
6747.159784086021
result:
wrong answer 1st numbers differ - expected: '6682.5811275', found: '6747.1597841', error = '0.0096637'