QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#638950 | #7753. Energy Distribution | Yeyin_0 | WA | 28ms | 4000kb | C++23 | 2.2kb | 2024-10-13 17:24:05 | 2024-10-13 17:24:05 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define OPFI(x) freopen(#x".in", "r", stdin);\
freopen(#x".out", "w", stdout)
#define REP(i, a, b) for(int i=(a); i<=(b); ++i)
#define REPd(i, a, b) for(int i=(a); i>=(b); --i)
inline ll rd(){
ll r=0, k=1; char c=0; while(!isdigit(c=getchar())) if(c=='-') k=-k;
while(isdigit(c)) r=r*10+c-'0', c=getchar(); return r*k;
}
const int N=110;
ll n, w[N][N];
double a[N][N], b[N];
bool check(double lmd, int state){
REP(i, 1, n){
if((state>>(i-1))&1)
{
REP(j, 1, n) a[i][j]=w[i][j];
b[i]=lmd;
}
else
{
REP(j, 1, n)
if(i==j) a[i][j]=1;
else a[i][j]=0;
b[i]=0;
}
}
REP(i, 1, n){
int t=i;
REP(j, i+1, n) if(abs(a[j][i])>1e-7&&(abs(a[t][i])>abs(a[j][i])||abs(a[t][i])<1e-7)) t=j;
REP(j, i, n) swap(a[t][j], a[i][j]);
if(abs(a[i][i])<1e-8){
return 0;
}
swap(b[t], b[i]);
double e=a[i][i];
REP(j, i, n) a[i][j]/=e;
b[i]/=e;
REP(j, i+1, n){
double d=a[j][i];
REP(k, i, n) a[j][k]-=d*a[i][k];
b[j]-=d*b[i];
}
}
REPd(i, n, 1) REP(j, 1, i-1) b[j]-=a[j][i]*b[i], a[j][i]=0;
double sum=0;
REP(i, 1, n) sum+=b[i];
return sum<1;
}
int main(){
//OPFI(test);
n=rd();
REP(i, 1, n)
REP(j, 1, n)
w[i][j]=rd();
double Ans=0;
REP(i,1,(1<<n)-1)
{
double l=0, r=1e6;
while(r-l>1e-10){
double mid=(l+r)/2;
if(check(mid,i)){
l=mid;
}else{
r=mid;
}
}
double ans=0;
REP(i, 1, n)
{
if(b[i]<0||b[i]>1) goto out;
}
REP(i, 1, n) REP(j, i+1, n) ans+=b[i]*b[j]*w[i][j];
//REP(i, 1, n) cerr<<b[i]<<endl;
Ans=max(Ans,ans);
/*if(ans==Ans)
{
REP(i,1,n) cout<<b[i]<<" ";
cout<<endl;
}*/
out:;
}
printf("%.10f\n", Ans);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3868kb
input:
2 0 1 1 0
output:
0.2500000000
result:
ok found '0.2500000', expected '0.2500000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
3 0 2 1 2 0 2 1 2 0
output:
0.5714285714
result:
ok found '0.5714286', expected '0.5714290', error '0.0000004'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
3 0 1 2 1 0 1 2 1 0
output:
0.5000000000
result:
ok found '0.5000000', expected '0.5000000', error '0.0000000'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3816kb
input:
4 0 3 1 0 3 0 1 0 1 1 0 2 0 0 2 0
output:
0.7500000000
result:
ok found '0.7500000', expected '0.7500000', error '0.0000000'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3904kb
input:
5 0 0 0 4 4 0 0 2 0 4 0 2 0 2 0 4 0 2 0 0 4 4 0 0 0
output:
1.0000000000
result:
ok found '1.0000000', expected '1.0000000', error '0.0000000'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3876kb
input:
6 0 9 5 5 10 6 9 0 0 0 0 1 5 0 0 0 3 0 5 0 0 0 10 5 10 0 3 10 0 0 6 1 0 5 0 0
output:
2.8571428572
result:
ok found '2.8571429', expected '2.8571430', error '0.0000000'
Test #7:
score: 0
Accepted
time: 1ms
memory: 3996kb
input:
7 0 0 0 0 50 10 45 0 0 0 0 0 3 1 0 0 0 0 0 4 16 0 0 0 0 44 0 0 50 0 0 44 0 37 6 10 3 4 0 37 0 2 45 1 16 0 6 2 0
output:
12.5115848007
result:
ok found '12.5115848', expected '12.5115850', error '0.0000000'
Test #8:
score: 0
Accepted
time: 3ms
memory: 3880kb
input:
8 0 0 56 0 0 58 16 0 0 0 37 20 0 82 0 0 56 37 0 0 98 0 83 0 0 20 0 0 0 0 100 0 0 0 98 0 0 62 29 0 58 82 0 0 62 0 43 0 16 0 83 100 29 43 0 4 0 0 0 0 0 0 4 0
output:
25.0091178965
result:
ok found '25.0091179', expected '25.0091180', error '0.0000000'
Test #9:
score: 0
Accepted
time: 8ms
memory: 3992kb
input:
9 0 0 0 135 0 0 0 448 476 0 0 0 0 0 0 208 17 0 0 0 0 467 1 0 0 0 134 135 0 467 0 0 0 92 369 207 0 0 1 0 0 176 0 235 0 0 0 0 0 176 0 65 363 413 0 208 0 92 0 65 0 0 0 448 17 0 369 235 363 0 0 0 476 0 134 207 0 413 0 0 0
output:
119.0000000000
result:
ok found '119.0000000', expected '119.0000000', error '0.0000000'
Test #10:
score: 0
Accepted
time: 23ms
memory: 4000kb
input:
10 0 0 0 289 0 397 0 0 140 155 0 0 28 101 35 614 0 0 545 300 0 28 0 0 329 702 0 242 0 298 289 101 0 0 0 0 0 0 720 0 0 35 329 0 0 0 0 38 0 0 397 614 702 0 0 0 229 0 0 0 0 0 0 0 0 229 0 317 0 0 0 0 242 0 38 0 317 0 961 309 140 545 0 720 0 0 0 961 0 92 155 300 298 0 0 0 0 309 92 0
output:
240.2500000001
result:
ok found '240.2500000', expected '240.2500000', error '0.0000000'
Test #11:
score: 0
Accepted
time: 28ms
memory: 3940kb
input:
10 0 295 2 809 333 880 284 305 41 295 295 0 512 1000 281 153 42 550 962 930 2 512 0 727 709 969 665 973 301 410 809 1000 727 0 282 551 960 804 274 956 333 281 709 282 0 613 505 406 896 441 880 153 969 551 613 0 769 770 40 288 284 42 665 960 505 769 0 919 989 490 305 550 973 804 406 770 919 0 400 209...
output:
327.3736589667
result:
ok found '327.3736590', expected '327.3736590', error '0.0000000'
Test #12:
score: 0
Accepted
time: 27ms
memory: 3928kb
input:
10 0 403 2 164 0 399 279 156 109 472 403 0 292 279 100 326 153 124 103 426 2 292 0 0 58 87 0 177 324 334 164 279 0 0 256 188 0 257 467 23 0 100 58 256 0 453 75 21 0 309 399 326 87 188 453 0 0 319 395 434 279 153 0 0 75 0 0 342 431 72 156 124 177 257 21 319 342 0 265 0 109 103 324 467 0 395 431 265 0...
output:
155.3703581450
result:
ok found '155.3703581', expected '155.3703580', error '0.0000000'
Test #13:
score: -100
Wrong Answer
time: 27ms
memory: 3940kb
input:
10 0 3 10 8 0 3 3 8 9 6 3 0 6 10 0 10 9 9 4 9 10 6 0 7 1 5 6 8 0 0 8 10 7 0 10 6 0 6 9 4 0 0 1 10 0 1 0 2 0 1 3 10 5 6 1 0 6 4 0 4 3 9 6 0 0 6 0 10 0 8 8 9 8 6 2 4 10 0 0 2 9 4 0 9 0 0 0 0 0 10 6 9 0 4 1 4 8 2 10 0
output:
3.1308724833
result:
wrong answer 1st numbers differ - expected: '3.1332740', found: '3.1308725', error = '0.0007665'