#include "Azer.h"
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
const int INF = 1e9 + 7, N = 2005;
namespace {
V<pi> G[N];
int d[N], vis[N];
int n;
priority_queue<pi, V<pi>, greater<pi>> pq;
int state, last_dist;
int u, dist, code, cnt;
bool bad1, bad2;
// state
// 0: to sent
// 1: waiting B cost
// 2: watting B for who
void send_cost(int cost) {
for(int i = 8; i >= 0; i--)
SendA(cost >> i & 1);
}
void send_who(int who) {
for(int i = 10; i >= 0; i--)
SendA(who >> i & 1);
}
void upd(int dist, int u) {
if(dist - last_dist == (1 << 9) - 1)
return;
assert(!vis[u]);
d[u] = dist;
vis[u] = 1;
last_dist = dist;
for(auto [v, w]:G[u]) {
if(d[u] + w < d[v]) {
d[v] = d[u] + w;
pq.push({d[v], v});
}
}
}
void start() {
bad1 = bad2 = false;
assert(state == 0);
while(pq.size() && vis[pq.top().S])
pq.pop();
if(pq.empty()) {
bad1 = true;
dist = last_dist + (1 << 9) - 1;
} else {
tie(dist, u) = pq.top();
}
send_cost(dist - last_dist);
state = 1;
}
} // namespace
void InitA(int _n, int A, vi u, vi v, vi c) {
n = _n;
for(int i = 0; i < A; i++) {
G[u[i]].EB(v[i], c[i]);
G[v[i]].EB(u[i], c[i]);
}
memset(d, 0x3f, sizeof(d[0]) * n);
memset(vis, 0, sizeof(vis[0]) * n);
d[0] = 0;
pq.push({d[0], 0});
state = 0;
last_dist = 0;
code = 0;
cnt = 0;
start();
}
void ReceiveA(bool x) {
if(state == 1) {
code = code * 2 + x;
cnt++;
if(cnt == 9) {
if(code == (1 << 9) - 1)
bad2 = true;
if(last_dist + code < dist) {
dist = last_dist + code;
state = 2;
code = 0;
cnt = 0;
} else {
if(pq.size()) pq.pop();
send_who(u);
upd(dist, u);
state = 0;
code = 0;
cnt = 0;
if(!bad1 || !bad2)
start();
}
}
} else if(state == 2) {
code = code * 2 + x;
cnt++;
if(cnt == 11) {
u = code;
upd(dist, u);
state = 0;
code = 0;
cnt = 0;
start();
}
} else throw;
}
vi Answer() {
vi ans(n);
for(int i = 0; i < n; i++) {
assert(vis[i]);
ans[i] = d[i];
}
return ans;
}
#include "Baijan.h"
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
const int INF = 1e9 + 7, N = 2005;
namespace {
V<pi> G[N];
int d[N], vis[N];
int n;
priority_queue<pi, V<pi>, greater<pi>> pq;
int state, last_dist;
int u, dist, code, cnt;
// state
// 0: wait A
// 1:
void send_cost(int cost) {
for(int i = 8; i >= 0; i--)
SendB(cost >> i & 1);
}
void send_who(int who) {
for(int i = 10; i >= 0; i--)
SendB(who >> i & 1);
}
void upd(int dist, int u) {
if(dist - last_dist == (1 << 9) - 1)
return;
d[u] = dist;
vis[u] = 1;
last_dist = dist;
for(auto [v, w]:G[u]) {
if(d[u] + w < d[v]) {
d[v] = d[u] + w;
pq.push({d[v], v});
}
}
}
void start() {
assert(state == 0);
while(pq.size() && vis[pq.top().S])
pq.pop();
if(pq.empty()) {
dist = last_dist + (1 << 9) - 1;
} else {
tie(dist, u) = pq.top();
}
}
} // namespace
void InitB(int _n, int A, vi u, vi v, vi c) {
n = _n;
for(int i = 0; i < A; i++) {
G[u[i]].EB(v[i], c[i]);
G[v[i]].EB(u[i], c[i]);
}
memset(d, 0x3f, sizeof(d[0]) * n);
memset(vis, 0, sizeof(vis[0]) * n);
d[0] = 0;
pq.push({d[0], 0});
state = 0;
last_dist = 0;
code = 0;
cnt = 0;
}
void ReceiveB(bool x) {
if(state == 0) {
code = code * 2 + x;
cnt++;
if(cnt == 9) {
start();
if(last_dist + code > dist) {
if(pq.size()) pq.pop();
int tt = dist - last_dist;
cnt = 0;
code = 0;
state = 0;
upd(dist, u);
send_cost(tt);
send_who(u);
} else {
int tt = dist - last_dist;
dist = last_dist + code;
cnt = 0;
code = 0;
state = 1;
send_cost(tt);
}
}
} else if(state == 1) {
code = code * 2 + x;
cnt++;
if(cnt == 11) {
u = code;
cnt = 0;
code = 0;
state = 0;
upd(dist, u);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
298 ms |
324 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
648 KB |
Output is correct |
2 |
Runtime error |
254 ms |
324 KB |
Execution killed with signal 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
208 ms |
324 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
209 ms |
680 KB |
Output is correct |
2 |
Correct |
118 ms |
648 KB |
Output is correct |
3 |
Correct |
266 ms |
13304 KB |
Output is correct |
4 |
Correct |
215 ms |
648 KB |
Output is correct |
5 |
Correct |
294 ms |
10096 KB |
Output is correct |
6 |
Correct |
219 ms |
648 KB |
Output is correct |
7 |
Correct |
188 ms |
716 KB |
Output is correct |
8 |
Correct |
253 ms |
764 KB |
Output is correct |
9 |
Correct |
338 ms |
18052 KB |
Output is correct |
10 |
Correct |
295 ms |
18176 KB |
Output is correct |
11 |
Correct |
355 ms |
35716 KB |
Output is correct |
12 |
Correct |
366 ms |
30544 KB |
Output is correct |
13 |
Correct |
208 ms |
648 KB |
Output is correct |
14 |
Correct |
2 ms |
648 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
209 ms |
680 KB |
Output is correct |
2 |
Correct |
118 ms |
648 KB |
Output is correct |
3 |
Correct |
266 ms |
13304 KB |
Output is correct |
4 |
Correct |
215 ms |
648 KB |
Output is correct |
5 |
Correct |
294 ms |
10096 KB |
Output is correct |
6 |
Correct |
219 ms |
648 KB |
Output is correct |
7 |
Correct |
188 ms |
716 KB |
Output is correct |
8 |
Correct |
253 ms |
764 KB |
Output is correct |
9 |
Correct |
338 ms |
18052 KB |
Output is correct |
10 |
Correct |
295 ms |
18176 KB |
Output is correct |
11 |
Correct |
355 ms |
35716 KB |
Output is correct |
12 |
Correct |
366 ms |
30544 KB |
Output is correct |
13 |
Correct |
208 ms |
648 KB |
Output is correct |
14 |
Correct |
2 ms |
648 KB |
Output is correct |
15 |
Correct |
275 ms |
692 KB |
Output is correct |
16 |
Correct |
250 ms |
648 KB |
Output is correct |
17 |
Correct |
204 ms |
716 KB |
Output is correct |
18 |
Correct |
319 ms |
10092 KB |
Output is correct |
19 |
Correct |
263 ms |
648 KB |
Output is correct |
20 |
Correct |
355 ms |
10352 KB |
Output is correct |
21 |
Correct |
301 ms |
648 KB |
Output is correct |
22 |
Correct |
224 ms |
648 KB |
Output is correct |
23 |
Correct |
344 ms |
22148 KB |
Output is correct |
24 |
Correct |
361 ms |
22260 KB |
Output is correct |
25 |
Correct |
505 ms |
43512 KB |
Output is correct |
26 |
Correct |
434 ms |
36336 KB |
Output is correct |
27 |
Correct |
276 ms |
776 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
209 ms |
680 KB |
Output is correct |
2 |
Correct |
118 ms |
648 KB |
Output is correct |
3 |
Correct |
266 ms |
13304 KB |
Output is correct |
4 |
Correct |
215 ms |
648 KB |
Output is correct |
5 |
Correct |
294 ms |
10096 KB |
Output is correct |
6 |
Correct |
219 ms |
648 KB |
Output is correct |
7 |
Correct |
188 ms |
716 KB |
Output is correct |
8 |
Correct |
253 ms |
764 KB |
Output is correct |
9 |
Correct |
338 ms |
18052 KB |
Output is correct |
10 |
Correct |
295 ms |
18176 KB |
Output is correct |
11 |
Correct |
355 ms |
35716 KB |
Output is correct |
12 |
Correct |
366 ms |
30544 KB |
Output is correct |
13 |
Correct |
208 ms |
648 KB |
Output is correct |
14 |
Correct |
2 ms |
648 KB |
Output is correct |
15 |
Correct |
275 ms |
692 KB |
Output is correct |
16 |
Correct |
250 ms |
648 KB |
Output is correct |
17 |
Correct |
204 ms |
716 KB |
Output is correct |
18 |
Correct |
319 ms |
10092 KB |
Output is correct |
19 |
Correct |
263 ms |
648 KB |
Output is correct |
20 |
Correct |
355 ms |
10352 KB |
Output is correct |
21 |
Correct |
301 ms |
648 KB |
Output is correct |
22 |
Correct |
224 ms |
648 KB |
Output is correct |
23 |
Correct |
344 ms |
22148 KB |
Output is correct |
24 |
Correct |
361 ms |
22260 KB |
Output is correct |
25 |
Correct |
505 ms |
43512 KB |
Output is correct |
26 |
Correct |
434 ms |
36336 KB |
Output is correct |
27 |
Correct |
276 ms |
776 KB |
Output is correct |
28 |
Correct |
320 ms |
648 KB |
Output is correct |
29 |
Correct |
331 ms |
768 KB |
Output is correct |
30 |
Correct |
485 ms |
24052 KB |
Output is correct |
31 |
Correct |
406 ms |
656 KB |
Output is correct |
32 |
Correct |
510 ms |
21092 KB |
Output is correct |
33 |
Correct |
380 ms |
732 KB |
Output is correct |
34 |
Correct |
328 ms |
904 KB |
Output is correct |
35 |
Correct |
339 ms |
904 KB |
Output is correct |
36 |
Correct |
592 ms |
24632 KB |
Output is correct |
37 |
Correct |
519 ms |
24748 KB |
Output is correct |
38 |
Correct |
681 ms |
48880 KB |
Output is correct |
39 |
Correct |
647 ms |
44228 KB |
Output is correct |
40 |
Correct |
391 ms |
904 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
298 ms |
324 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |