#include <bits/stdc++.h>
#include "Azer.h"
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
static int N, M;
static vector<pii> adj[2020];
static vector<int> ans;
static int cnt, Bu, Bv, Bw;
static bool chk[2020];
static priority_queue<pii, vector<pii>, greater<pii>> PQ;
void InitA(int n, int A, vector<int> U, vector<int> V, vector<int> C){
N = n, M = A;
ans.resize(N);
for (int i=0; i<M; i++){
adj[U[i]].push_back(pii(V[i], C[i]));
adj[V[i]].push_back(pii(U[i], C[i]));
}
}
void ReceiveA(bool x){
if (x){
if (cnt < 11) Bu |= (1 << cnt);
else if (cnt < 22) Bv |= (1 << (cnt-11));
else Bw |= (1 << (cnt-22));
}
cnt++;
if (cnt >= 31){
cnt = 0;
adj[Bu].push_back(pii(Bv, Bw));
adj[Bv].push_back(pii(Bu, Bw));
Bu = Bv = Bw = 0;
}
}
vector<int> Answer() {
ans.resize(N);
PQ.push(pii(0, 0));
while (!PQ.empty()){
pii T = PQ.top();
PQ.pop();
if (chk[T.second]) continue;
chk[T.second] = true;
ans[T.second] = T.first;
for (pii v : adj[T.second]) PQ.push(pii(v.second+T.first, v.first));
}
return ans;
}
#include <bits/stdc++.h>
#include "Baijan.h"
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
static int N, M;
void InitB(int n, int B, vector<int> U, vector<int> V, vector<int> C) {
N = n, M = B;
for (int i=0; i<M; i++) {
for (int j=0; j<11; j++) SendB(U[i] & (1<<j));
for (int j=0; j<11; j++) SendB(V[i] & (1<<j));
for (int j=0; j<9; j++) SendB(C[i] & (1<<j));
}
}
void ReceiveB(bool y){
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
11 ms |
768 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
952 KB |
Output is correct |
2 |
Correct |
460 ms |
1504 KB |
Output is correct |
3 |
Correct |
284 ms |
1512 KB |
Output is correct |
4 |
Correct |
1122 ms |
54856 KB |
Output is correct |
5 |
Correct |
765 ms |
56424 KB |
Output is correct |
6 |
Correct |
506 ms |
1280 KB |
Output is correct |
7 |
Correct |
1301 ms |
53084 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
378 ms |
2080 KB |
Output is correct |
2 |
Correct |
6 ms |
1248 KB |
Output is correct |
3 |
Incorrect |
11 ms |
760 KB |
Wrong Answer [2] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
152 ms |
1192 KB |
Output is correct |
2 |
Correct |
452 ms |
1296 KB |
Output is correct |
3 |
Incorrect |
138 ms |
8500 KB |
Wrong Answer [2] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
152 ms |
1192 KB |
Output is correct |
2 |
Correct |
452 ms |
1296 KB |
Output is correct |
3 |
Incorrect |
138 ms |
8500 KB |
Wrong Answer [2] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
152 ms |
1192 KB |
Output is correct |
2 |
Correct |
452 ms |
1296 KB |
Output is correct |
3 |
Incorrect |
138 ms |
8500 KB |
Wrong Answer [2] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
11 ms |
768 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |