QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#383151#7753. Energy DistributionhelcsnewsxdWA 912ms4028kbC++201.6kb2024-04-09 00:10:132024-04-09 00:10:15

Judging History

你现在查看的是最新测评结果

  • [2024-10-31 10:22:30]
  • hack成功,自动添加数据
  • (/hack/1089)
  • [2024-04-09 00:10:15]
  • 评测
  • 测评结果:WA
  • 用时:912ms
  • 内存:4028kb
  • [2024-04-09 00:10:13]
  • 提交

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 = 100;
    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];

    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    auto rnd=bind(uniform_int_distribution<int>(0,n-1), rng);
    auto cl=clock();
    while(ld(clock() - cl)/CLOCKS_PER_SEC < 0.9) {
        fore(i, 0, n) v[i] = 1.0/ld(n);

        ll it = 1000;
        while(it--) {
            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: 903ms
memory: 3980kb

input:

2
0 1
1 0

output:

0.250000000000

result:

ok found '0.2500000', expected '0.2500000', error '0.0000000'

Test #2:

score: 0
Accepted
time: 903ms
memory: 3988kb

input:

3
0 2 1
2 0 2
1 2 0

output:

0.571428571429

result:

ok found '0.5714286', expected '0.5714290', error '0.0000004'

Test #3:

score: 0
Accepted
time: 906ms
memory: 3988kb

input:

3
0 1 2
1 0 1
2 1 0

output:

0.500000000000

result:

ok found '0.5000000', expected '0.5000000', error '0.0000000'

Test #4:

score: 0
Accepted
time: 906ms
memory: 3968kb

input:

4
0 3 1 0
3 0 1 0
1 1 0 2
0 0 2 0

output:

0.750000000000

result:

ok found '0.7500000', expected '0.7500000', error '0.0000000'

Test #5:

score: 0
Accepted
time: 905ms
memory: 4028kb

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.000000000000

result:

ok found '1.0000000', expected '1.0000000', error '0.0000000'

Test #6:

score: 0
Accepted
time: 907ms
memory: 3988kb

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.857142857143

result:

ok found '2.8571429', expected '2.8571430', error '0.0000000'

Test #7:

score: 0
Accepted
time: 906ms
memory: 4028kb

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.511584800741

result:

ok found '12.5115848', expected '12.5115850', error '0.0000000'

Test #8:

score: 0
Accepted
time: 908ms
memory: 3992kb

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.009117896522

result:

ok found '25.0091179', expected '25.0091180', error '0.0000000'

Test #9:

score: 0
Accepted
time: 906ms
memory: 3988kb

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.000000000000

result:

ok found '119.0000000', expected '119.0000000', error '0.0000000'

Test #10:

score: 0
Accepted
time: 909ms
memory: 3908kb

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.250000000000

result:

ok found '240.2500000', expected '240.2500000', error '0.0000000'

Test #11:

score: 0
Accepted
time: 912ms
memory: 3980kb

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.373658966686

result:

ok found '327.3736590', expected '327.3736590', error '0.0000000'

Test #12:

score: 0
Accepted
time: 906ms
memory: 3992kb

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.370358145035

result:

ok found '155.3703581', expected '155.3703580', error '0.0000000'

Test #13:

score: -100
Wrong Answer
time: 910ms
memory: 3988kb

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:

2.979813664596

result:

wrong answer 1st numbers differ - expected: '3.1332740', found: '2.9798137', error = '0.0489776'