# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
820028 | Aldas25 | Two Transportations (JOI19_transportations) | C++14 | 3000 ms | 33608 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
const int MAXN = 500100;
const int BITS_IN_DISTANCES = 9;
const int BITS_IN_VERTICES = 11;
const int INF_DISTANCE = (1 << BITS_IN_DISTANCES) - 1;
int d[MAXN];
bool vis[MAXN];
int n;
vector<pair<int, int>> adj[MAXN];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq;
int longestCommonDistance = 0;
pair<int, int> nextShortest;
int distancesKnown = 0;
int distanceReceived = 0;
int vertexReceived = 0;
int receivedBitsCount = 0;
bool gettingDistance = true; // true if receiveA gets bits for distances, false if receiveA gets bits for vertex number
void sendNumber(int number, int bits) {
for (int i = 0; i < bits; i++) {
SendA(number & (1 << i));
}
# | 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... |