#include "Azer.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int mxn = 2001;
const int mxval = 9;
const int mxloc = 11;
const int inf = 1e6;
namespace {
int n;
vector<pair<int, int>> adj[mxn];
bool visited[mxn];
vector<int> dist;
int mxdist = 0;
void send_val(int x, int bits) {
// printf("A: send x = %d, bits = %d\n", x, bits);
vector<bool> send;
for(int i = 0; i < bits; i++) {
send.push_back(x % 2 == 1);
x /= 2;
}
reverse(send.begin(), send.end());
for(bool x : send) SendA(x);
}
int val = 0, tim = 0;
void read_val(int t) {
// printf("A: read x for t = %d\n", t);
val = 0;
tim = t;
}
void place(int u, int d) {
visited[u] = true; dist[u] = d;
for(auto e : adj[u]) dist[e.fi] = min(dist[e.fi], dist[u]+e.se);
mxdist = max(mxdist, dist[u]);
}
int gotd = 0;
bool reading_location = false;
pair<int, int> my_mn;
pair<int, int> get_min_dist_loc() {
pair<int, int> res = {(1<<mxval)-1, (1<<mxloc)-1};
for(int i = 0; i < n; i++) if(!visited[i] && dist[i] < inf) {
if(dist[i]-mxdist < res.fi) {
res = {dist[i]-mxdist, i};
}
}
return res;
}
} // namespace
void InitA(int N, int A, vector<int> U, vector<int> V, vector<int> C) {
n = 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]});
}
dist = vector<int>(n, inf);
place(0, 0);
if(n == 1) return;
my_mn = get_min_dist_loc();
send_val(my_mn.fi, mxval);
read_val(mxval);
}
void ReceiveA(bool x) {
if(tim > 0) {
val = 2*val+x;
tim--;
// printf("A: tim = %d, val = %d\n", tim, val);
}
if(tim > 0) return;
// printf("A: val = %d, gotd = %d, read loc = %d\n", val, gotd, reading_location);
if(!reading_location) {
// !!! Need asymmetry !!!
if(my_mn.fi <= val) {
place(my_mn.se, mxdist+my_mn.fi);
send_val(my_mn.se, mxloc);
// send the next mn dist
if(count(visited, visited+n, true) >= n) return;
my_mn = get_min_dist_loc();
send_val(my_mn.fi, mxval);
read_val(mxval);
}
else {
reading_location = true;
gotd = val;
read_val(mxloc);
}
}
else {
reading_location = false;
place(val, mxdist+gotd);
// send the next mn dist
if(count(visited, visited+n, true) >= n) return;
my_mn = get_min_dist_loc();
send_val(my_mn.fi, mxval);
read_val(mxval);
}
// printf("A dist: ");
// for(int i = 0; i < n; i++) printf("%d, ", dist[i]);
// printf("\n");
// printf("A visited: ");
// for(int i = 0; i < n; i++) printf("%d, ", visited[i]);
// printf("\n");
}
vector<int> Answer() {
return dist;
}
#include "Baijan.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int mxn = 2001;
const int mxval = 9;
const int mxloc = 11;
const int inf = 1e6;
namespace {
int n;
vector<pair<int, int>> adj[mxn];
bool visited[mxn];
vector<int> dist;
int mxdist = 0;
void send_val(int x, int bits) {
// printf("B: send x = %d, bits = %d\n", x, bits);
vector<bool> send;
for(int i = 0; i < bits; i++) {
send.push_back(x % 2 == 1);
x /= 2;
}
reverse(send.begin(), send.end());
for(bool x : send) SendB(x);
}
int val = 0, tim = 0;
void read_val(int t) {
// printf("B: read x for t = %d\n", t);
val = 0;
tim = t;
}
void place(int u, int d) {
visited[u] = true; dist[u] = d;
for(auto e : adj[u]) dist[e.fi] = min(dist[e.fi], dist[u]+e.se);
mxdist = max(mxdist, dist[u]);
}
int gotd = 0;
bool reading_location = false;
pair<int, int> my_mn;
pair<int, int> get_min_dist_loc() {
pair<int, int> res = {(1<<mxval)-1, (1<<mxloc)-1};
for(int i = 0; i < n; i++) if(!visited[i] && dist[i] < inf) {
if(dist[i]-mxdist < res.fi) {
res = {dist[i]-mxdist, i};
}
}
return res;
}
} // namespace
void InitB(int N, int A, vector<int> U, vector<int> V, vector<int> C) {
n = 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]});
}
dist = vector<int>(n, inf);
place(0, 0);
if(n == 1) return;
my_mn = get_min_dist_loc();
send_val(my_mn.fi, mxval);
read_val(mxval);
}
void ReceiveB(bool x) {
if(tim > 0) {
val = 2*val+x;
tim--;
// printf("B: tim = %d, val = %d\n", tim, val);
}
if(tim > 0) return;
// printf("B: val = %d, gotd = %d, read loc = %d\n", val, gotd, reading_location);
if(!reading_location) {
// !!! Need asymmetry !!!
if(my_mn.fi < val) {
place(my_mn.se, mxdist+my_mn.fi);
send_val(my_mn.se, mxloc);
// send the next mn dist
if(count(visited, visited+n, true) >= n) return;
my_mn = get_min_dist_loc();
send_val(my_mn.fi, mxval);
read_val(mxval);
}
else {
reading_location = true;
gotd = val;
read_val(mxloc);
}
}
else {
reading_location = false;
place(val, mxdist+gotd);
// send the next mn dist
if(count(visited, visited+n, true) >= n) return;
my_mn = get_min_dist_loc();
send_val(my_mn.fi, mxval);
read_val(mxval);
}
// printf("B dist: ");
// for(int i = 0; i < n; i++) printf("%d, ", dist[i]);
// printf("\n");
// printf("B visited: ");
// for(int i = 0; i < n; i++) printf("%d, ", visited[i]);
// printf("\n");
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
300 ms |
788 KB |
Output is correct |
2 |
Correct |
0 ms |
656 KB |
Output is correct |
3 |
Correct |
343 ms |
792 KB |
Output is correct |
4 |
Correct |
335 ms |
10100 KB |
Output is correct |
5 |
Correct |
22 ms |
912 KB |
Output is correct |
6 |
Correct |
315 ms |
2196 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
656 KB |
Output is correct |
2 |
Correct |
381 ms |
736 KB |
Output is correct |
3 |
Correct |
365 ms |
804 KB |
Output is correct |
4 |
Correct |
498 ms |
27564 KB |
Output is correct |
5 |
Correct |
486 ms |
24068 KB |
Output is correct |
6 |
Correct |
71 ms |
656 KB |
Output is correct |
7 |
Correct |
443 ms |
24316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
369 ms |
656 KB |
Output is correct |
2 |
Correct |
0 ms |
568 KB |
Output is correct |
3 |
Correct |
363 ms |
788 KB |
Output is correct |
4 |
Correct |
296 ms |
740 KB |
Output is correct |
5 |
Correct |
343 ms |
744 KB |
Output is correct |
6 |
Correct |
392 ms |
728 KB |
Output is correct |
7 |
Correct |
307 ms |
744 KB |
Output is correct |
8 |
Correct |
388 ms |
664 KB |
Output is correct |
9 |
Correct |
413 ms |
656 KB |
Output is correct |
10 |
Correct |
382 ms |
788 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
160 ms |
656 KB |
Output is correct |
2 |
Correct |
132 ms |
656 KB |
Output is correct |
3 |
Correct |
220 ms |
13220 KB |
Output is correct |
4 |
Correct |
143 ms |
656 KB |
Output is correct |
5 |
Correct |
234 ms |
10080 KB |
Output is correct |
6 |
Correct |
177 ms |
656 KB |
Output is correct |
7 |
Correct |
161 ms |
656 KB |
Output is correct |
8 |
Correct |
150 ms |
656 KB |
Output is correct |
9 |
Correct |
266 ms |
18084 KB |
Output is correct |
10 |
Correct |
220 ms |
18208 KB |
Output is correct |
11 |
Correct |
351 ms |
35580 KB |
Output is correct |
12 |
Correct |
315 ms |
30592 KB |
Output is correct |
13 |
Correct |
179 ms |
656 KB |
Output is correct |
14 |
Correct |
0 ms |
656 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
160 ms |
656 KB |
Output is correct |
2 |
Correct |
132 ms |
656 KB |
Output is correct |
3 |
Correct |
220 ms |
13220 KB |
Output is correct |
4 |
Correct |
143 ms |
656 KB |
Output is correct |
5 |
Correct |
234 ms |
10080 KB |
Output is correct |
6 |
Correct |
177 ms |
656 KB |
Output is correct |
7 |
Correct |
161 ms |
656 KB |
Output is correct |
8 |
Correct |
150 ms |
656 KB |
Output is correct |
9 |
Correct |
266 ms |
18084 KB |
Output is correct |
10 |
Correct |
220 ms |
18208 KB |
Output is correct |
11 |
Correct |
351 ms |
35580 KB |
Output is correct |
12 |
Correct |
315 ms |
30592 KB |
Output is correct |
13 |
Correct |
179 ms |
656 KB |
Output is correct |
14 |
Correct |
0 ms |
656 KB |
Output is correct |
15 |
Correct |
207 ms |
692 KB |
Output is correct |
16 |
Correct |
180 ms |
656 KB |
Output is correct |
17 |
Correct |
225 ms |
656 KB |
Output is correct |
18 |
Correct |
243 ms |
10012 KB |
Output is correct |
19 |
Correct |
210 ms |
656 KB |
Output is correct |
20 |
Correct |
270 ms |
10268 KB |
Output is correct |
21 |
Correct |
209 ms |
736 KB |
Output is correct |
22 |
Correct |
212 ms |
656 KB |
Output is correct |
23 |
Correct |
314 ms |
22152 KB |
Output is correct |
24 |
Correct |
269 ms |
22156 KB |
Output is correct |
25 |
Correct |
406 ms |
43556 KB |
Output is correct |
26 |
Correct |
358 ms |
36372 KB |
Output is correct |
27 |
Correct |
204 ms |
756 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
160 ms |
656 KB |
Output is correct |
2 |
Correct |
132 ms |
656 KB |
Output is correct |
3 |
Correct |
220 ms |
13220 KB |
Output is correct |
4 |
Correct |
143 ms |
656 KB |
Output is correct |
5 |
Correct |
234 ms |
10080 KB |
Output is correct |
6 |
Correct |
177 ms |
656 KB |
Output is correct |
7 |
Correct |
161 ms |
656 KB |
Output is correct |
8 |
Correct |
150 ms |
656 KB |
Output is correct |
9 |
Correct |
266 ms |
18084 KB |
Output is correct |
10 |
Correct |
220 ms |
18208 KB |
Output is correct |
11 |
Correct |
351 ms |
35580 KB |
Output is correct |
12 |
Correct |
315 ms |
30592 KB |
Output is correct |
13 |
Correct |
179 ms |
656 KB |
Output is correct |
14 |
Correct |
0 ms |
656 KB |
Output is correct |
15 |
Correct |
207 ms |
692 KB |
Output is correct |
16 |
Correct |
180 ms |
656 KB |
Output is correct |
17 |
Correct |
225 ms |
656 KB |
Output is correct |
18 |
Correct |
243 ms |
10012 KB |
Output is correct |
19 |
Correct |
210 ms |
656 KB |
Output is correct |
20 |
Correct |
270 ms |
10268 KB |
Output is correct |
21 |
Correct |
209 ms |
736 KB |
Output is correct |
22 |
Correct |
212 ms |
656 KB |
Output is correct |
23 |
Correct |
314 ms |
22152 KB |
Output is correct |
24 |
Correct |
269 ms |
22156 KB |
Output is correct |
25 |
Correct |
406 ms |
43556 KB |
Output is correct |
26 |
Correct |
358 ms |
36372 KB |
Output is correct |
27 |
Correct |
204 ms |
756 KB |
Output is correct |
28 |
Correct |
283 ms |
700 KB |
Output is correct |
29 |
Correct |
237 ms |
660 KB |
Output is correct |
30 |
Correct |
343 ms |
24008 KB |
Output is correct |
31 |
Correct |
319 ms |
656 KB |
Output is correct |
32 |
Correct |
386 ms |
21092 KB |
Output is correct |
33 |
Correct |
279 ms |
748 KB |
Output is correct |
34 |
Correct |
256 ms |
760 KB |
Output is correct |
35 |
Correct |
275 ms |
756 KB |
Output is correct |
36 |
Correct |
392 ms |
24704 KB |
Output is correct |
37 |
Correct |
359 ms |
24708 KB |
Output is correct |
38 |
Correct |
465 ms |
48912 KB |
Output is correct |
39 |
Correct |
418 ms |
44140 KB |
Output is correct |
40 |
Correct |
263 ms |
912 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
300 ms |
788 KB |
Output is correct |
2 |
Correct |
0 ms |
656 KB |
Output is correct |
3 |
Correct |
343 ms |
792 KB |
Output is correct |
4 |
Correct |
335 ms |
10100 KB |
Output is correct |
5 |
Correct |
22 ms |
912 KB |
Output is correct |
6 |
Correct |
315 ms |
2196 KB |
Output is correct |
7 |
Correct |
0 ms |
656 KB |
Output is correct |
8 |
Correct |
381 ms |
736 KB |
Output is correct |
9 |
Correct |
365 ms |
804 KB |
Output is correct |
10 |
Correct |
498 ms |
27564 KB |
Output is correct |
11 |
Correct |
486 ms |
24068 KB |
Output is correct |
12 |
Correct |
71 ms |
656 KB |
Output is correct |
13 |
Correct |
443 ms |
24316 KB |
Output is correct |
14 |
Correct |
369 ms |
656 KB |
Output is correct |
15 |
Correct |
0 ms |
568 KB |
Output is correct |
16 |
Correct |
363 ms |
788 KB |
Output is correct |
17 |
Correct |
296 ms |
740 KB |
Output is correct |
18 |
Correct |
343 ms |
744 KB |
Output is correct |
19 |
Correct |
392 ms |
728 KB |
Output is correct |
20 |
Correct |
307 ms |
744 KB |
Output is correct |
21 |
Correct |
388 ms |
664 KB |
Output is correct |
22 |
Correct |
413 ms |
656 KB |
Output is correct |
23 |
Correct |
382 ms |
788 KB |
Output is correct |
24 |
Correct |
160 ms |
656 KB |
Output is correct |
25 |
Correct |
132 ms |
656 KB |
Output is correct |
26 |
Correct |
220 ms |
13220 KB |
Output is correct |
27 |
Correct |
143 ms |
656 KB |
Output is correct |
28 |
Correct |
234 ms |
10080 KB |
Output is correct |
29 |
Correct |
177 ms |
656 KB |
Output is correct |
30 |
Correct |
161 ms |
656 KB |
Output is correct |
31 |
Correct |
150 ms |
656 KB |
Output is correct |
32 |
Correct |
266 ms |
18084 KB |
Output is correct |
33 |
Correct |
220 ms |
18208 KB |
Output is correct |
34 |
Correct |
351 ms |
35580 KB |
Output is correct |
35 |
Correct |
315 ms |
30592 KB |
Output is correct |
36 |
Correct |
179 ms |
656 KB |
Output is correct |
37 |
Correct |
0 ms |
656 KB |
Output is correct |
38 |
Correct |
207 ms |
692 KB |
Output is correct |
39 |
Correct |
180 ms |
656 KB |
Output is correct |
40 |
Correct |
225 ms |
656 KB |
Output is correct |
41 |
Correct |
243 ms |
10012 KB |
Output is correct |
42 |
Correct |
210 ms |
656 KB |
Output is correct |
43 |
Correct |
270 ms |
10268 KB |
Output is correct |
44 |
Correct |
209 ms |
736 KB |
Output is correct |
45 |
Correct |
212 ms |
656 KB |
Output is correct |
46 |
Correct |
314 ms |
22152 KB |
Output is correct |
47 |
Correct |
269 ms |
22156 KB |
Output is correct |
48 |
Correct |
406 ms |
43556 KB |
Output is correct |
49 |
Correct |
358 ms |
36372 KB |
Output is correct |
50 |
Correct |
204 ms |
756 KB |
Output is correct |
51 |
Correct |
283 ms |
700 KB |
Output is correct |
52 |
Correct |
237 ms |
660 KB |
Output is correct |
53 |
Correct |
343 ms |
24008 KB |
Output is correct |
54 |
Correct |
319 ms |
656 KB |
Output is correct |
55 |
Correct |
386 ms |
21092 KB |
Output is correct |
56 |
Correct |
279 ms |
748 KB |
Output is correct |
57 |
Correct |
256 ms |
760 KB |
Output is correct |
58 |
Correct |
275 ms |
756 KB |
Output is correct |
59 |
Correct |
392 ms |
24704 KB |
Output is correct |
60 |
Correct |
359 ms |
24708 KB |
Output is correct |
61 |
Correct |
465 ms |
48912 KB |
Output is correct |
62 |
Correct |
418 ms |
44140 KB |
Output is correct |
63 |
Correct |
263 ms |
912 KB |
Output is correct |
64 |
Correct |
414 ms |
960 KB |
Output is correct |
65 |
Correct |
457 ms |
26444 KB |
Output is correct |
66 |
Correct |
508 ms |
23572 KB |
Output is correct |
67 |
Correct |
315 ms |
940 KB |
Output is correct |
68 |
Correct |
416 ms |
936 KB |
Output is correct |
69 |
Correct |
598 ms |
47476 KB |
Output is correct |
70 |
Correct |
581 ms |
39460 KB |
Output is correct |
71 |
Correct |
423 ms |
5012 KB |
Output is correct |
72 |
Correct |
358 ms |
1168 KB |
Output is correct |