QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#265655 | #7753. Energy Distribution | ucup-team022# | TL | 347ms | 3988kb | C++17 | 1.7kb | 2023-11-25 20:07:55 | 2023-11-25 20:07:55 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef pair<int, int> pr;
int n, pl[12];
db a[12][12], mxans = 0, b[12];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
pl[i] = i;
for (int j = 1; j <= n; j++) cin >> a[i][j];
}
do {
memset(b, 0, sizeof(b));
b[pl[1]] = 1;
db W = 0;
for (int i = 2; i <= n; i++) {
db A = W, B = 0;
for (int k = 1; k <= n; k++) {
A -= a[pl[i]][k] * b[k];
B += a[pl[i]][k] * b[k];
}
if (fabs(A) < 1e-10) {
b[pl[i]] = 0;
continue;
}
db best = -B / A / 2;
best = min((db)1, max(best, (db)0));
for (int k = 1; k <= n; k++) b[k] *= best;
b[pl[i]] = 1 - best;
W = A * best * best + B * best;
}
for (int kk = 1; kk <= 1; kk++) {
for (int i = 1; i <= n; i++) {
db Uu = 0;
for (int k = 1; k <= n; k++) {
Uu += b[k] * a[i][k];
}
for (int j = i + 1; j <= n; j++) {
db sum = b[i] + b[j];
db U = Uu - b[j] * a[i][j];
db V = 0;
for (int k = 1; k <= n; k++) {
if (k != i) V += b[k] * a[j][k];
}
db A = -a[i][j];
db B = a[i][j] * sum + U - V;
if (!a[i][j]) {
if (B > 0) b[i] = sum, b[j] = 0;
else b[j] = sum, b[i] = 0;
continue;
}
db best = -B / A / 2;
best = min(sum, max(best, (db)0));
b[i] = best, b[j] = sum - best;
Uu = U + b[j] * a[i][j];
}
}
}
// cout << W << '\n';
W = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
W += b[i] * b[j] * a[i][j];
}
}
// cout << W << '\n';
// cout << '\n';
mxans = max(mxans, W);
} while (next_permutation(pl + 1, pl + n + 1));
printf("%.10lf\n", mxans);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3912kb
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: 3796kb
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: 3984kb
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: 3988kb
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: 0ms
memory: 3852kb
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: 3964kb
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.8571428571
result:
ok found '2.8571429', expected '2.8571430', error '0.0000001'
Test #7:
score: 0
Accepted
time: 3ms
memory: 3912kb
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.5115847887
result:
ok found '12.5115848', expected '12.5115850', error '0.0000000'
Test #8:
score: 0
Accepted
time: 30ms
memory: 3796kb
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.0091178447
result:
ok found '25.0091178', expected '25.0091180', error '0.0000000'
Test #9:
score: 0
Accepted
time: 347ms
memory: 3724kb
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: -100
Time Limit Exceeded
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