#include <bits/stdc++.h>
#include "Azer.h"
#include <vector>
using namespace std;
typedef pair <int, int> pii;
vector <bool> R;
int n, m, s;
void ReceiveA(bool x)
{
R.emplace_back(x);
}
int receive(int &v, int x)
{
int i;
v = 0;
for(i=0; i<x; i++){
v |= R[s] << i;
s ++;
}
}
void InitA(int _N, int A, vector <int> U, vector <int> V, vector<int> C)
{
n = _N;
}
vector <int> Answer()
{
vector <int> A(n);
int i;
for(i=0; i<n; i++){
receive(A[i], 30);
}
return A;
}
#include <bits/stdc++.h>
#include "Baijan.h"
using namespace std;
typedef pair <int, int> pii;
priority_queue <pii> Q;
vector <pii> G[2020];
bool chk[2020];
void send(int v, int x)
{
int i;
for(i=0; i<x; i++){
if(v & (1 << i)) SendB(1);
else SendB(0);
}
}
void InitB(int N, int B, vector <int> S, vector<int> T, vector<int> D)
{
vector <int> A(N);
int i, p, d;
for(i=0; i<B; i++){
G[S[i]].emplace_back(T[i], D[i]);
G[T[i]].emplace_back(S[i], D[i]);
}
Q.push(pii(0, 0));
for(; !Q.empty(); ){
tie(d, p) = Q.top(); Q.pop();
if(chk[p]) continue;
A[p] = -d; chk[p] = 1;
for(pii &t: G[p]){
if(!chk[t.first]){
Q.push(pii(d - t.second, t.first));
}
}
}
for(i=0; i<N; i++){
send(A[i], 30);
}
}
void ReceiveB(bool y) {}
Compilation message
Azer.cpp: In function 'int receive(int&, int)':
Azer.cpp:28:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
688 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
1248 KB |
Output is correct |
2 |
Incorrect |
10 ms |
848 KB |
Wrong Answer [2] |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
624 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
346 ms |
1256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
346 ms |
1256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
346 ms |
1256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
688 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |