oj.uz

Submission #239921

# Submission time Handle Problem Language Result Execution time Memory
239921 2020-06-17T13:57:27 Z b00n0rp Two Transportations (JOI19_transportations) C++17
100 / 100
 2270 ms 86112 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 pendtype; // 0 = dist,1 = node
	int verA,distA,verB,distB;
	PQD(pii) pq;

	void send(int x, int len){
		if(x >= (1<<len)) x = (1<<len)-1;
		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});
				}
			}
		}
		verB = 0;
		distB = 0;
	}

	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 = 9;
		pendtype = 0;
		verA = u;
		distA = dist[u];
		cerr << "Azer send dist: " << distA << endl;
		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(pendtype == 1){
		verB += ((int) x)*(1<<(pend));
		if(pend == 0){
			dist[verB] = distB; 
			done[verB] = 1;
			pq.push({distB,verB});
			refresh();
			do_next();
		}	
	}
	else{
		distB += ((int) x)*(1<<(pend));
		if(pend == 0){
			distB += global;
			if(distA < distB){
				global = distA;
				done[verA] = 1;
				cerr << "Azer send ver: " << verA << endl;
				send(verA,11);
				do_next();
			}
			else{
				global = distB;
				pend = 11;
				pendtype = 1;
			}
		}
	}
}

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 = 9;
	int pendtype = 0; // 0 = dist,1 = node
	int global = 0;
	int verA,distA,verB,distB;
	PQD(pii) pq;

	void send(int x, int len){
		if(x >= (1<<len)) x = (1<<len)-1;
		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});
				}
			}
		}
		verA = 0;
		distA = 0;
	}

	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){
			global = distA;
			pend = 11;
			pendtype = 1;
			cerr << "Baijan send dist: " << distB << endl;
			send(min(diff,(1<<9)-1),9);
		}
		else{
			dist[verB] = distB;
			done[verB] = 1;
			global = distB;
			refresh();
			pend = 9;
			pendtype = 0;
			cerr << "Baijan send dist: " << distB << endl;
			cerr << "Baijan send ver: " << verB << endl;
			send(min(diff,(1<<9)-1),9);
			send(verB,11);
		}
	}

}  // 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(pendtype == 1){
		verA += ((int) y)*(1<<(pend));
		if(pend == 0){
			dist[verA] = distA; 
			done[verA] = 1;
			pq.push({distA,verA});
			refresh();
			pend = 9;
			pendtype = 11;
		}
	}
	else{
		distA += ((int) y)*(1<<(pend));
		if(pend == 0){
			distA += global;
			do_next();
		}
	}
	
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1172 ms 2288 KB Output is correct
2 Correct 18 ms 1536 KB Output is correct
3 Correct 1222 ms 2008 KB Output is correct
4 Correct 1372 ms 20448 KB Output is correct
5 Correct 88 ms 1792 KB Output is correct
6 Correct 1320 ms 5272 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1536 KB Output is correct
2 Correct 1164 ms 2288 KB Output is correct
3 Correct 1336 ms 2272 KB Output is correct
4 Correct 1818 ms 55264 KB Output is correct
5 Correct 1306 ms 48936 KB Output is correct
6 Correct 238 ms 1592 KB Output is correct
7 Correct 1958 ms 48880 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1082 ms 1960 KB Output is correct
2 Correct 16 ms 1536 KB Output is correct
3 Correct 1190 ms 2016 KB Output is correct
4 Correct 1200 ms 2048 KB Output is correct
5 Correct 1102 ms 2528 KB Output is correct
6 Correct 1110 ms 2280 KB Output is correct
7 Correct 1190 ms 2416 KB Output is correct
8 Correct 1262 ms 2480 KB Output is correct
9 Correct 1140 ms 2352 KB Output is correct
10 Correct 1158 ms 1792 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 1592 KB Output is correct
2 Correct 442 ms 1968 KB Output is correct
3 Correct 698 ms 24056 KB Output is correct
4 Correct 544 ms 2176 KB Output is correct
5 Correct 758 ms 17720 KB Output is correct
6 Correct 546 ms 2200 KB Output is correct
7 Correct 620 ms 2032 KB Output is correct
8 Correct 598 ms 1760 KB Output is correct
9 Correct 994 ms 36472 KB Output is correct
10 Correct 687 ms 36280 KB Output is correct
11 Correct 1170 ms 62008 KB Output is correct
12 Correct 986 ms 54360 KB Output is correct
13 Correct 496 ms 2016 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 1592 KB Output is correct
2 Correct 442 ms 1968 KB Output is correct
3 Correct 698 ms 24056 KB Output is correct
4 Correct 544 ms 2176 KB Output is correct
5 Correct 758 ms 17720 KB Output is correct
6 Correct 546 ms 2200 KB Output is correct
7 Correct 620 ms 2032 KB Output is correct
8 Correct 598 ms 1760 KB Output is correct
9 Correct 994 ms 36472 KB Output is correct
10 Correct 687 ms 36280 KB Output is correct
11 Correct 1170 ms 62008 KB Output is correct
12 Correct 986 ms 54360 KB Output is correct
13 Correct 496 ms 2016 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 724 ms 1672 KB Output is correct
16 Correct 650 ms 1704 KB Output is correct
17 Correct 648 ms 1760 KB Output is correct
18 Correct 900 ms 17640 KB Output is correct
19 Correct 794 ms 2240 KB Output is correct
20 Correct 728 ms 18248 KB Output is correct
21 Correct 588 ms 1760 KB Output is correct
22 Correct 596 ms 1760 KB Output is correct
23 Correct 994 ms 44264 KB Output is correct
24 Correct 1150 ms 44256 KB Output is correct
25 Correct 1442 ms 75896 KB Output is correct
26 Correct 1196 ms 64968 KB Output is correct
27 Correct 610 ms 2272 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 1592 KB Output is correct
2 Correct 442 ms 1968 KB Output is correct
3 Correct 698 ms 24056 KB Output is correct
4 Correct 544 ms 2176 KB Output is correct
5 Correct 758 ms 17720 KB Output is correct
6 Correct 546 ms 2200 KB Output is correct
7 Correct 620 ms 2032 KB Output is correct
8 Correct 598 ms 1760 KB Output is correct
9 Correct 994 ms 36472 KB Output is correct
10 Correct 687 ms 36280 KB Output is correct
11 Correct 1170 ms 62008 KB Output is correct
12 Correct 986 ms 54360 KB Output is correct
13 Correct 496 ms 2016 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 724 ms 1672 KB Output is correct
16 Correct 650 ms 1704 KB Output is correct
17 Correct 648 ms 1760 KB Output is correct
18 Correct 900 ms 17640 KB Output is correct
19 Correct 794 ms 2240 KB Output is correct
20 Correct 728 ms 18248 KB Output is correct
21 Correct 588 ms 1760 KB Output is correct
22 Correct 596 ms 1760 KB Output is correct
23 Correct 994 ms 44264 KB Output is correct
24 Correct 1150 ms 44256 KB Output is correct
25 Correct 1442 ms 75896 KB Output is correct
26 Correct 1196 ms 64968 KB Output is correct
27 Correct 610 ms 2272 KB Output is correct
28 Correct 770 ms 1896 KB Output is correct
29 Correct 841 ms 1840 KB Output is correct
30 Correct 1164 ms 42296 KB Output is correct
31 Correct 778 ms 2296 KB Output is correct
32 Correct 854 ms 37384 KB Output is correct
33 Correct 846 ms 2032 KB Output is correct
34 Correct 768 ms 2232 KB Output is correct
35 Correct 757 ms 2128 KB Output is correct
36 Correct 1264 ms 49616 KB Output is correct
37 Correct 1156 ms 49672 KB Output is correct
38 Correct 1994 ms 86112 KB Output is correct
39 Correct 1682 ms 79024 KB Output is correct
40 Correct 839 ms 2048 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1172 ms 2288 KB Output is correct
2 Correct 18 ms 1536 KB Output is correct
3 Correct 1222 ms 2008 KB Output is correct
4 Correct 1372 ms 20448 KB Output is correct
5 Correct 88 ms 1792 KB Output is correct
6 Correct 1320 ms 5272 KB Output is correct
7 Correct 17 ms 1536 KB Output is correct
8 Correct 1164 ms 2288 KB Output is correct
9 Correct 1336 ms 2272 KB Output is correct
10 Correct 1818 ms 55264 KB Output is correct
11 Correct 1306 ms 48936 KB Output is correct
12 Correct 238 ms 1592 KB Output is correct
13 Correct 1958 ms 48880 KB Output is correct
14 Correct 1082 ms 1960 KB Output is correct
15 Correct 16 ms 1536 KB Output is correct
16 Correct 1190 ms 2016 KB Output is correct
17 Correct 1200 ms 2048 KB Output is correct
18 Correct 1102 ms 2528 KB Output is correct
19 Correct 1110 ms 2280 KB Output is correct
20 Correct 1190 ms 2416 KB Output is correct
21 Correct 1262 ms 2480 KB Output is correct
22 Correct 1140 ms 2352 KB Output is correct
23 Correct 1158 ms 1792 KB Output is correct
24 Correct 402 ms 1592 KB Output is correct
25 Correct 442 ms 1968 KB Output is correct
26 Correct 698 ms 24056 KB Output is correct
27 Correct 544 ms 2176 KB Output is correct
28 Correct 758 ms 17720 KB Output is correct
29 Correct 546 ms 2200 KB Output is correct
30 Correct 620 ms 2032 KB Output is correct
31 Correct 598 ms 1760 KB Output is correct
32 Correct 994 ms 36472 KB Output is correct
33 Correct 687 ms 36280 KB Output is correct
34 Correct 1170 ms 62008 KB Output is correct
35 Correct 986 ms 54360 KB Output is correct
36 Correct 496 ms 2016 KB Output is correct
37 Correct 16 ms 1280 KB Output is correct
38 Correct 724 ms 1672 KB Output is correct
39 Correct 650 ms 1704 KB Output is correct
40 Correct 648 ms 1760 KB Output is correct
41 Correct 900 ms 17640 KB Output is correct
42 Correct 794 ms 2240 KB Output is correct
43 Correct 728 ms 18248 KB Output is correct
44 Correct 588 ms 1760 KB Output is correct
45 Correct 596 ms 1760 KB Output is correct
46 Correct 994 ms 44264 KB Output is correct
47 Correct 1150 ms 44256 KB Output is correct
48 Correct 1442 ms 75896 KB Output is correct
49 Correct 1196 ms 64968 KB Output is correct
50 Correct 610 ms 2272 KB Output is correct
51 Correct 770 ms 1896 KB Output is correct
52 Correct 841 ms 1840 KB Output is correct
53 Correct 1164 ms 42296 KB Output is correct
54 Correct 778 ms 2296 KB Output is correct
55 Correct 854 ms 37384 KB Output is correct
56 Correct 846 ms 2032 KB Output is correct
57 Correct 768 ms 2232 KB Output is correct
58 Correct 757 ms 2128 KB Output is correct
59 Correct 1264 ms 49616 KB Output is correct
60 Correct 1156 ms 49672 KB Output is correct
61 Correct 1994 ms 86112 KB Output is correct
62 Correct 1682 ms 79024 KB Output is correct
63 Correct 839 ms 2048 KB Output is correct
64 Correct 1612 ms 2272 KB Output is correct
65 Correct 1612 ms 46944 KB Output is correct
66 Correct 1660 ms 40912 KB Output is correct
67 Correct 1346 ms 2304 KB Output is correct
68 Correct 1414 ms 2064 KB Output is correct
69 Correct 2040 ms 84024 KB Output is correct
70 Correct 2270 ms 68912 KB Output is correct
71 Correct 1621 ms 9920 KB Output is correct
72 Correct 1140 ms 2784 KB Output is correct