#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define vvi vector<vi>
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
namespace {
const int maxn = 2005;
const int LENV = 11;
const int LEND = 9;
int n, maxD = 0;
vi dist(maxn, INT_MAX);
vpii adj[maxn];
int phase;
priority_queue<pii, vpii, greater<pii>> q;
int getMinD() {
while (!q.empty() && q.top().first >= dist[q.top().second]) q.pop();
if (q.empty()) return ((1 << LEND) - 1);
return q.top().first - maxD;
}
int getMinV() { return (!q.empty()) ? q.top().second : -1; }
// may call SendA()
void send(int m, int len) {
// cout << "A Send: " << m << endl;
for (int i = len-1; i >= 0; --i) SendA((m>>i)&1);
}
// Variables for ...
int d,cntD=0; // receiving distances
int v,cntV=0; // receiving points
int cntN=0; // counting the
void addVertexWithDist(int vv, int dd) {
// cout << "A add V " << vv << " mit Dist " << dd << endl;
dist[vv] = dd;
maxD = dd;
++cntN;
if (cntN == n) return;
int u,c;
for (pii e : adj[vv]) {
tie(u,c) = e;
q.push({ dist[vv] + c, u });
}
// cout << "A dists: "; for (int i=0;i<n;++i) cout << dist[i] << " "; cout << endl;
send(getMinD(), LEND);
phase = LEND;
d = 0;
}
void receiveD(bool x) {
d = (d << 1) + x;
++cntD;
if (cntD == LEND) {
// cout << "A Receive (d: " << d << ")" << endl;
cntD = 0;
if (d < getMinD()) { // Aufpassen mit < und <= in der anderen Datei.
// cout << "A receive: Erhalten kleiner als jetzt" << endl;
phase = LENV;
v = 0;
// rest folgt in receive V
} else {
// cout << "A receive: Erhalten größer gleich jetzt" << endl;
int vv = getMinV();
int dd = maxD + getMinD();
q.pop();
send(vv, LENV);
addVertexWithDist(vv, dd); // starts new iteration
}
}
}
void receiveV(bool x) {
v = (v << 1) + x;
++cntV;
if (cntV == LENV) {
// cout << "A Receive (v: " << v << endl;
cntV = 0;
addVertexWithDist(v, maxD + d);
}
}
} // namespace
void ReceiveA(bool x) {
if (phase == LEND) { // Distance
receiveD(x);
} else { // Knoten
receiveV(x);
}
}
void InitA(int N, int A, vi U, vi V, vi C) {
n = N;
dist.resize(n);
for (int i = 0; i < A; ++i) {
adj[U[i]].push_back({ V[i], C[i] });
adj[V[i]].push_back({ U[i], C[i] });
}
addVertexWithDist(0, 0);
}
vi Answer() {
return dist;
}
#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define vvi vector<vi>
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
namespace {
const int maxn = 2005;
const int LENV = 11;
const int LEND = 9;
int n, maxD = 0;
vi dist(maxn, INT_MAX);
vpii adj[maxn];
int phase;
priority_queue<pii, vpii, greater<pii>> q;
int getMinD() {
while (!q.empty() && q.top().first >= dist[q.top().second]) q.pop();
if (q.empty()) return ((1 << LEND) - 1);
return q.top().first - maxD;
}
int getMinV() { return (!q.empty()) ? q.top().second : -1; }
// may call SendB()
void send(int m, int len) {
// cout << "B Send: " << m << endl;
for (int i = len-1; i >= 0; --i) {
SendB((m>>i)&1);
}
}
// Variables for ...
int d,cntD=0; // receiving distances
int v,cntV=0; // receiving points
int cntN=0; // counting the
void addVertexWithDist(int vv, int dd) {
// cout << "B bet V " << vv << " mit Dist " << dd << endl;
dist[vv] = dd;
maxD = dd;
++cntN;
if (cntN == n) return;
int u,c;
for (pii e : adj[vv]) {
tie(u,c) = e;
q.push({ dist[vv] + c, u });
}
// cout << "B dists: "; for (int i=0;i<n;++i) cout << dist[i] << " "; cout << endl;
send(getMinD(), LEND);
phase = LEND;
d = 0;
}
void receiveD(bool x) {
d = (d << 1) + x;
++cntD;
if (cntD == LEND) {
// cout << "B Receive (d: " << d << ")" << endl;
cntD = 0;
if (getMinD() < d) { // Aufpassen mit < und <= in der anderen Datei.
// cout << "B receive: Erhalten größer gleich jetzt" << endl;
int vv = getMinV();
int dd = maxD + getMinD();
q.pop();
send(vv, LENV);
addVertexWithDist(vv, dd); // starts new iteration
} else {
// cout << "B receive: Erhalten kleiner als jetzt" << endl;
phase = LENV;
v = 0;
// rest folgt in receive V
}
}
}
void receiveV(bool x) {
v = (v << 1) + x;
++cntV;
if (cntV == LENV) {
// cout << "B Receive (v: " << v << endl;
cntV = 0;
addVertexWithDist(v, maxD + d);
}
}
} // namespace
void ReceiveB(bool x) {
if (phase == LEND) { // Distance
receiveD(x);
} else { // Knoten
receiveV(x);
}
}
void InitB(int N, int A, vi U, vi V, vi C) {
n = N;
dist.resize(n);
for (int i = 0; i < A; ++i) {
adj[U[i]].push_back({ V[i], C[i] });
adj[V[i]].push_back({ U[i], C[i] });
}
addVertexWithDist(0, 0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
595 ms |
788 KB |
Output is correct |
2 |
Correct |
2 ms |
656 KB |
Output is correct |
3 |
Correct |
589 ms |
788 KB |
Output is correct |
4 |
Correct |
699 ms |
10124 KB |
Output is correct |
5 |
Correct |
26 ms |
1004 KB |
Output is correct |
6 |
Correct |
442 ms |
2692 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
656 KB |
Output is correct |
2 |
Correct |
541 ms |
740 KB |
Output is correct |
3 |
Correct |
473 ms |
800 KB |
Output is correct |
4 |
Correct |
695 ms |
27536 KB |
Output is correct |
5 |
Correct |
712 ms |
28492 KB |
Output is correct |
6 |
Correct |
118 ms |
656 KB |
Output is correct |
7 |
Correct |
707 ms |
28832 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
427 ms |
728 KB |
Output is correct |
2 |
Correct |
1 ms |
656 KB |
Output is correct |
3 |
Correct |
549 ms |
676 KB |
Output is correct |
4 |
Correct |
531 ms |
744 KB |
Output is correct |
5 |
Correct |
493 ms |
756 KB |
Output is correct |
6 |
Correct |
514 ms |
732 KB |
Output is correct |
7 |
Correct |
469 ms |
740 KB |
Output is correct |
8 |
Correct |
494 ms |
840 KB |
Output is correct |
9 |
Correct |
544 ms |
660 KB |
Output is correct |
10 |
Correct |
463 ms |
788 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
180 ms |
688 KB |
Output is correct |
2 |
Correct |
231 ms |
660 KB |
Output is correct |
3 |
Correct |
393 ms |
13440 KB |
Output is correct |
4 |
Correct |
237 ms |
656 KB |
Output is correct |
5 |
Correct |
309 ms |
9964 KB |
Output is correct |
6 |
Correct |
215 ms |
656 KB |
Output is correct |
7 |
Correct |
203 ms |
656 KB |
Output is correct |
8 |
Correct |
185 ms |
732 KB |
Output is correct |
9 |
Correct |
344 ms |
23656 KB |
Output is correct |
10 |
Correct |
330 ms |
23544 KB |
Output is correct |
11 |
Correct |
471 ms |
46916 KB |
Output is correct |
12 |
Correct |
384 ms |
44112 KB |
Output is correct |
13 |
Correct |
238 ms |
852 KB |
Output is correct |
14 |
Correct |
1 ms |
656 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
180 ms |
688 KB |
Output is correct |
2 |
Correct |
231 ms |
660 KB |
Output is correct |
3 |
Correct |
393 ms |
13440 KB |
Output is correct |
4 |
Correct |
237 ms |
656 KB |
Output is correct |
5 |
Correct |
309 ms |
9964 KB |
Output is correct |
6 |
Correct |
215 ms |
656 KB |
Output is correct |
7 |
Correct |
203 ms |
656 KB |
Output is correct |
8 |
Correct |
185 ms |
732 KB |
Output is correct |
9 |
Correct |
344 ms |
23656 KB |
Output is correct |
10 |
Correct |
330 ms |
23544 KB |
Output is correct |
11 |
Correct |
471 ms |
46916 KB |
Output is correct |
12 |
Correct |
384 ms |
44112 KB |
Output is correct |
13 |
Correct |
238 ms |
852 KB |
Output is correct |
14 |
Correct |
1 ms |
656 KB |
Output is correct |
15 |
Correct |
234 ms |
688 KB |
Output is correct |
16 |
Correct |
223 ms |
776 KB |
Output is correct |
17 |
Correct |
298 ms |
656 KB |
Output is correct |
18 |
Correct |
403 ms |
10096 KB |
Output is correct |
19 |
Correct |
247 ms |
720 KB |
Output is correct |
20 |
Correct |
431 ms |
10340 KB |
Output is correct |
21 |
Correct |
287 ms |
656 KB |
Output is correct |
22 |
Correct |
304 ms |
680 KB |
Output is correct |
23 |
Correct |
352 ms |
26640 KB |
Output is correct |
24 |
Correct |
465 ms |
26520 KB |
Output is correct |
25 |
Correct |
576 ms |
52476 KB |
Output is correct |
26 |
Correct |
522 ms |
48980 KB |
Output is correct |
27 |
Correct |
238 ms |
900 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
180 ms |
688 KB |
Output is correct |
2 |
Correct |
231 ms |
660 KB |
Output is correct |
3 |
Correct |
393 ms |
13440 KB |
Output is correct |
4 |
Correct |
237 ms |
656 KB |
Output is correct |
5 |
Correct |
309 ms |
9964 KB |
Output is correct |
6 |
Correct |
215 ms |
656 KB |
Output is correct |
7 |
Correct |
203 ms |
656 KB |
Output is correct |
8 |
Correct |
185 ms |
732 KB |
Output is correct |
9 |
Correct |
344 ms |
23656 KB |
Output is correct |
10 |
Correct |
330 ms |
23544 KB |
Output is correct |
11 |
Correct |
471 ms |
46916 KB |
Output is correct |
12 |
Correct |
384 ms |
44112 KB |
Output is correct |
13 |
Correct |
238 ms |
852 KB |
Output is correct |
14 |
Correct |
1 ms |
656 KB |
Output is correct |
15 |
Correct |
234 ms |
688 KB |
Output is correct |
16 |
Correct |
223 ms |
776 KB |
Output is correct |
17 |
Correct |
298 ms |
656 KB |
Output is correct |
18 |
Correct |
403 ms |
10096 KB |
Output is correct |
19 |
Correct |
247 ms |
720 KB |
Output is correct |
20 |
Correct |
431 ms |
10340 KB |
Output is correct |
21 |
Correct |
287 ms |
656 KB |
Output is correct |
22 |
Correct |
304 ms |
680 KB |
Output is correct |
23 |
Correct |
352 ms |
26640 KB |
Output is correct |
24 |
Correct |
465 ms |
26520 KB |
Output is correct |
25 |
Correct |
576 ms |
52476 KB |
Output is correct |
26 |
Correct |
522 ms |
48980 KB |
Output is correct |
27 |
Correct |
238 ms |
900 KB |
Output is correct |
28 |
Correct |
364 ms |
708 KB |
Output is correct |
29 |
Correct |
395 ms |
776 KB |
Output is correct |
30 |
Correct |
710 ms |
24328 KB |
Output is correct |
31 |
Correct |
398 ms |
664 KB |
Output is correct |
32 |
Correct |
570 ms |
21188 KB |
Output is correct |
33 |
Correct |
355 ms |
740 KB |
Output is correct |
34 |
Correct |
270 ms |
764 KB |
Output is correct |
35 |
Correct |
375 ms |
792 KB |
Output is correct |
36 |
Correct |
554 ms |
29200 KB |
Output is correct |
37 |
Correct |
383 ms |
29300 KB |
Output is correct |
38 |
Correct |
802 ms |
57720 KB |
Output is correct |
39 |
Correct |
764 ms |
55212 KB |
Output is correct |
40 |
Correct |
428 ms |
964 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
595 ms |
788 KB |
Output is correct |
2 |
Correct |
2 ms |
656 KB |
Output is correct |
3 |
Correct |
589 ms |
788 KB |
Output is correct |
4 |
Correct |
699 ms |
10124 KB |
Output is correct |
5 |
Correct |
26 ms |
1004 KB |
Output is correct |
6 |
Correct |
442 ms |
2692 KB |
Output is correct |
7 |
Correct |
2 ms |
656 KB |
Output is correct |
8 |
Correct |
541 ms |
740 KB |
Output is correct |
9 |
Correct |
473 ms |
800 KB |
Output is correct |
10 |
Correct |
695 ms |
27536 KB |
Output is correct |
11 |
Correct |
712 ms |
28492 KB |
Output is correct |
12 |
Correct |
118 ms |
656 KB |
Output is correct |
13 |
Correct |
707 ms |
28832 KB |
Output is correct |
14 |
Correct |
427 ms |
728 KB |
Output is correct |
15 |
Correct |
1 ms |
656 KB |
Output is correct |
16 |
Correct |
549 ms |
676 KB |
Output is correct |
17 |
Correct |
531 ms |
744 KB |
Output is correct |
18 |
Correct |
493 ms |
756 KB |
Output is correct |
19 |
Correct |
514 ms |
732 KB |
Output is correct |
20 |
Correct |
469 ms |
740 KB |
Output is correct |
21 |
Correct |
494 ms |
840 KB |
Output is correct |
22 |
Correct |
544 ms |
660 KB |
Output is correct |
23 |
Correct |
463 ms |
788 KB |
Output is correct |
24 |
Correct |
180 ms |
688 KB |
Output is correct |
25 |
Correct |
231 ms |
660 KB |
Output is correct |
26 |
Correct |
393 ms |
13440 KB |
Output is correct |
27 |
Correct |
237 ms |
656 KB |
Output is correct |
28 |
Correct |
309 ms |
9964 KB |
Output is correct |
29 |
Correct |
215 ms |
656 KB |
Output is correct |
30 |
Correct |
203 ms |
656 KB |
Output is correct |
31 |
Correct |
185 ms |
732 KB |
Output is correct |
32 |
Correct |
344 ms |
23656 KB |
Output is correct |
33 |
Correct |
330 ms |
23544 KB |
Output is correct |
34 |
Correct |
471 ms |
46916 KB |
Output is correct |
35 |
Correct |
384 ms |
44112 KB |
Output is correct |
36 |
Correct |
238 ms |
852 KB |
Output is correct |
37 |
Correct |
1 ms |
656 KB |
Output is correct |
38 |
Correct |
234 ms |
688 KB |
Output is correct |
39 |
Correct |
223 ms |
776 KB |
Output is correct |
40 |
Correct |
298 ms |
656 KB |
Output is correct |
41 |
Correct |
403 ms |
10096 KB |
Output is correct |
42 |
Correct |
247 ms |
720 KB |
Output is correct |
43 |
Correct |
431 ms |
10340 KB |
Output is correct |
44 |
Correct |
287 ms |
656 KB |
Output is correct |
45 |
Correct |
304 ms |
680 KB |
Output is correct |
46 |
Correct |
352 ms |
26640 KB |
Output is correct |
47 |
Correct |
465 ms |
26520 KB |
Output is correct |
48 |
Correct |
576 ms |
52476 KB |
Output is correct |
49 |
Correct |
522 ms |
48980 KB |
Output is correct |
50 |
Correct |
238 ms |
900 KB |
Output is correct |
51 |
Correct |
364 ms |
708 KB |
Output is correct |
52 |
Correct |
395 ms |
776 KB |
Output is correct |
53 |
Correct |
710 ms |
24328 KB |
Output is correct |
54 |
Correct |
398 ms |
664 KB |
Output is correct |
55 |
Correct |
570 ms |
21188 KB |
Output is correct |
56 |
Correct |
355 ms |
740 KB |
Output is correct |
57 |
Correct |
270 ms |
764 KB |
Output is correct |
58 |
Correct |
375 ms |
792 KB |
Output is correct |
59 |
Correct |
554 ms |
29200 KB |
Output is correct |
60 |
Correct |
383 ms |
29300 KB |
Output is correct |
61 |
Correct |
802 ms |
57720 KB |
Output is correct |
62 |
Correct |
764 ms |
55212 KB |
Output is correct |
63 |
Correct |
428 ms |
964 KB |
Output is correct |
64 |
Correct |
557 ms |
960 KB |
Output is correct |
65 |
Correct |
831 ms |
26520 KB |
Output is correct |
66 |
Correct |
780 ms |
23452 KB |
Output is correct |
67 |
Correct |
456 ms |
936 KB |
Output is correct |
68 |
Correct |
482 ms |
948 KB |
Output is correct |
69 |
Correct |
750 ms |
56408 KB |
Output is correct |
70 |
Correct |
889 ms |
49768 KB |
Output is correct |
71 |
Correct |
575 ms |
6536 KB |
Output is correct |
72 |
Correct |
409 ms |
1348 KB |
Output is correct |