제출 #785980

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
785980		jamkel	Two Transportations (JOI19_transportations)	C++14	컴파일 에러	0 ms	0 KiB

Azer

#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
typedef long long ll;
int odl=0,nu=0;
int k1=0,k2=0;
vector<int>Answer(vector<int>w)
{
    return w;
}
void InitA(int N, int A, std::vector<int> U, std::vector<int> V, std::vector<int> C)
{
    vector<vector<pair<int,int>>>g(N);
    vector<int>w(N);
    for(int i=0;i<A;i++)
    {
        g[U[i]].push_back({C[i],V[i]});
        g[V[i]].push_back({C[i],U[i]});
    }
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
    for(ll i=0;i<g[0].size();i++)
    {
        q.push({g[0][i].st,g[0][i].nd});
    }
    bool y=false;
    while(q.size()>0)
    {
        if(w[q.top().nd]>0)
        {
            q.pop();
        }
        else
        {
            for(int i=0;i<20;i++)
            {
                if(q.top().st&(1<<i))
                {
                    y=true;
                    void SendA(bool y);
                }
                else
                {
                    y=false;
                    void SendA(bool y);
                }
            }
            for(int i=0;i<11;i++)
            {
                if(q.top().nd&(1<<i))
                {
                    y=true;
                    void SendA(bool y);
                }
                else
                {
                    y=false;
                   void SendA(bool y);
                }
            }
            while(k2<11)
            {
            }
            w[nu]=odl;
            for(ll i=0;i<g[nu].size();i++)
            {
                q.push({g[nu][i].nd+odl,g[nu][i].nd});
            }
            if(nu==q.top().nd)
            {
                q.pop();
            }
            k1=0;k2=0;odl=0;nu=0;
        }
    }
    Answer(w);
}
void ReceiveA(bool x)
{
    if(k1<20)
    {
        if(x)
        {
            odl+=pow(2,k1);
        }
        k1++;
    }
    else
    {
        if(x)
        {
            nu+=pow(2,k2);
        }
        k2++;
    }
}

Baijan

#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
typedef long long ll;
int odl=0,nu=0;
int k1=0,k2=0;
void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D)
{
    vector<vector<pair<int,int>>>g(N);
    vector<int>w(N);
    for(int i=0;i<B;i++)
    {
        g[S[i]].push_back({D[i],T[i]});
        g[T[i]].push_back({D[i],S[i]});
    }
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
    for(ll i=0;i<g[0].size();i++)
    {
        q.push({g[0][i].st,g[0][i].nd});
    }
    bool x=false;
    while(q.size()>0)
    {
        if(w[q.top().nd]>0)
        {
            q.pop();
        }
        else
        {
            while(k2<11)
            {
            }
            if(odl>q.top().st)
            {
                odl=q.top().st;
                nu=q.top().st;
            }
           for(int i=0;i<20;i++)
            {
                if(odl&(1<<i))
                {
                    x=true;
                    void SendB(bool x);
                }
                else
                {
                    x=false;
                    void SendB(bool x);
                }
            }
            for(int i=0;i<11;i++)
            {
                if(nu&(1<<i))
                {
                    x=true;
                    void SendB(bool x);
                }
                else
                {
                    x=false;
                    void SendB(bool x);
                }
            }
            w[nu]=odl;
            for(ll i=0;i<g[nu].size();i++)
            {
                q.push({g[nu][i].nd+odl,g[nu][i].nd});
            }
            if(nu==q.top().nd)
            {
                q.pop();
            }
            k1=0;k2=0;odl=0;nu=0;
        }
    }
}
void ReceiveB(bool x)
{
    if(k1<20)
    {
        if(x)
        {
            odl+=pow(2,k1);
        }
        k1++;
    }
    else
    {
        if(x)
        {
            nu+=pow(2,k2);
        }
        k2++;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

Azer.cpp: In function 'void InitA(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Azer.cpp:22:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(ll i=0;i<g[0].size();i++)
      |                ~^~~~~~~~~~~~
Azer.cpp:65:25: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |             for(ll i=0;i<g[nu].size();i++)
      |                        ~^~~~~~~~~~~~~
Azer.cpp:26:10: warning: variable 'y' set but not used [-Wunused-but-set-variable]
   26 |     bool y=false;
      |          ^
/usr/bin/ld: /tmp/ccaDJGfT.o: in function `main':
grader_azer.cpp:(.text.startup+0x2af): undefined reference to `Answer()'
collect2: error: ld returned 1 exit status

Baijan.cpp: In function 'void InitB(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Baijan.cpp:18:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(ll i=0;i<g[0].size();i++)
      |                ~^~~~~~~~~~~~
Baijan.cpp:66:25: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |             for(ll i=0;i<g[nu].size();i++)
      |                        ~^~~~~~~~~~~~~
Baijan.cpp:22:10: warning: variable 'x' set but not used [-Wunused-but-set-variable]
   22 |     bool x=false;
      |          ^