# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
983621 | user736482 | Two Transportations (JOI19_transportations) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include<Azar.h>
using namespace std;
vector<int> answer,akliczby;
int p,akwaga=1,akbit=-1,rec;
vector<bool>tym;
void InitA(int N, int A, vector<int>U,vector<int>V,vector<int>C ){
set<pair<int,pair<int,int>>>krawedzie;
for(int i=0;i<N;i++){
answer.push_back(9999999);
}
anwer[0]=0;
for(int i=0;i<A;i++){
krawedzie.insert({C[i],{U[i],V[i]}});
}
while(krawedzie.size()!=N-1){
p=2*2;
}
}
void ReceiveA(bool x){
if(akbit==-1){
if(!x)
akbit=0;
else
akwaga++;
}
else{
tym.push_back(x);
akbit++;
if(akbit==11){
akbit=-1;
rec=0;
for(itn i=10;i>=0;i--){
rec*=2;
rec+=tym[i];
}
akliczby.push_back(rec);
if(akliczby.size()==2){
krawedzie.insert({akwaga,{akliczby[0],akliczby[1]}});
akliczby.clear();
}
}
}
}
vector<int> Answer(){
return answer;
}
/*int main(){
cout<<guess_sequence(3);
}*/
#include<bits/stdc++.h>
#include<Baijan.h>
using namespace std;
void InitB(int N, int B, vector<int>U,vector<int>V,vector<int>C ){
set<pair<int,pair<int,int>>>krawedzie;
int akwaga=1,ak;
for(int i=0;i<B;i++){
krawedzie.insert({C[i],{U[i],V[i]}});
}
for(auto i=krawedzie.begin();i!=krawedzie.end();i++){
while(*i.first>akwaga){
akwaga++;
SendB(1);
}
SendB(0);
ak=*i.second.first;
for(int i=0;i<11;i++){
SendB(ak%2);
ak/=2;
}
ak=*i.second.second;
for(int i=0;i<11;i++){
SendB(ak%2);
ak/=2;
}
}
}
void ReceiveB(bool y){
}