제출 #860741

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
860741		browntoad	Two Transportations (JOI19_transportations)	C++14	6 / 100	292 ms	13416 KiB

Azer

#include <Azer.h>
#include <bits/stdc++.h>
using namespace std;
int n, a;
vector<int> u, v, c;
void InitA(int N, int A, vector<int> U, vector<int> V, vector<int> C){
	n = N;
	a = A;
	u = U;
	v = V;
	c = C;
}
vector<int> res;
int cnt = 0, cur = 0;
void ReceiveA(bool x){
	cnt = 2*cnt + x;
	cur++;
	if (cur >= 21){
		res.push_back(cnt);
		cnt = 0;
		cur = 0;
	}
 
}
vector<int> Answer(){
	return res;
}

Baijan

#include <Baijan.h>
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define SZ(x) (int)((x).size())
int n, b;
vector<int> s, t, d;
void InitB(int N, int B, vector<int> S, vector<int> T, vector<int> D){
	n = N;
	b = B;
	s = S;
	t = T;
	d = D;
	// dij
	vector<pii> g[N];
	vector<int> dis(N);
	fill(ALL(dis), 100000000);
	REP(i, B){
		g[S[i]].pb({T[i], D[i]});
		g[T[i]].pb({S[i], D[i]});
	}
	priority_queue<pii, vector<pii>, greater<pii> > pq;
	pq.push({0, 0});
	while(pq.size()){
		pii tp = pq.top(); pq.pop();
		if (dis[tp.s] < 100000000) continue;
		dis[tp.s] = tp.f;
		for(pii x:g[tp.s]){
			pq.push({x.s+tp.f, x.f});
		}
	}
 
	for (int i = 0; i < N; i++){
		vector<bool> f;
		while(dis[i] > 0){
			if (dis[i]&1) f.pb(1);
			else f.pb(0);
			dis[i]>>=1;
		}
		while(SZ(f) < 21) f.pb(0);
		reverse(ALL(f));
		REP(j, 21) SendB(f[j]);
	}
 
}
void ReceiveB(bool y){
	return;
}
/*signed main(){
	InitB(4, 4, {1,3,3,3}, {2,1,2,0}, {3,1,3,7});
}
*/

• 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