제출 #754125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
754125		AdamGS	Two Transportations (JOI19_transportations)	C++17	6 / 100	448 ms	10368 KiB

Azer

#include "Azer.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<int>wynik;
int akt=0, ile=0;
void InitA(int N, int A, vector<int>U, vector<int>V, vector<int>C) {
}
void ReceiveA(bool x) {
		if(x) akt+=1<<(ile%20);
		++ile;
		if(ile%20==0) {
			wynik.pb(akt);
			akt=0;
		}
}
vector<int>Answer() {
	return wynik;
}

Baijan

#include "Baijan.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e3+7, INF=1e9+7;
vector<pair<int,int>>V[LIM];
int odl[LIM];
void wyslij(int x) {
	rep(i, 20) if(x&(1<<i)) SendB(1); else SendB(0);
}
void InitB(int N, int B, vector<int>S, vector<int>T, vector<int>D) {
	rep(i, B) {
		V[S[i]].pb({T[i], D[i]});
		V[T[i]].pb({S[i], D[i]});
	}
	rep(i, N) odl[i]=INF;
	priority_queue<pair<int,int>>q;
	q.push({0, 0});
	while(!q.empty()) {
		int o=-q.top().st, p=q.top().nd; q.pop();
		if(odl[p]<INF) continue;
		odl[p]=o;
		for(auto i : V[p]) if(odl[i.st]==INF) q.push({-o-i.nd, i.st});
	}
	rep(i, N) wyslij(odl[i]);
}
void ReceiveB(bool y) {

}

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