oj.uz

답안 #983826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983826 2024-05-16T07:02:28 Z user736482 Two Transportations (JOI19_transportations) C++17
0 / 100
 216 ms 2128 KB 
#include <bits/stdc++.h>
#include<Azer.h>
using namespace std;
vector<int> answer,akliczby;
int akwaga=1,akbit=-1,rec,ileod,n;
vector<bool>tym;
set<pair<int,pair<int,int>>>krawedzie;
bool odwiedzone[2000];
pair<int,int>akkrawedz;
vector<pair<int,int>> sasiedzi[2000];
priority_queue<pair<int,int>>pq;
void InitA(int N, int A, vector<int>U,vector<int>V,vector<int>C ){
    odwiedzone[0]=1;
    n=N;
    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]}});
    }
    
}
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();
            }
        }
    }
    if((int)krawedzie.size()==n-1){
        for(auto i=krawedzie.begin();i!=krawedzie.end();i++){
            sasiedzi[(*i).second.first].push_back({(*i).second.second,(*i).first});
            sasiedzi[(*i).second.second].push_back({(*i).second.first,(*i).first});
        }
        for(int i=0;i<(int)sasiedzi[0].size();i++){
            pq.push(sasiedzi[0][i]);
        }
        ileod=1;
        while(ileod!=n){
            akkrawedz=pq.top();
            pq.pop();
            if(!odwiedzone[akkrawedz.second]){
                ileod++;
                odwiedzone[akkrawedz.second]=1;
                answer[akkrawedz.second]=akkrawedz.first;
                for(int i=0;i<(int)sasiedzi[akkrawedz.second].size();i++){
                    pq.push({sasiedzi[akkrawedz.second][i].first+akkrawedz.first,sasiedzi[akkrawedz.second][i].second});
                }
            }
        }
    }
}
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){
    
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 216 ms 2128 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 664 KB Output is correct
2 Incorrect 94 ms 1412 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 105 ms 1148 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 53 ms 1088 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 53 ms 1088 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 53 ms 1088 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 216 ms 2128 KB Output isn't correct
2 Halted 0 ms 0 KB -