#include "Azer.h"
#include <vector>
#include <iostream>
using namespace std;
#define ll long long
#define maxn 2005
#define pii pair<int, int>
#define ff first
#define ss second
namespace {
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
while (l != r) cout << *l << " ", l++;
cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
const int inf = (1LL<<28) - 1;
const int wbit = 9, nbit = 11;
int N;
int done = 0;
int dis[maxn];
bool vis[maxn];
vector<pii> adj[maxn];
vector<bool> buf;
int wait = 0; //0:weight, 1:node
int cur = 0, bind = 0, bval = 0;
int uind = 0, uval = 0;
void send_weight(int w) {
if (w >= (1<<wbit)) w = (1<<wbit) - 1;
for (int i = 0;i < wbit;i++) {
SendA(w & (1<<i));
}
}
void send_node(int id) {
for (int i = 0;i < nbit;i++) {
SendA(id & (1<<i));
}
}
int getnum() {
int siz = 1;
if (wait == 0) siz = wbit;
else if (wait == 1) siz = nbit;
int ret = 0;
for (int i = 0;i < siz;i++) {
ret = ret+ (buf[i] ? 1<<i : 0);
}
buf.erase(buf.begin(), buf.begin() + siz);
return ret;
}
void get_best() {
int best = inf;
bind = 0;
for (int j = 0;j < N;j++) {
if (!vis[j] && dis[j] < best) {
best = dis[j];
bind = j;
}
}
wait = 0;
bval = best - cur;
send_weight(best - cur);
}
void solve() {
if (wait == 0 && buf.size() >= wbit) {
uval = getnum();
if (bval <= uval) {
for (auto [v, e]:adj[bind]) {
if (dis[bind] + e < dis[v]) {
dis[v] = dis[bind] + e;
}
}
vis[bind] = 1;
cur = dis[bind];
if (++done >= N) Answer();
else {
send_node(bind);
get_best();
}
return;
}
wait = 1;
solve();
} else if (wait == 1 && buf.size() >= nbit){
uind = getnum();
dis[uind] = uval + cur;
vis[uind] = 1;
for (auto [v, e]:adj[uind]) {
if (dis[uind] + e < dis[v]) {
dis[v] = dis[uind] + e;
}
}
cur += uval;
if (++done >= N) Answer();
else {
get_best();
}
}
}
} // namespace
std::vector<int> Answer() {
std::vector<int> ans(N);
for (int k = 0; k < N; ++k) {
ans[k] = dis[k];
}
return ans;
}
void ReceiveA(bool x) {
buf.push_back(x);
solve();
}
void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
std::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]});
}
for (int i = 0;i < N;i++) dis[i] = inf, vis[i] = 0;
dis[0] = 0;
get_best();
}
#include "Baijan.h"
#include <vector>
#include <iostream>
using namespace std;
#define ll long long
#define maxn 2005
#define pii pair<int, int>
#define ff first
#define ss second
namespace {
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
while (l != r) cout << *l << " ", l++;
cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
const int inf = (1LL<<28) - 1;
const int wbit = 9, nbit = 11;
int N;
int done = 0;
int dis[maxn];
bool vis[maxn];
vector<pii> adj[maxn];
vector<bool> buf;
int wait = 0; //0:weight, 1:node
int cur = 0, bind = 0;
int uind = 0, uval = 0;
void send_weight(int w) {
if (w >= (1<<wbit)) w = (1<<wbit) - 1;
for (int i = 0;i < wbit;i++) {
SendB(w & (1<<i));
}
}
void send_node(int id) {
for (int i = 0;i < nbit;i++) {
SendB(id & (1<<i));
}
}
int getnum() {
int siz = 1;
if (wait == 0) siz = wbit;
else if (wait == 1) siz = nbit;
int ret = 0;
for (int i = 0;i < siz;i++) {
ret = ret + (buf[i] ? 1<<i : 0);
}
buf.erase(buf.begin(), buf.begin() + siz);
return ret;
}
void get_best() {
int best = inf;
bind = 0;
for (int j = 0;j < N;j++) {
if (!vis[j] && dis[j] < best) {
best = dis[j];
bind = j;
}
}
send_weight(best - cur);
if (best - cur < uval) {
send_node(bind);
for (auto [v, e]:adj[bind]) {
if (dis[bind] + e < dis[v]) {
dis[v] = dis[bind] + e;
}
}
vis[bind] = 1;
cur = dis[bind];
wait = 0;
} else {
wait = 1;
}
}
void solve() {
if (wait == 0 && buf.size() >= wbit) {
uval = getnum();
get_best();
} else if (wait == 1 && buf.size() >= nbit){
uind = getnum();
dis[uind] = uval + cur;
vis[uind] = 1;
for (auto [v, e]:adj[uind]) {
if (dis[uind] + e < dis[v]) {
dis[v] = dis[uind] + e;
}
}
cur += uval;
wait = 0;
}
}
} // namespace
void ReceiveB(bool x) {
buf.push_back(x);
solve();
}
void InitB(int N, int A, std::vector<int> U, std::vector<int> V,
std::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]});
}
for (int i = 0;i < N;i++) dis[i] = inf, vis[i] = 0;
dis[0] = 0;
}
Compilation message
Baijan.cpp:27:5: warning: '{anonymous}::done' defined but not used [-Wunused-variable]
27 | int done = 0;
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
657 ms |
784 KB |
Output is correct |
2 |
Correct |
1 ms |
648 KB |
Output is correct |
3 |
Correct |
640 ms |
784 KB |
Output is correct |
4 |
Correct |
434 ms |
10088 KB |
Output is correct |
5 |
Correct |
32 ms |
904 KB |
Output is correct |
6 |
Correct |
578 ms |
2316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
648 KB |
Output is correct |
2 |
Correct |
448 ms |
740 KB |
Output is correct |
3 |
Correct |
650 ms |
796 KB |
Output is correct |
4 |
Correct |
717 ms |
27512 KB |
Output is correct |
5 |
Correct |
730 ms |
24056 KB |
Output is correct |
6 |
Correct |
116 ms |
648 KB |
Output is correct |
7 |
Correct |
758 ms |
24316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
477 ms |
716 KB |
Output is correct |
2 |
Correct |
2 ms |
648 KB |
Output is correct |
3 |
Correct |
620 ms |
800 KB |
Output is correct |
4 |
Correct |
629 ms |
744 KB |
Output is correct |
5 |
Correct |
421 ms |
728 KB |
Output is correct |
6 |
Correct |
503 ms |
720 KB |
Output is correct |
7 |
Correct |
500 ms |
744 KB |
Output is correct |
8 |
Correct |
597 ms |
660 KB |
Output is correct |
9 |
Correct |
561 ms |
648 KB |
Output is correct |
10 |
Correct |
522 ms |
780 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
257 ms |
676 KB |
Output is correct |
2 |
Correct |
257 ms |
652 KB |
Output is correct |
3 |
Correct |
286 ms |
13188 KB |
Output is correct |
4 |
Correct |
273 ms |
708 KB |
Output is correct |
5 |
Correct |
314 ms |
10112 KB |
Output is correct |
6 |
Correct |
234 ms |
648 KB |
Output is correct |
7 |
Correct |
251 ms |
648 KB |
Output is correct |
8 |
Correct |
245 ms |
648 KB |
Output is correct |
9 |
Correct |
370 ms |
18048 KB |
Output is correct |
10 |
Correct |
347 ms |
18188 KB |
Output is correct |
11 |
Correct |
451 ms |
35704 KB |
Output is correct |
12 |
Correct |
424 ms |
30624 KB |
Output is correct |
13 |
Correct |
262 ms |
648 KB |
Output is correct |
14 |
Correct |
2 ms |
648 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
257 ms |
676 KB |
Output is correct |
2 |
Correct |
257 ms |
652 KB |
Output is correct |
3 |
Correct |
286 ms |
13188 KB |
Output is correct |
4 |
Correct |
273 ms |
708 KB |
Output is correct |
5 |
Correct |
314 ms |
10112 KB |
Output is correct |
6 |
Correct |
234 ms |
648 KB |
Output is correct |
7 |
Correct |
251 ms |
648 KB |
Output is correct |
8 |
Correct |
245 ms |
648 KB |
Output is correct |
9 |
Correct |
370 ms |
18048 KB |
Output is correct |
10 |
Correct |
347 ms |
18188 KB |
Output is correct |
11 |
Correct |
451 ms |
35704 KB |
Output is correct |
12 |
Correct |
424 ms |
30624 KB |
Output is correct |
13 |
Correct |
262 ms |
648 KB |
Output is correct |
14 |
Correct |
2 ms |
648 KB |
Output is correct |
15 |
Correct |
277 ms |
648 KB |
Output is correct |
16 |
Correct |
298 ms |
712 KB |
Output is correct |
17 |
Correct |
287 ms |
648 KB |
Output is correct |
18 |
Correct |
306 ms |
10100 KB |
Output is correct |
19 |
Correct |
221 ms |
716 KB |
Output is correct |
20 |
Correct |
355 ms |
10268 KB |
Output is correct |
21 |
Correct |
273 ms |
648 KB |
Output is correct |
22 |
Correct |
288 ms |
648 KB |
Output is correct |
23 |
Correct |
417 ms |
22148 KB |
Output is correct |
24 |
Correct |
410 ms |
22144 KB |
Output is correct |
25 |
Correct |
561 ms |
43504 KB |
Output is correct |
26 |
Correct |
467 ms |
36368 KB |
Output is correct |
27 |
Correct |
253 ms |
648 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
257 ms |
676 KB |
Output is correct |
2 |
Correct |
257 ms |
652 KB |
Output is correct |
3 |
Correct |
286 ms |
13188 KB |
Output is correct |
4 |
Correct |
273 ms |
708 KB |
Output is correct |
5 |
Correct |
314 ms |
10112 KB |
Output is correct |
6 |
Correct |
234 ms |
648 KB |
Output is correct |
7 |
Correct |
251 ms |
648 KB |
Output is correct |
8 |
Correct |
245 ms |
648 KB |
Output is correct |
9 |
Correct |
370 ms |
18048 KB |
Output is correct |
10 |
Correct |
347 ms |
18188 KB |
Output is correct |
11 |
Correct |
451 ms |
35704 KB |
Output is correct |
12 |
Correct |
424 ms |
30624 KB |
Output is correct |
13 |
Correct |
262 ms |
648 KB |
Output is correct |
14 |
Correct |
2 ms |
648 KB |
Output is correct |
15 |
Correct |
277 ms |
648 KB |
Output is correct |
16 |
Correct |
298 ms |
712 KB |
Output is correct |
17 |
Correct |
287 ms |
648 KB |
Output is correct |
18 |
Correct |
306 ms |
10100 KB |
Output is correct |
19 |
Correct |
221 ms |
716 KB |
Output is correct |
20 |
Correct |
355 ms |
10268 KB |
Output is correct |
21 |
Correct |
273 ms |
648 KB |
Output is correct |
22 |
Correct |
288 ms |
648 KB |
Output is correct |
23 |
Correct |
417 ms |
22148 KB |
Output is correct |
24 |
Correct |
410 ms |
22144 KB |
Output is correct |
25 |
Correct |
561 ms |
43504 KB |
Output is correct |
26 |
Correct |
467 ms |
36368 KB |
Output is correct |
27 |
Correct |
253 ms |
648 KB |
Output is correct |
28 |
Correct |
410 ms |
648 KB |
Output is correct |
29 |
Correct |
424 ms |
648 KB |
Output is correct |
30 |
Correct |
587 ms |
24060 KB |
Output is correct |
31 |
Correct |
377 ms |
648 KB |
Output is correct |
32 |
Correct |
338 ms |
21036 KB |
Output is correct |
33 |
Correct |
357 ms |
724 KB |
Output is correct |
34 |
Correct |
347 ms |
760 KB |
Output is correct |
35 |
Correct |
363 ms |
756 KB |
Output is correct |
36 |
Correct |
518 ms |
24716 KB |
Output is correct |
37 |
Correct |
536 ms |
24712 KB |
Output is correct |
38 |
Correct |
673 ms |
49040 KB |
Output is correct |
39 |
Correct |
633 ms |
44276 KB |
Output is correct |
40 |
Correct |
285 ms |
912 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
657 ms |
784 KB |
Output is correct |
2 |
Correct |
1 ms |
648 KB |
Output is correct |
3 |
Correct |
640 ms |
784 KB |
Output is correct |
4 |
Correct |
434 ms |
10088 KB |
Output is correct |
5 |
Correct |
32 ms |
904 KB |
Output is correct |
6 |
Correct |
578 ms |
2316 KB |
Output is correct |
7 |
Correct |
1 ms |
648 KB |
Output is correct |
8 |
Correct |
448 ms |
740 KB |
Output is correct |
9 |
Correct |
650 ms |
796 KB |
Output is correct |
10 |
Correct |
717 ms |
27512 KB |
Output is correct |
11 |
Correct |
730 ms |
24056 KB |
Output is correct |
12 |
Correct |
116 ms |
648 KB |
Output is correct |
13 |
Correct |
758 ms |
24316 KB |
Output is correct |
14 |
Correct |
477 ms |
716 KB |
Output is correct |
15 |
Correct |
2 ms |
648 KB |
Output is correct |
16 |
Correct |
620 ms |
800 KB |
Output is correct |
17 |
Correct |
629 ms |
744 KB |
Output is correct |
18 |
Correct |
421 ms |
728 KB |
Output is correct |
19 |
Correct |
503 ms |
720 KB |
Output is correct |
20 |
Correct |
500 ms |
744 KB |
Output is correct |
21 |
Correct |
597 ms |
660 KB |
Output is correct |
22 |
Correct |
561 ms |
648 KB |
Output is correct |
23 |
Correct |
522 ms |
780 KB |
Output is correct |
24 |
Correct |
257 ms |
676 KB |
Output is correct |
25 |
Correct |
257 ms |
652 KB |
Output is correct |
26 |
Correct |
286 ms |
13188 KB |
Output is correct |
27 |
Correct |
273 ms |
708 KB |
Output is correct |
28 |
Correct |
314 ms |
10112 KB |
Output is correct |
29 |
Correct |
234 ms |
648 KB |
Output is correct |
30 |
Correct |
251 ms |
648 KB |
Output is correct |
31 |
Correct |
245 ms |
648 KB |
Output is correct |
32 |
Correct |
370 ms |
18048 KB |
Output is correct |
33 |
Correct |
347 ms |
18188 KB |
Output is correct |
34 |
Correct |
451 ms |
35704 KB |
Output is correct |
35 |
Correct |
424 ms |
30624 KB |
Output is correct |
36 |
Correct |
262 ms |
648 KB |
Output is correct |
37 |
Correct |
2 ms |
648 KB |
Output is correct |
38 |
Correct |
277 ms |
648 KB |
Output is correct |
39 |
Correct |
298 ms |
712 KB |
Output is correct |
40 |
Correct |
287 ms |
648 KB |
Output is correct |
41 |
Correct |
306 ms |
10100 KB |
Output is correct |
42 |
Correct |
221 ms |
716 KB |
Output is correct |
43 |
Correct |
355 ms |
10268 KB |
Output is correct |
44 |
Correct |
273 ms |
648 KB |
Output is correct |
45 |
Correct |
288 ms |
648 KB |
Output is correct |
46 |
Correct |
417 ms |
22148 KB |
Output is correct |
47 |
Correct |
410 ms |
22144 KB |
Output is correct |
48 |
Correct |
561 ms |
43504 KB |
Output is correct |
49 |
Correct |
467 ms |
36368 KB |
Output is correct |
50 |
Correct |
253 ms |
648 KB |
Output is correct |
51 |
Correct |
410 ms |
648 KB |
Output is correct |
52 |
Correct |
424 ms |
648 KB |
Output is correct |
53 |
Correct |
587 ms |
24060 KB |
Output is correct |
54 |
Correct |
377 ms |
648 KB |
Output is correct |
55 |
Correct |
338 ms |
21036 KB |
Output is correct |
56 |
Correct |
357 ms |
724 KB |
Output is correct |
57 |
Correct |
347 ms |
760 KB |
Output is correct |
58 |
Correct |
363 ms |
756 KB |
Output is correct |
59 |
Correct |
518 ms |
24716 KB |
Output is correct |
60 |
Correct |
536 ms |
24712 KB |
Output is correct |
61 |
Correct |
673 ms |
49040 KB |
Output is correct |
62 |
Correct |
633 ms |
44276 KB |
Output is correct |
63 |
Correct |
285 ms |
912 KB |
Output is correct |
64 |
Correct |
519 ms |
884 KB |
Output is correct |
65 |
Correct |
712 ms |
26512 KB |
Output is correct |
66 |
Correct |
603 ms |
23408 KB |
Output is correct |
67 |
Correct |
509 ms |
924 KB |
Output is correct |
68 |
Correct |
462 ms |
904 KB |
Output is correct |
69 |
Correct |
830 ms |
47604 KB |
Output is correct |
70 |
Correct |
735 ms |
39556 KB |
Output is correct |
71 |
Correct |
565 ms |
4988 KB |
Output is correct |
72 |
Correct |
563 ms |
1160 KB |
Output is correct |