이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include<Azer.h>
using namespace std;
vector<int> answer,akliczby;
int p,akwaga=1,akbit=-1,rec;
vector<bool>tym;
set<pair<int,pair<int,int>>>krawedzie;
void InitA(int N, int A, vector<int>U,vector<int>V,vector<int>C ){
for(int i=0;i<N;i++){
answer.push_back(9999999);
}
answer[0]=0;
for(int i=0;i<A;i++){
krawedzie.insert({C[i],{U[i],V[i]}});
}
while((int)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(int 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;
}
#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){
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |