#include "Azer.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
namespace {
const int LIM=2e3+7, INF=1e9+7;
vector<pair<int,int>>V[LIM];
int odl[LIM];
int n, lst=0;
int akt=0, li=0, stan=0;
int moje, jego;
priority_queue<pair<int,int>>q;
void wyslij(int x) {
rep(i, 9) if(x&(1<<i)) SendA(1); else SendA(0);
}
void wyslij2(int x) {
rep(i, 11) if(x&(1<<i)) SendA(1); else SendA(0);
}
void wysylam_odl() {
while(!q.empty() && odl[q.top().nd]<INF) q.pop();
if(!q.empty()) {
moje=-q.top().st-lst;
wyslij(moje);
} else {
moje=511;
wyslij(moje);
}
}
void wrzuc(int dys, int wierz) {
dys+=lst;
lst=dys;
odl[wierz]=dys;
for(auto i : V[wierz]) q.push({-odl[wierz]-i.nd, i.st});
}
}
void InitA(int _N, int _A, vector<int>A, vector<int>B, vector<int>C) {
n=_N;
rep(i, _A) {
V[A[i]].pb({B[i], C[i]});
V[B[i]].pb({A[i], C[i]});
}
rep(i, n) odl[i]=INF;
q.push({0, 0});
wysylam_odl();
}
void ReceiveA(bool x) {
if(x) li+=1<<akt;
++akt;
if(stan==0 && akt==9) {
if(li==511) return;
if(li<moje) {
jego=li;
akt=li=0;
stan=1;
} else {
int dys=-q.top().st, wierz=q.top().nd; q.pop();
wyslij2(wierz);
wrzuc(dys-lst, wierz);
akt=li=0;
stan=2;
}
} else if(stan==1 && akt==11) {
wrzuc(jego, li);
akt=li=0;
wysylam_odl();
stan=0;
} else if(stan==2 && akt==9) {
jego=li;
while(!q.empty() && odl[q.top().nd]<INF) q.pop();
if(q.empty()) {
wyslij(li);
stan=1;
akt=li=0;
return;
}
int dys=-q.top().st, wierz=q.top().nd;
if(dys-lst<li) {
wyslij(dys-lst);
wyslij2(wierz);
q.pop();
wrzuc(dys-lst, wierz);
stan=2;
} else {
wyslij(li);
stan=1;
}
akt=li=0;
}
}
vector<int> Answer() {
vector<int> ans(n);
rep(i, n) ans[i]=odl[i];
return ans;
}
#include "Baijan.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
namespace {
const int LIM=2e3+7, INF=1e9+7;
vector<pair<int,int>>V[LIM];
int odl[LIM];
int n, lst=0;
int akt=0, li=0, stan=0;
int moje, jego;
priority_queue<pair<int,int>>q;
void wyslij(int x) {
rep(i, 9) if(x&(1<<i)) SendB(1); else SendB(0);
}
void wyslij2(int x) {
rep(i, 11) if(x&(1<<i)) SendB(1); else SendB(0);
}
void wysylam_odl() {
while(!q.empty() && odl[q.top().nd]<INF) q.pop();
if(!q.empty()) {
moje=-q.top().st-lst;
wyslij(moje);
} else {
moje=511;
wyslij(moje);
}
}
void wrzuc(int dys, int wierz) {
dys+=lst;
lst=dys;
odl[wierz]=dys;
for(auto i : V[wierz]) q.push({-odl[wierz]-i.nd, i.st});
}
}
void InitB(int _N, int _A, vector<int>A, vector<int>B, vector<int>C) {
n=_N;
rep(i, _A) {
V[A[i]].pb({B[i], C[i]});
V[B[i]].pb({A[i], C[i]});
}
rep(i, n) odl[i]=INF;
q.push({0, 0});
stan=2;
}
void ReceiveB(bool x) {
if(x) li+=1<<akt;
++akt;
if(stan==0 && akt==9) {
if(li==511) return;
if(li<moje) {
jego=li;
akt=li=0;
stan=1;
} else {
int dys=-q.top().st, wierz=q.top().nd; q.pop();
wyslij2(wierz);
wrzuc(dys-lst, wierz);
akt=li=0;
stan=2;
}
} else if(stan==1 && akt==11) {
wrzuc(jego, li);
akt=li=0;
wysylam_odl();
stan=0;
} else if(stan==2 && akt==9) {
jego=li;
while(!q.empty() && odl[q.top().nd]<INF) q.pop();
if(q.empty()) {
wyslij(li);
stan=1;
akt=li=0;
return;
}
int dys=-q.top().st, wierz=q.top().nd;
if(dys-lst<li) {
wyslij(dys-lst);
wyslij2(wierz);
q.pop();
wrzuc(dys-lst, wierz);
stan=2;
} else {
wyslij(li);
stan=1;
}
akt=li=0;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
234 ms |
328 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
656 KB |
Output is correct |
2 |
Runtime error |
232 ms |
424 KB |
Execution killed with signal 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
199 ms |
400 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
180 ms |
656 KB |
Output is correct |
2 |
Correct |
213 ms |
660 KB |
Output is correct |
3 |
Correct |
315 ms |
13300 KB |
Output is correct |
4 |
Correct |
186 ms |
712 KB |
Output is correct |
5 |
Correct |
269 ms |
10124 KB |
Output is correct |
6 |
Correct |
147 ms |
700 KB |
Output is correct |
7 |
Correct |
202 ms |
656 KB |
Output is correct |
8 |
Correct |
161 ms |
656 KB |
Output is correct |
9 |
Correct |
375 ms |
23688 KB |
Output is correct |
10 |
Correct |
388 ms |
23796 KB |
Output is correct |
11 |
Correct |
629 ms |
46704 KB |
Output is correct |
12 |
Correct |
521 ms |
44092 KB |
Output is correct |
13 |
Correct |
223 ms |
852 KB |
Output is correct |
14 |
Correct |
2 ms |
712 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
180 ms |
656 KB |
Output is correct |
2 |
Correct |
213 ms |
660 KB |
Output is correct |
3 |
Correct |
315 ms |
13300 KB |
Output is correct |
4 |
Correct |
186 ms |
712 KB |
Output is correct |
5 |
Correct |
269 ms |
10124 KB |
Output is correct |
6 |
Correct |
147 ms |
700 KB |
Output is correct |
7 |
Correct |
202 ms |
656 KB |
Output is correct |
8 |
Correct |
161 ms |
656 KB |
Output is correct |
9 |
Correct |
375 ms |
23688 KB |
Output is correct |
10 |
Correct |
388 ms |
23796 KB |
Output is correct |
11 |
Correct |
629 ms |
46704 KB |
Output is correct |
12 |
Correct |
521 ms |
44092 KB |
Output is correct |
13 |
Correct |
223 ms |
852 KB |
Output is correct |
14 |
Correct |
2 ms |
712 KB |
Output is correct |
15 |
Correct |
228 ms |
696 KB |
Output is correct |
16 |
Correct |
252 ms |
656 KB |
Output is correct |
17 |
Correct |
190 ms |
656 KB |
Output is correct |
18 |
Correct |
331 ms |
10048 KB |
Output is correct |
19 |
Correct |
242 ms |
716 KB |
Output is correct |
20 |
Correct |
358 ms |
10280 KB |
Output is correct |
21 |
Correct |
229 ms |
656 KB |
Output is correct |
22 |
Correct |
195 ms |
740 KB |
Output is correct |
23 |
Correct |
515 ms |
26632 KB |
Output is correct |
24 |
Correct |
457 ms |
26644 KB |
Output is correct |
25 |
Correct |
806 ms |
52472 KB |
Output is correct |
26 |
Correct |
612 ms |
48696 KB |
Output is correct |
27 |
Correct |
226 ms |
884 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
180 ms |
656 KB |
Output is correct |
2 |
Correct |
213 ms |
660 KB |
Output is correct |
3 |
Correct |
315 ms |
13300 KB |
Output is correct |
4 |
Correct |
186 ms |
712 KB |
Output is correct |
5 |
Correct |
269 ms |
10124 KB |
Output is correct |
6 |
Correct |
147 ms |
700 KB |
Output is correct |
7 |
Correct |
202 ms |
656 KB |
Output is correct |
8 |
Correct |
161 ms |
656 KB |
Output is correct |
9 |
Correct |
375 ms |
23688 KB |
Output is correct |
10 |
Correct |
388 ms |
23796 KB |
Output is correct |
11 |
Correct |
629 ms |
46704 KB |
Output is correct |
12 |
Correct |
521 ms |
44092 KB |
Output is correct |
13 |
Correct |
223 ms |
852 KB |
Output is correct |
14 |
Correct |
2 ms |
712 KB |
Output is correct |
15 |
Correct |
228 ms |
696 KB |
Output is correct |
16 |
Correct |
252 ms |
656 KB |
Output is correct |
17 |
Correct |
190 ms |
656 KB |
Output is correct |
18 |
Correct |
331 ms |
10048 KB |
Output is correct |
19 |
Correct |
242 ms |
716 KB |
Output is correct |
20 |
Correct |
358 ms |
10280 KB |
Output is correct |
21 |
Correct |
229 ms |
656 KB |
Output is correct |
22 |
Correct |
195 ms |
740 KB |
Output is correct |
23 |
Correct |
515 ms |
26632 KB |
Output is correct |
24 |
Correct |
457 ms |
26644 KB |
Output is correct |
25 |
Correct |
806 ms |
52472 KB |
Output is correct |
26 |
Correct |
612 ms |
48696 KB |
Output is correct |
27 |
Correct |
226 ms |
884 KB |
Output is correct |
28 |
Correct |
290 ms |
712 KB |
Output is correct |
29 |
Correct |
338 ms |
656 KB |
Output is correct |
30 |
Correct |
534 ms |
23940 KB |
Output is correct |
31 |
Correct |
184 ms |
656 KB |
Output is correct |
32 |
Correct |
501 ms |
21060 KB |
Output is correct |
33 |
Correct |
251 ms |
728 KB |
Output is correct |
34 |
Correct |
283 ms |
760 KB |
Output is correct |
35 |
Correct |
354 ms |
784 KB |
Output is correct |
36 |
Correct |
549 ms |
29072 KB |
Output is correct |
37 |
Correct |
554 ms |
29180 KB |
Output is correct |
38 |
Correct |
891 ms |
57756 KB |
Output is correct |
39 |
Correct |
670 ms |
55512 KB |
Output is correct |
40 |
Correct |
273 ms |
1096 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
234 ms |
328 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |