oj.uz

답안 #239888

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239888 2020-06-17T12:45:24 Z b00n0rp Two Transportations (JOI19_transportations) C++17
62 / 100
 1824 ms 86192 KB 
#include "Azer.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))

namespace {

	int N;
	vpii adj[2005];
	int dist[2005],done[2005];
	int count = 1;
	int global = 0;
	int pend;
	int verA,distA,verB,distB;
	PQD(pii) pq;

	void send(int x, int len){
		FORD(i,len-1,0) SendA((x>>i)&1);
	}	

	void refresh(){
		while(pq.size()){
			int u = pq.top().S;
			pq.pop();
			for(auto v:adj[u]){
				if(dist[v.F] > dist[u]+v.S){
					dist[v.F] = dist[u]+v.S;
					pq.push({dist[v.F],v.F});
				}
			}
		}
	}

	void do_next(){
		if(count == N) return;
		count++;
		refresh();
		int u = -1;
		REP(i,N){
			if(done[i]) continue;
			if(u == -1 or dist[i] < dist[u]) u = i;
		}
		pend = 20;
		verA = u;
		distA = dist[u];
		verB = 0;
		distB = 0;
		// cerr << "Azer sends: " << verA << "-" << distA << endl;
		// REP(i,N){
		// 	cerr << i << " - " << dist[i] << endl;
		// }
		send(verA,11);
		send(min(distA-global,(1<<9)-1),9);
	}

}  // namespace

void InitA(int N, int A, vi U, vi V, vi C) {
	::N = N;
	REP(i,A){
		adj[U[i]].pb({V[i],C[i]});
		adj[V[i]].pb({U[i],C[i]});
	}
	REP(i,N) dist[i] = (1<<20)-1;
	dist[0] = 0;
	done[0] = 1;
	pq.push({0,0});

	do_next();

}

void ReceiveA(bool x){
	pend--;
	if(pend >= 9){
		verB += ((int) x)*(1<<(pend-9));
	}
	else{
		distB += ((int) x)*(1<<pend);
		if(pend == 0){
			distB+=global;
			if(distA < distB){
				done[verA] = 1;
				dist[verA] = distA;
				global = distA;
			}
			else{
				done[verB] = 1;
				dist[verB] = distB;
				pq.push({distB,verB});
				global = distB;
			}
			do_next();
		}
	}
}

vi Answer() {
  vi vd;
  REP(i,N) vd.pb(dist[i]);
  return vd;
}

#include "Baijan.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))


namespace {

	int N;
	vpii adj[2005];
	int dist[2005],done[2005];
	int pend = 20;
	int global = 0;
	int verA,distA,verB,distB;
	PQD(pii) pq;

	void send(int x, int len){
		FORD(i,len-1,0) SendB((x>>i)&1);
	}	

	void refresh(){
		while(pq.size()){
			int u = pq.top().S;
			pq.pop();
			for(auto v:adj[u]){
				if(dist[v.F] > dist[u]+v.S){
					dist[v.F] = dist[u]+v.S;
					pq.push({dist[v.F],v.F});
				}
			}
		}
	}

	void do_next(){
		int u = -1;
		REP(i,N){
			if(done[i]) continue;
			if(u == -1 or dist[i] < dist[u]) u = i;
		}
		verB = u;
		distB = dist[u];
		int diff = distB-global;
		if(distA < distB){
			dist[verA] = distA; 
			done[verA] = 1;
			global = distA;
			pq.push({distA,verA});
		}
		else{
			dist[verB] = distB;
			done[verB] = 1;
			global = distB;
		}
		refresh();

		pend = 20;
		verA = 0;
		distA = 0;

		// cerr << "Baijin sends: " << verB << "-" << distB << endl; 
		// REP(i,N){
		// 	cerr << i << " - " << dist[i] << endl;
		// }
		send(verB,11);
		send(min(diff,(1<<9)-1),9);
	}

}  // namespace

void InitB(int N, int B, vi S, vi T, vi D) {
	::N = N;
	REP(i,B){
		adj[S[i]].pb({T[i],D[i]});
		adj[T[i]].pb({S[i],D[i]});
	}
	REP(i,N) dist[i] = (1<<20)-1;
	dist[0] = 0;
	done[0] = 1;
	pq.push({0,0});
	refresh();
}

void ReceiveB(bool y) {
	pend--;
	if(pend >= 9){
		verA += ((int) y)*(1<<(pend-9));
	}
	else{
		distA += ((int) y)*(1<<pend);
		if(pend == 0){
			distA += global;
			do_next();
		}
	}
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 517 ms 896 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 1536 KB Output is correct
2 Incorrect 540 ms 768 KB Wrong Answer [2]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 602 ms 1024 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 612 ms 1792 KB Output is correct
2 Correct 540 ms 1704 KB Output is correct
3 Correct 1028 ms 23872 KB Output is correct
4 Correct 694 ms 1536 KB Output is correct
5 Correct 877 ms 17736 KB Output is correct
6 Correct 868 ms 1536 KB Output is correct
7 Correct 788 ms 1536 KB Output is correct
8 Correct 534 ms 1536 KB Output is correct
9 Correct 1146 ms 36552 KB Output is correct
10 Correct 1180 ms 36320 KB Output is correct
11 Correct 1254 ms 61720 KB Output is correct
12 Correct 1154 ms 54376 KB Output is correct
13 Correct 788 ms 1792 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 612 ms 1792 KB Output is correct
2 Correct 540 ms 1704 KB Output is correct
3 Correct 1028 ms 23872 KB Output is correct
4 Correct 694 ms 1536 KB Output is correct
5 Correct 877 ms 17736 KB Output is correct
6 Correct 868 ms 1536 KB Output is correct
7 Correct 788 ms 1536 KB Output is correct
8 Correct 534 ms 1536 KB Output is correct
9 Correct 1146 ms 36552 KB Output is correct
10 Correct 1180 ms 36320 KB Output is correct
11 Correct 1254 ms 61720 KB Output is correct
12 Correct 1154 ms 54376 KB Output is correct
13 Correct 788 ms 1792 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 698 ms 1832 KB Output is correct
16 Correct 930 ms 1568 KB Output is correct
17 Correct 1006 ms 1552 KB Output is correct
18 Correct 910 ms 17856 KB Output is correct
19 Correct 704 ms 1792 KB Output is correct
20 Correct 974 ms 18000 KB Output is correct
21 Correct 972 ms 1840 KB Output is correct
22 Correct 789 ms 1816 KB Output is correct
23 Correct 1246 ms 44408 KB Output is correct
24 Correct 1230 ms 44144 KB Output is correct
25 Correct 1602 ms 75376 KB Output is correct
26 Correct 1526 ms 64752 KB Output is correct
27 Correct 832 ms 2096 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 612 ms 1792 KB Output is correct
2 Correct 540 ms 1704 KB Output is correct
3 Correct 1028 ms 23872 KB Output is correct
4 Correct 694 ms 1536 KB Output is correct
5 Correct 877 ms 17736 KB Output is correct
6 Correct 868 ms 1536 KB Output is correct
7 Correct 788 ms 1536 KB Output is correct
8 Correct 534 ms 1536 KB Output is correct
9 Correct 1146 ms 36552 KB Output is correct
10 Correct 1180 ms 36320 KB Output is correct
11 Correct 1254 ms 61720 KB Output is correct
12 Correct 1154 ms 54376 KB Output is correct
13 Correct 788 ms 1792 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 698 ms 1832 KB Output is correct
16 Correct 930 ms 1568 KB Output is correct
17 Correct 1006 ms 1552 KB Output is correct
18 Correct 910 ms 17856 KB Output is correct
19 Correct 704 ms 1792 KB Output is correct
20 Correct 974 ms 18000 KB Output is correct
21 Correct 972 ms 1840 KB Output is correct
22 Correct 789 ms 1816 KB Output is correct
23 Correct 1246 ms 44408 KB Output is correct
24 Correct 1230 ms 44144 KB Output is correct
25 Correct 1602 ms 75376 KB Output is correct
26 Correct 1526 ms 64752 KB Output is correct
27 Correct 832 ms 2096 KB Output is correct
28 Correct 1074 ms 1792 KB Output is correct
29 Correct 1080 ms 1560 KB Output is correct
30 Correct 1642 ms 42104 KB Output is correct
31 Correct 1094 ms 1536 KB Output is correct
32 Correct 1402 ms 37496 KB Output is correct
33 Correct 1282 ms 1720 KB Output is correct
34 Correct 926 ms 1792 KB Output is correct
35 Correct 1014 ms 2048 KB Output is correct
36 Correct 1244 ms 49888 KB Output is correct
37 Correct 1496 ms 49808 KB Output is correct
38 Correct 1824 ms 86192 KB Output is correct
39 Correct 1690 ms 79152 KB Output is correct
40 Correct 1170 ms 2048 KB Output is correct

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 517 ms 896 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -