제출 #642191

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
642191		cadmiumsky	Two Transportations (JOI19_transportations)	C++14	100 / 100	774 ms	48888 KiB

Azer

#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
 
const int nmax = 2e3 + 5, inf = 1e9 + 5;
using pii = pair<int,int>;
 
 
namespace A {

int numberofstates;

int N;
set<pii> heap;
vector<pii> g[nmax];
int dist[nmax];
vector<int> bits;
int lastdocumented = 0;
int last = 0;
int state = 0;
int theircost = 0, theirnode = 0;
int mynode = 0, mycost = 0;
 
void receiveA(bool x) {
  bits.emplace_back(x);
  if(state == 0 && bits.size() == lastdocumented + 9) {
    int node, cost;
    if(heap.size())
      tie(cost, node) = *heap.begin();
    else
      node = N, cost = 511 + last;
    cost -= last;
    theircost = 0;
    for(int i = lastdocumented; i < bits.size(); i++) theircost = (theircost << 1) | bits[i];
    lastdocumented = bits.size();
    //cerr << "For A: " << node << ' ' << cost << "//" << theircost << '\n';
    if(min(cost, theircost) == 511)
      return;
    //cerr << "arrived here " << lastdocumented << ' ' << theircost << ' ' << cost << ' ' << node << '\n';
    if(theircost < cost) {
      state = 1;
      mycost = theircost;
      return;
    }
    else {
      for(int i = 10; i >= 0; i--) SendA((node & (1 << i)) > 0);
      heap.erase(heap.begin());
      mynode = node;
      mycost = cost;
    }
    state = 2;
  }
  if(state == 1 && lastdocumented + 11 == bits.size()) {
    mynode = 0;
    for(int i = lastdocumented; i < bits.size(); i++)
      mynode = (mynode << 1) | bits[i];
    state = 2;
  }
  if(state == 2) {
    auto [node, cost] = pii{mynode, mycost};
    if(cost == 511)
      return;
    if(heap.count(pii{dist[node], node}))
      heap.erase(heap.find(pii{dist[node], node}));
    dist[node] = cost + last;
    
    numberofstates--;
    if(numberofstates == 0) return;
    //cerr << "A continues with " << node << " + " << dist[node] << '\n';
    //cerr << node << ' ' << cost + last << '\n';
    for(auto [x, c] : g[node]) {
      if(dist[x] > dist[node] + c) {
    if(heap.count(pii{dist[x], x}))
      heap.erase(heap.find(pii{dist[x], x}));
    dist[x] = dist[node] + c;
    heap.emplace(dist[x], x);
      }
    }
    
    last = dist[node];
    if(heap.size())
      tie(cost, node) = *heap.begin();
    else
      node = N, cost = 511 + last;
    //cerr << "A pushes: " << node << ' ' << cost << "/" << last << '\n';
    cost -= last;
    for(int i = 8; i >= 0; i--) SendA((cost & (1 << i)) > 0);
    state = 0;
    lastdocumented = bits.size();
  }
}
 
}  // namespace
 
void ReceiveA(bool x) { A::receiveA(x); }
 
 
void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
	   std::vector<int> C) {
  A::N = A::numberofstates = N;
  for (int i = 0; i < A; ++i) {
    A::g[U[i]].emplace_back(V[i], C[i]);
    A::g[V[i]].emplace_back(U[i], C[i]);
  }
  for(int i = 0; i < N; i++) A::dist[i] = inf;
  A::dist[0] = 0;
  
  A::heap.emplace(0, 0);
  for(int i = 0; i < 9; i++)
    SendA(0);
  return;
}
 
 
std::vector<int> Answer() {
  std::vector<int> ans(A::N);
  for (int k = 0; k < A::N; ++k) {
    ans[k] = A::dist[k];
  }
  return ans;
}

Baijan

#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;
#define nmax sdioh
#define inf sdiohah
const int nmax = 2e3 + 5, inf = 1e9 + 5;
using pii = pair<int,int>;
 
 
namespace B {
 int numberofstates;
int N;
set<pii> heap;
vector<pii> g[nmax];
int dist[nmax];
vector<int> bits;
int lastdocumented = 0;
int last = 0;
int state = 0;
int theircost = 0, theirnode = 0;
int mynode = 0, mycost = 0;
 
void receiveB(bool x) {
  bits.emplace_back(x);
  if(state == 0 && bits.size() == lastdocumented + 9) {
    int node, cost;
    if(heap.size())
      tie(cost, node) = *heap.begin();
    else
      node = N, cost = 511 + last;
    cost -= last;
    theircost = 0;
    for(int i = lastdocumented; i < bits.size(); i++) theircost = (theircost << 1) | bits[i];
    lastdocumented = bits.size();
    cerr << "For B: " << node << ' ' << cost << "//" << theircost << '\n';
    if(min(cost, theircost) == 511)
      return;
    if(theircost <= cost) {
      state = 1;
      mycost = theircost;
      return;
    }
    else {
      for(int i = 10; i >= 0; i--) SendB((node & (1 << i)) > 0);
      heap.erase(heap.begin());
      mynode = node;
      mycost = cost;
    }
    state = 2;
  }
  //else if(state == 1) { cerr << lastdocumented << ' ' << bits.size() << '\n'; }
  if(state == 1 && lastdocumented + 11 == bits.size()) {
    mynode = 0;
    for(int i = lastdocumented; i < bits.size(); i++)
      mynode = (mynode << 1) | bits[i];
    state = 2;
  }
  if(state == 2) {
    auto [node, cost] = pii{mynode, mycost};
    if(cost == 511)
      return;
    if(heap.count(pii{dist[node], node}))
      heap.erase(heap.find(pii{dist[node], node}));
    dist[node] = cost + last;
    numberofstates--;
    if(numberofstates == 0) return;
    //cerr << "B continues with " << node << " + " << dist[node] << '\n';
    for(auto [x, c] : g[node]) {
      if(dist[x] > dist[node] + c) {
    if(heap.count(pii{dist[x], x}))
      heap.erase(heap.find(pii{dist[x], x}));
    dist[x] = dist[node] + c;
    heap.emplace(dist[x], x);
      }
    }
    
    last = dist[node];
    if(heap.size())
      tie(cost, node) = *heap.begin();
    else
      node = N, cost = 511 + last;
    cost -= last;
    for(int i = 8; i >= 0; i--) SendB((cost & (1 << i)) > 0);
    state = 0;
    lastdocumented = bits.size();
  }
}
 
}  // namespace
 
void ReceiveB(bool x) { B::receiveB(x); }
 
 
void InitB(int N, int B, std::vector<int> U, std::vector<int> V,
	   std::vector<int> C) {
  B::N = B::numberofstates = N;
  for (int i = 0; i < B; ++i) {
    B::g[U[i]].emplace_back(V[i], C[i]);
    B::g[V[i]].emplace_back(U[i], C[i]);
  }
  for(int i = 0; i < N; i++) B::dist[i] = inf;
  B::dist[0] = 0;
  
  B::heap.emplace(0, 0);
  for(int i = 0; i < 9; i++)
    SendB(0);
  return;
}

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

Azer.cpp: In function 'void A::receiveA(bool)':
Azer.cpp:26:32: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |   if(state == 0 && bits.size() == lastdocumented + 9) {
      |                    ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
Azer.cpp:34:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i = lastdocumented; i < bits.size(); i++) theircost = (theircost << 1) | bits[i];
      |                                 ~~^~~~~~~~~~~~~
Azer.cpp:53:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   if(state == 1 && lastdocumented + 11 == bits.size()) {
      |                    ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
Azer.cpp:55:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for(int i = lastdocumented; i < bits.size(); i++)
      |                                 ~~^~~~~~~~~~~~~
Azer.cpp:60:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   60 |     auto [node, cost] = pii{mynode, mycost};
      |          ^
Azer.cpp:71:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   71 |     for(auto [x, c] : g[node]) {
      |              ^

Baijan.cpp: In function 'void B::receiveB(bool)':
Baijan.cpp:25:32: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |   if(state == 0 && bits.size() == lastdocumented + 9) {
      |                    ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
Baijan.cpp:33:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = lastdocumented; i < bits.size(); i++) theircost = (theircost << 1) | bits[i];
      |                                 ~~^~~~~~~~~~~~~
Baijan.cpp:52:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   if(state == 1 && lastdocumented + 11 == bits.size()) {
      |                    ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
Baijan.cpp:54:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i = lastdocumented; i < bits.size(); i++)
      |                                 ~~^~~~~~~~~~~~~
Baijan.cpp:59:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   59 |     auto [node, cost] = pii{mynode, mycost};
      |          ^
Baijan.cpp:68:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   68 |     for(auto [x, c] : g[node]) {
      |              ^

• Subtask 1: 6 / 6
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 38 / 38
• Subtask 5: 14 / 14
• Subtask 6: 10 / 10
• Subtask 7: 16 / 16