QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#383147 | #7753. Energy Distribution | helcsnewsxd | WA | 927ms | 3984kb | C++20 | 1.5kb | 2024-04-09 00:03:59 | 2024-04-09 00:03:59 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define fore(i, a, b) for(ll i = a, bella = b; i < bella; i++)
#define mset(a, b) memset(a, b, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define SZ(a) ll(a.size())
#define fst first
#define snd second
#define pb push_back
#define FIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
const ll MAXN = 15;
ll w[MAXN][MAXN], n;
ld v[MAXN];
ld calc() {
ld ret = 0;
fore(i, 0, n) fore(j, i + 1, n) ret += v[i] * v[j] * ld(w[i][j]);
return ret;
}
void upd(ll a, ll b) {
ld s = 0, e = v[a] + v[b];
ll it = 30;
while(it--) {
ld m0 = (s * 2.0 + e) / 3.0, m1 = (s + e * 2.0) / 3.0;
ld a0 = m0, b0 = v[a] + v[b] - a0;
ld a1 = m1, b1 = v[a] + v[b] - a1;
v[a] = a0, v[b] = b0;
ld c0 = calc();
v[a] = a1, v[b] = b1;
ld c1 = calc();
if(c0 < c1) s = m0;
else e = m1;
}
}
int main() { FIO;
cin >> n;
fore(i, 0, n) fore(j, 0, n) cin >> w[i][j];
fore(i, 0, n) v[i] = 1.0/ld(n);
auto rnd=bind(uniform_int_distribution<int>(0,n-1), mt19937(time(0)));
auto cl=clock();
while(ld(clock() - cl)/CLOCKS_PER_SEC < 0.99) {
ll a = rnd(), b;
while(a == b) b = rnd();
upd(a, b);
}
cout << fixed << setprecision(12) << calc() << '\n';
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 925ms
memory: 3984kb
input:
2 0 1 1 0
output:
0.249999999997
result:
ok found '0.2500000', expected '0.2500000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 927ms
memory: 3792kb
input:
3 0 2 1 2 0 2 1 2 0
output:
0.571428571428
result:
ok found '0.5714286', expected '0.5714290', error '0.0000004'
Test #3:
score: 0
Accepted
time: 883ms
memory: 3980kb
input:
3 0 1 2 1 0 1 2 1 0
output:
0.499999999990
result:
ok found '0.5000000', expected '0.5000000', error '0.0000000'
Test #4:
score: -100
Wrong Answer
time: 898ms
memory: 3856kb
input:
4 0 3 1 0 3 0 1 0 1 1 0 2 0 0 2 0
output:
0.749995436804
result:
wrong answer 1st numbers differ - expected: '0.7500000', found: '0.7499954', error = '0.0000046'