QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #301114 | #5054. City Brain | zzuqy# | WA | 10ms | 102124kb | C++14 | 2.0kb | 2024-01-09 14:41:24 | 2024-01-09 14:41:25 |
Judging History
answer
#include <bits/stdc++.h>
#define N 5009
using namespace std;
vector<int>to[N];
int n, m, k;
int d[N][N];
void bfs(int st) {
queue<int>q;
q.push(st);
d[st][st] = 0;
while (!q.empty()) {
int x = q.front();
q.pop();
for (auto y : to[x]) {
if (d[st][y] != 1000000000)
continue;
d[st][y] = d[st][x] + 1;
q.push(y);
}
}
}
double calc(int a, int b, int kt) {
if (a == 0 && b == 0)
return 0;
kt += a + b;
int ta = max((int)(kt / (a + sqrt(2) * b)) - 2, 1);
int tb = max((int)(sqrt(2) * ta) - 2, 1);
//cout << ta << " " << tb << endl;
double ans = 1.0 * a / ta + 2.0 * b / tb;
kt -= ta * a + tb * b;
// int flag = 0;
while (kt) {
//cout << kt << " " << ta << " " << tb << endl;
if (1ll * tb * (tb + 1) > 2ll * ta * (ta + 1)) {
ans -= min(kt, a) * 1.0 / ta / (ta + 1);
kt -= min(kt, a);
ta++;
//flag |= 1;
} else {
ans -= min(kt, b) * 2.0 / tb / (tb + 1);
kt -= min(kt, b);
tb++;
//flag |= 2;
}
}
// if (flag != 3)cerr << "BAD";
//cout << a << " " << b << " " << k << " " << ans << endl;
return ans;
}
int main() {
cin >> n >> m >> k;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
to[a].push_back(b);
to[b].push_back(a);
}
fill(d[0], d[0] + N * N, 1000000000);
for (int i = 1; i <= n; i++)
bfs(i);
/*
for (int i = 1; i <= n; i++, cout << endl)
for (int j = 1; j <= n; j++)
cout << d[i][j] << " ";
*/
int s1, t1, s2, t2;
cin >> s1 >> t1 >> s2 >> t2;
double ans = calc(d[s1][t1] + d[s2][t2], 0, k);
for (int a = 1; a <= n; a++) {
for (int b = 1; b <= n; b++) {
if (d[s1][a] == 1000000000 || d[b][t1] == 1000000000 || d[a][b] == 1000000000)
continue;
if (d[s2][a] == 1000000000 || d[b][t2] == 1000000000)
continue;
ans = min(ans, calc(d[s1][a] + d[b][t1] + d[s2][a] + d[b][t2], d[a][b], k));
}
}
cout << fixed << setprecision(15) << ans;
}
/*
6 5 1000000000
1 2
3 2
2 4
4 5
4 6
1 5 3 6
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 10ms
memory: 102016kb
input:
6 5 1 1 2 3 2 2 4 4 5 4 6 1 5 3 6
output:
5.000000000000000
result:
ok found '5.000000000', expected '5.000000000', error '0.000000000'
Test #2:
score: 0
Accepted
time: 4ms
memory: 101856kb
input:
1 0 100 1 1 1 1
output:
0.000000000000000
result:
ok found '0.000000000', expected '0.000000000', error '-0.000000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 101924kb
input:
4 2 3 1 2 3 4 1 2 3 4
output:
0.833333333333333
result:
ok found '0.833333333', expected '0.833333333', error '0.000000000'
Test #4:
score: -100
Wrong Answer
time: 4ms
memory: 102124kb
input:
6 5 1 1 2 3 2 2 4 4 5 4 6 1 5 6 3
output:
5.500000000000000
result:
wrong answer 1st numbers differ - expected: '5.0000000', found: '5.5000000', error = '0.1000000'