#include "Azer.h"
#include <vector>
#include <queue>
#include <cstdlib>
#include <cstdio>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef vector < int > vi;
typedef pair < int, int > pii;
namespace {
const int N = 2005;
int n;
vector < pii > v[N];
int dis[N], mks, bio[N];
int sto = 0, kolko = 0, jos = 0, ret = 0, brj2, cnt = 0, tko = 0;
pii tmp; int cv, brj;
void obradi(int x){
mks = max(mks, dis[x]);
bio[x] = 1; // printf("A: obradujem %d\n", x);
for(pii nxt : v[x]){
if(dis[nxt.X] == -1 || dis[x] + nxt.Y < dis[nxt.X])
dis[nxt.X] = dis[x] + nxt.Y;
}
}
pii nadi_najblizeg(){
int bst = 0, dod = 0;
for(int i = 0;i < n;i++){
if(bio[i] || dis[i] == -1) continue;
if(!bst || dis[i] < dod)
bst = i, dod = dis[i];
}
tko = !!((cnt * (mks + n)) & 8);
return {bst, dod - mks};
}
void posalji_broj(int x, int ln){
//printf("A: saljem %d u %d\n", x, ln);
for(int i = ln - 1;i >= 0;i--)
SendA(!!(x & (1 << i)));
}
void korak(){
tmp = nadi_najblizeg();
//printf("A: radim korak tko = %d\n", tko);
cv = tmp.X, brj = tmp.Y;
// printf("A : cv = %d brj = %d\n", cv, brj);
if(tko){
sto = 1; jos = 1; ret = 0;
posalji_broj(brj, 9);
}
else{
sto = 4; jos = 9; ret = 0;
}
}
}
void InitA(int n, int a, vi U, vi V, vi C) {
::n = n;
for(int i = 0;i < a;i++){
v[U[i]].PB({V[i], C[i]});
v[V[i]].PB({U[i], C[i]});
}
for(int i = 0; i < n;i++)
dis[i] = -1;
dis[0] = 0; cnt++; obradi(0);
if(n != 1)
SendA(0);
Answer();
}
void ReceiveA(bool x) {
if(sto == 0) {
korak(); return;
}
ret = 2 * ret + x; jos--;
//printf("B: jos = %d ret = %d sto = %d\n", jos, ret, sto);
if(jos != 0) return;
if(sto == 1){
if(ret){
//printf("tu sam\n");
jos = 9;
sto = 2;
ret = 0;
}
else{
posalji_broj(cv, 11);
dis[cv] = mks + brj;
obradi(cv);
if((++cnt) != n)
korak();
}
}
else if(sto == 2){
brj = ret; ret = 0;
jos = 11;
sto = 3;
}
else if(sto == 3){
cv = ret; ret = 0;
dis[cv] = mks + brj;
obradi(cv);
if((++cnt) != n)
korak();
}
else if(sto == 4){
brj2 = ret; ret = 0;
if(brj2 <= brj){
brj = brj2;
sto = 5; jos = 11; ret = 0;
posalji_broj(0, 1);
}
else{
posalji_broj(1, 1);
posalji_broj(brj, 9);
posalji_broj(cv, 11);
dis[cv] = mks + brj;
obradi(cv);
if((++cnt) != n)
korak();
}
}
else if(sto == 5){
cv = ret; ret = 0;
dis[cv] = mks + brj;
obradi(cv);
if((++cnt) != n)
korak();
}
}
vi Answer() {
vi ans(n);
for (int k = 0; k < n; ++k) {
ans[k] = dis[k];
}
return ans;
}
#include "Baijan.h"
#include <vector>
#include <queue>
#include <cstdlib>
#include <cstdio>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef vector < int > vi;
typedef pair < int, int > pii;
namespace {
const int N = 2005;
int n;
vector < pii > v[N];
int dis[N], mks, bio[N];
int sto = 0, kolko = 0, jos = 0, ret = 0, brj2, cnt = 0, tko = 0;
pii tmp; int cv, brj;
void obradi(int x){
mks = max(mks, dis[x]);
bio[x] = 1; //printf("B: obradujem %d\n", x);
for(pii nxt : v[x]){
if(dis[nxt.X] == -1 || dis[x] + nxt.Y < dis[nxt.X])
dis[nxt.X] = dis[x] + nxt.Y;
}
}
pii nadi_najblizeg(){
int bst = 0, dod = 0;
for(int i = 0;i < n;i++){
if(bio[i] || dis[i] == -1)
continue;
if(!bst || dis[i] < dod)
bst = i, dod = dis[i];
}
tko = !((cnt * (mks + n)) & 8);
return {bst, dod - mks};
}
void posalji_broj(int x, int ln){
//printf("B: saljem %d u %d\n", x, ln);
for(int i = ln - 1;i >= 0;i--)
SendB(!!(x & (1 << i)));
}
void korak(){
tmp = nadi_najblizeg();
//printf("B: radim korak tko = %d\n", tko);
cv = tmp.X, brj = tmp.Y;
//printf("B : cv = %d brj = %d\n", cv, brj);
if(tko){
sto = 1; jos = 1; ret = 0;
posalji_broj(brj, 9);
}
else{
sto = 4; jos = 9; ret = 0;
}
}
}
void InitB(int n, int a, vi U, vi V, vi C) {
::n = n;
for(int i = 0;i < a;i++){
v[U[i]].PB({V[i], C[i]});
v[V[i]].PB({U[i], C[i]});
}
for(int i = 0; i < n;i++)
dis[i] = -1;
dis[0] = 0; cnt++; obradi(0);
if(n != 1)
SendB(0);
}
void ReceiveB(bool x) {
if(sto == 0) {
korak(); return;
}
ret = 2 * ret + x; jos--;
//printf("B: jos = %d ret = %d sto = %d\n", jos, ret, sto);
if(jos != 0) return;
if(sto == 1){
if(ret){
//printf("tu sam\n");
jos = 9;
sto = 2;
ret = 0;
}
else{
posalji_broj(cv, 11);
dis[cv] = mks + brj;
obradi(cv);
if((++cnt) != n)
korak();
}
}
else if(sto == 2){
brj = ret; ret = 0;
jos = 11;
sto = 3;
}
else if(sto == 3){
cv = ret; ret = 0;
dis[cv] = mks + brj;
obradi(cv);
if((++cnt) != n)
korak();
}
else if(sto == 4){
brj2 = ret; ret = 0;
if(brj2 <= brj){
brj = brj2;
sto = 5; jos = 11; ret = 0;
posalji_broj(0, 1);
}
else{
posalji_broj(1, 1);
posalji_broj(brj, 9);
posalji_broj(cv, 11);
dis[cv] = mks + brj;
obradi(cv);
if((++cnt) != n)
korak();
}
}
else if(sto == 5){
cv = ret; ret = 0;
dis[cv] = mks + brj;
obradi(cv);
if((++cnt) != n)
korak();
}
}
Compilation message
Azer.cpp:23:14: warning: '{anonymous}::kolko' defined but not used [-Wunused-variable]
23 | int sto = 0, kolko = 0, jos = 0, ret = 0, brj2, cnt = 0, tko = 0;
| ^~~~~
Baijan.cpp:23:14: warning: '{anonymous}::kolko' defined but not used [-Wunused-variable]
23 | int sto = 0, kolko = 0, jos = 0, ret = 0, brj2, cnt = 0, tko = 0;
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
449 ms |
768 KB |
Wrong Answer [2] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1296 KB |
Output is correct |
| 2 |
Incorrect |
471 ms |
768 KB |
Wrong Answer [2] |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
882 ms |
1616 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
382 ms |
1536 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
382 ms |
1536 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
382 ms |
1536 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
449 ms |
768 KB |
Wrong Answer [2] |
| 2 |
Halted |
0 ms |
0 KB |
- |
