#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
int n,m;
typedef pair<int,int> P;
vector<P> adj[2000];
bool vis[2000];
int dist[2000];
int variable_example[500000];
int cnt=0;
int ret[2000];
int s[2000];
int t[2000];
int d[2000];
} // namespace
void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
std::vector<int> C) {
n=N;
m=U.size();
for(int i=0;i<m;i++) {
adj[U[i]].push_back(P(V[i],C[i]));
adj[V[i]].push_back(P(U[i],C[i]));
}
if (n-1-m>1000) {
for(int i=0;i<m;i++) {
for(int j=0;j<11;j++) {
if (U[i]&(1<<j)) {
SendA(true);
}
else {
SendA(false);
}
}
for(int j=0;j<11;j++) {
if (V[i]&(1<<j)) {
SendA(true);
}
else {
SendA(false);
}
}
for(int j=0;j<9;j++) {
if (C[i]&(1<<j)) {
SendA(true);
}
else {
SendA(false);
}
}
}
}
}
void ReceiveA(bool x) {
if (n-1-m>1000) {
ret[cnt/20]+=(x<<(cnt%20));
cnt++;
return;
}
int now=cnt%31;
if (now<11) {
s[cnt/31]+=(x<<now);
}
else if (now<22){
now-=11;
t[cnt/31]+=(x<<now);
}
else {
now-=22;
d[cnt/31]+=(x<<now);
}
cnt++;
}
std::vector<int> Answer() {
if (n-1-m>1000) {
std::vector<int> ans(n);
for (int k = 0; k < n; ++k) {
ans[k] = ret[k];
}
return ans;
}
for(int i=0;i<cnt/31;i++) {
adj[s[i]].push_back(P(t[i],d[i]));
adj[t[i]].push_back(P(s[i],d[i]));
}
for(int i=0;i<n;i++){
dist[i]=1e7;
}
priority_queue<P,vector<P>,greater<P>> pq;
pq.push(P(0,0));
dist[0]=0;
memset(vis,0,sizeof(vis));
while (!pq.empty()) {
int now=pq.top().second;
pq.pop();
if (vis[now]) {
continue;
}
vis[now]=true;
for(int i=0;i<adj[now].size();i++) {
int nt=adj[now][i].first;
if (dist[nt]>dist[now]+adj[now][i].second) {
dist[nt]=dist[now]+adj[now][i].second;
pq.push(P(dist[nt],nt));
}
}
}
std::vector<int> ans(n);
for (int k = 0; k < n; ++k) {
ans[k] = dist[k];
}
return ans;
}
#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
int n,m;
int cnt=0;
bool FunctionExample(bool P) {
return !P;
}
typedef pair<int,int> P;
vector<P> adj[2000];
bool vis[2000];
int dist[2000];
int s[2000];
int t[2000];
int d[2000];
} // namespace
void InitB(int N, int B, std::vector<int> S, std::vector<int> T,
std::vector<int> D) {
n=N;
m=S.size();
for(int i=0;i<m;i++) {
adj[S[i]].push_back(P(T[i],D[i]));
adj[T[i]].push_back(P(S[i],D[i]));
}
if (m<=1000) {
for(int i=0;i<m;i++) {
for(int j=0;j<11;j++) {
if (S[i]&(1<<j)) {
SendB(true);
}
else {
SendB(false);
}
}
for(int j=0;j<11;j++) {
if (T[i]&(1<<j)) {
SendB(true);
}
else {
SendB(false);
}
}
for(int j=0;j<9;j++) {
if (D[i]&(1<<j)) {
SendB(true);
}
else {
SendB(false);
}
}
}
return;
}
}
void ReceiveB(bool y) {
int now=cnt%31;
if (now<11) {
s[cnt/31]+=(y<<now);
}
else if (now<22){
now-=11;
t[cnt/31]+=(y<<now);
}
else {
now-=22;
d[cnt/31]+=(y<<now);
}
cnt++;
if (cnt/31==n-1-m) {
for(int i=0;i<cnt/31;i++) {
adj[s[i]].push_back(P(t[i],d[i]));
adj[t[i]].push_back(P(s[i],d[i]));
}
for(int i=0;i<n;i++){
dist[i]=1e7;
}
priority_queue<P,vector<P>,greater<P>> pq;
pq.push(P(0,0));
dist[0]=0;
memset(vis,0,sizeof(vis));
while (!pq.empty()) {
int now=pq.top().second;
pq.pop();
if (vis[now]) {
continue;
}
vis[now]=true;
for(int i=0;i<adj[now].size();i++) {
int nt=adj[now][i].first;
if (dist[nt]>dist[now]+adj[now][i].second) {
dist[nt]=dist[now]+adj[now][i].second;
pq.push(P(dist[nt],nt));
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<20;j++) {
if (dist[i]&(1<<j)) {
SendB(true);
}
else {
SendB(false);
}
}
}
}
}
Compilation message
Azer.cpp: In function 'std::vector<int> Answer()':
Azer.cpp:106:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
106 | for(int i=0;i<adj[now].size();i++) {
| ~^~~~~~~~~~~~~~~~
Azer.cpp: At global scope:
Azer.cpp:12:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
12 | int variable_example[500000];
| ^~~~~~~~~~~~~~~~
Baijan.cpp: In function 'void ReceiveB(bool)':
Baijan.cpp:94:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
94 | for(int i=0;i<adj[now].size();i++) {
| ~^~~~~~~~~~~~~~~~
Baijan.cpp: At global scope:
Baijan.cpp:10:6: warning: 'bool {anonymous}::FunctionExample(bool)' defined but not used [-Wunused-function]
10 | bool FunctionExample(bool P) {
| ^~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
784 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
656 KB |
Output is correct |
2 |
Correct |
261 ms |
888 KB |
Output is correct |
3 |
Correct |
227 ms |
976 KB |
Output is correct |
4 |
Correct |
310 ms |
27524 KB |
Output is correct |
5 |
Correct |
170 ms |
24072 KB |
Output is correct |
6 |
Correct |
324 ms |
812 KB |
Output is correct |
7 |
Correct |
439 ms |
24308 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
270 ms |
900 KB |
Output is correct |
2 |
Correct |
1 ms |
656 KB |
Output is correct |
3 |
Incorrect |
2 ms |
656 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
128 ms |
692 KB |
Output is correct |
2 |
Correct |
187 ms |
696 KB |
Output is correct |
3 |
Correct |
82 ms |
13184 KB |
Output is correct |
4 |
Correct |
279 ms |
860 KB |
Output is correct |
5 |
Incorrect |
57 ms |
10092 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
128 ms |
692 KB |
Output is correct |
2 |
Correct |
187 ms |
696 KB |
Output is correct |
3 |
Correct |
82 ms |
13184 KB |
Output is correct |
4 |
Correct |
279 ms |
860 KB |
Output is correct |
5 |
Incorrect |
57 ms |
10092 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
128 ms |
692 KB |
Output is correct |
2 |
Correct |
187 ms |
696 KB |
Output is correct |
3 |
Correct |
82 ms |
13184 KB |
Output is correct |
4 |
Correct |
279 ms |
860 KB |
Output is correct |
5 |
Incorrect |
57 ms |
10092 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
784 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |