oj.uz

Submission #152584

# Submission time Handle Problem Language Result Execution time Memory
152584 2019-09-08T13:38:12 Z username Two Transportations (JOI19_transportations) C++14
100 / 100
 2054 ms 85272 KB 
#include "Azer.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define REP(i,j,k) for(int i=(j);i<(k);++i)
#define RREP(i,j,k) for(int i=int(j)-1;i>=(k);--i)
#define pb push_back
#define f first
#define s second

namespace{
	const int maxn=2009,inf=1e9;
	int n,ls=0,t=0,fin=0,r,tmp,d[maxn];
	bitset<maxn>c;
	vector<pii>g[maxn];
	priority_queue<pii,vector<pii>,greater<pii>>pq;
	
	void send(int x,int l){RREP(i,l,0)SendA((x>>i)&1);}
	void rlx(int u,int x){
		d[u]=x;
		c[u]=1;
		++fin;
		ls=d[u];
		REP(i,0,g[u].size()){
			pii&ee=g[u][i];
			if(d[u]+ee.s<d[ee.f]){
				d[ee.f]=d[u]+ee.s;
				pq.push({d[ee.f],ee.f});
			}
		}
	}
	void proc(){
		if(t==0||t==21){
			while(pq.size()&&c[pq.top().s])pq.pop();
			send(pq.size()?pq.top().f-ls:511,9);
			t=1;
		}else if(t==9){
			r+=ls;
			if(pq.empty()||r<pq.top().f)tmp=r;
			else{
				pii tt=pq.top();pq.pop();
				send(tt.s,11);
				t+=11;
				rlx(tt.s,tt.f);
			}
		}else rlx(r,tmp);
	}
}

void InitA(int _n,int a,vector<int>u,vector<int>v,vector<int>c) {
	n=_n;
	REP(i,0,a)g[u[i]].pb({v[i],c[i]}),g[v[i]].pb({u[i],c[i]});
	fill(d+1,d+n,inf);
	pq.push({d[0],0});
	proc();
}

void ReceiveA(bool x){
	if(t==1||t==10)r=0;
	(r<<=1)|=x;
	if(t==9||t==20)proc();
	++t;
	if(t==21&&fin<n)proc();
}

vector<int> Answer(){
	vector<int>ret;
	REP(i,0,::n)ret.pb(d[i]);
	return ret;
}
#include "Baijan.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define REP(i,j,k) for(int i=(j);i<(k);++i)
#define RREP(i,j,k) for(int i=int(j)-1;i>=(k);--i)
#define pb push_back
#define f first
#define s second

namespace{
	const int maxn=2009,inf=1e9;
	int n,ls=0,t=0,fin=0,r,tmp,d[maxn];
	bitset<maxn>c;
	vector<pii>g[maxn];
	priority_queue<pii,vector<pii>,greater<pii>>pq;
	
	void send(int x,int l){RREP(i,l,0)SendB((x>>i)&1);}
	void rlx(int u,int x){
		d[u]=x;
		c[u]=1;
		++fin;
		ls=d[u];
		REP(i,0,g[u].size()){
			pii&ee=g[u][i];
			if(d[u]+ee.s<d[ee.f]){
				d[ee.f]=d[u]+ee.s;
				pq.push({d[ee.f],ee.f});
			}
		}
	}
	void proc(){
		if(t==0||t==21){
			while(pq.size()&&c[pq.top().s])pq.pop();
			send(pq.size()?pq.top().f-ls:511,9);
			t=1;
		}else if(t==9){
			r+=ls;
			if(pq.empty()||r<=pq.top().f)tmp=r;
			else{
				pii tt=pq.top();pq.pop();
				send(tt.s,11);
				t+=11;
				rlx(tt.s,tt.f);
			}
		}else rlx(r,tmp);
	}
}

void InitB(int _n,int a,vector<int>u,vector<int>v,vector<int>c) {
	n=_n;
	REP(i,0,a)g[u[i]].pb({v[i],c[i]}),g[v[i]].pb({u[i],c[i]});
	fill(d+1,d+n,inf);
	pq.push({d[0],0});
	proc();
}

void ReceiveB(bool x){
	if(t==1||t==10)r=0;
	(r<<=1)|=x;
	if(t==9||t==20)proc();
	++t;
	if(t==21&&fin<n)proc();
}

Compilation message

Azer.cpp: In function 'void {anonymous}::rlx(int, int)':
Azer.cpp:5:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(int i=(j);i<(k);++i)
                                   ^
Azer.cpp:24:3: note: in expansion of macro 'REP'
   REP(i,0,g[u].size()){
   ^~~

Baijan.cpp: In function 'void {anonymous}::rlx(int, int)':
Baijan.cpp:5:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(int i=(j);i<(k);++i)
                                   ^
Baijan.cpp:24:3: note: in expansion of macro 'REP'
   REP(i,0,g[u].size()){
   ^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 1480 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 1080 ms 1480 KB Output is correct
4 Correct 1124 ms 20128 KB Output is correct
5 Correct 36 ms 1888 KB Output is correct
6 Correct 1188 ms 4320 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1248 KB Output is correct
2 Correct 1116 ms 2016 KB Output is correct
3 Correct 1000 ms 1760 KB Output is correct
4 Correct 1174 ms 55144 KB Output is correct
5 Correct 1610 ms 48056 KB Output is correct
6 Correct 194 ms 1504 KB Output is correct
7 Correct 1800 ms 48304 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 838 ms 1464 KB Output is correct
2 Correct 8 ms 1248 KB Output is correct
3 Correct 888 ms 1504 KB Output is correct
4 Correct 1212 ms 1768 KB Output is correct
5 Correct 1100 ms 1600 KB Output is correct
6 Correct 1060 ms 1760 KB Output is correct
7 Correct 1074 ms 1640 KB Output is correct
8 Correct 1016 ms 1488 KB Output is correct
9 Correct 1096 ms 1504 KB Output is correct
10 Correct 1068 ms 1528 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 758 ms 1760 KB Output is correct
2 Correct 438 ms 1504 KB Output is correct
3 Correct 716 ms 23440 KB Output is correct
4 Correct 382 ms 1584 KB Output is correct
5 Correct 934 ms 17184 KB Output is correct
6 Correct 782 ms 1560 KB Output is correct
7 Correct 488 ms 1560 KB Output is correct
8 Correct 640 ms 1536 KB Output is correct
9 Correct 836 ms 36032 KB Output is correct
10 Correct 938 ms 35808 KB Output is correct
11 Correct 1240 ms 61120 KB Output is correct
12 Correct 1102 ms 53568 KB Output is correct
13 Correct 563 ms 1760 KB Output is correct
14 Correct 10 ms 1344 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 758 ms 1760 KB Output is correct
2 Correct 438 ms 1504 KB Output is correct
3 Correct 716 ms 23440 KB Output is correct
4 Correct 382 ms 1584 KB Output is correct
5 Correct 934 ms 17184 KB Output is correct
6 Correct 782 ms 1560 KB Output is correct
7 Correct 488 ms 1560 KB Output is correct
8 Correct 640 ms 1536 KB Output is correct
9 Correct 836 ms 36032 KB Output is correct
10 Correct 938 ms 35808 KB Output is correct
11 Correct 1240 ms 61120 KB Output is correct
12 Correct 1102 ms 53568 KB Output is correct
13 Correct 563 ms 1760 KB Output is correct
14 Correct 10 ms 1344 KB Output is correct
15 Correct 604 ms 1392 KB Output is correct
16 Correct 466 ms 1640 KB Output is correct
17 Correct 572 ms 1512 KB Output is correct
18 Correct 556 ms 17768 KB Output is correct
19 Correct 712 ms 1504 KB Output is correct
20 Correct 812 ms 18112 KB Output is correct
21 Correct 538 ms 1464 KB Output is correct
22 Correct 670 ms 1760 KB Output is correct
23 Correct 1068 ms 43912 KB Output is correct
24 Correct 964 ms 43624 KB Output is correct
25 Correct 1542 ms 74896 KB Output is correct
26 Correct 1210 ms 64168 KB Output is correct
27 Correct 566 ms 1896 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 758 ms 1760 KB Output is correct
2 Correct 438 ms 1504 KB Output is correct
3 Correct 716 ms 23440 KB Output is correct
4 Correct 382 ms 1584 KB Output is correct
5 Correct 934 ms 17184 KB Output is correct
6 Correct 782 ms 1560 KB Output is correct
7 Correct 488 ms 1560 KB Output is correct
8 Correct 640 ms 1536 KB Output is correct
9 Correct 836 ms 36032 KB Output is correct
10 Correct 938 ms 35808 KB Output is correct
11 Correct 1240 ms 61120 KB Output is correct
12 Correct 1102 ms 53568 KB Output is correct
13 Correct 563 ms 1760 KB Output is correct
14 Correct 10 ms 1344 KB Output is correct
15 Correct 604 ms 1392 KB Output is correct
16 Correct 466 ms 1640 KB Output is correct
17 Correct 572 ms 1512 KB Output is correct
18 Correct 556 ms 17768 KB Output is correct
19 Correct 712 ms 1504 KB Output is correct
20 Correct 812 ms 18112 KB Output is correct
21 Correct 538 ms 1464 KB Output is correct
22 Correct 670 ms 1760 KB Output is correct
23 Correct 1068 ms 43912 KB Output is correct
24 Correct 964 ms 43624 KB Output is correct
25 Correct 1542 ms 74896 KB Output is correct
26 Correct 1210 ms 64168 KB Output is correct
27 Correct 566 ms 1896 KB Output is correct
28 Correct 560 ms 1328 KB Output is correct
29 Correct 520 ms 1472 KB Output is correct
30 Correct 1200 ms 41952 KB Output is correct
31 Correct 626 ms 1600 KB Output is correct
32 Correct 1194 ms 37344 KB Output is correct
33 Correct 812 ms 1552 KB Output is correct
34 Correct 688 ms 1792 KB Output is correct
35 Correct 894 ms 1768 KB Output is correct
36 Correct 1460 ms 49056 KB Output is correct
37 Correct 1454 ms 49120 KB Output is correct
38 Correct 1512 ms 85272 KB Output is correct
39 Correct 1784 ms 78592 KB Output is correct
40 Correct 916 ms 1752 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 1480 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 1080 ms 1480 KB Output is correct
4 Correct 1124 ms 20128 KB Output is correct
5 Correct 36 ms 1888 KB Output is correct
6 Correct 1188 ms 4320 KB Output is correct
7 Correct 6 ms 1248 KB Output is correct
8 Correct 1116 ms 2016 KB Output is correct
9 Correct 1000 ms 1760 KB Output is correct
10 Correct 1174 ms 55144 KB Output is correct
11 Correct 1610 ms 48056 KB Output is correct
12 Correct 194 ms 1504 KB Output is correct
13 Correct 1800 ms 48304 KB Output is correct
14 Correct 838 ms 1464 KB Output is correct
15 Correct 8 ms 1248 KB Output is correct
16 Correct 888 ms 1504 KB Output is correct
17 Correct 1212 ms 1768 KB Output is correct
18 Correct 1100 ms 1600 KB Output is correct
19 Correct 1060 ms 1760 KB Output is correct
20 Correct 1074 ms 1640 KB Output is correct
21 Correct 1016 ms 1488 KB Output is correct
22 Correct 1096 ms 1504 KB Output is correct
23 Correct 1068 ms 1528 KB Output is correct
24 Correct 758 ms 1760 KB Output is correct
25 Correct 438 ms 1504 KB Output is correct
26 Correct 716 ms 23440 KB Output is correct
27 Correct 382 ms 1584 KB Output is correct
28 Correct 934 ms 17184 KB Output is correct
29 Correct 782 ms 1560 KB Output is correct
30 Correct 488 ms 1560 KB Output is correct
31 Correct 640 ms 1536 KB Output is correct
32 Correct 836 ms 36032 KB Output is correct
33 Correct 938 ms 35808 KB Output is correct
34 Correct 1240 ms 61120 KB Output is correct
35 Correct 1102 ms 53568 KB Output is correct
36 Correct 563 ms 1760 KB Output is correct
37 Correct 10 ms 1344 KB Output is correct
38 Correct 604 ms 1392 KB Output is correct
39 Correct 466 ms 1640 KB Output is correct
40 Correct 572 ms 1512 KB Output is correct
41 Correct 556 ms 17768 KB Output is correct
42 Correct 712 ms 1504 KB Output is correct
43 Correct 812 ms 18112 KB Output is correct
44 Correct 538 ms 1464 KB Output is correct
45 Correct 670 ms 1760 KB Output is correct
46 Correct 1068 ms 43912 KB Output is correct
47 Correct 964 ms 43624 KB Output is correct
48 Correct 1542 ms 74896 KB Output is correct
49 Correct 1210 ms 64168 KB Output is correct
50 Correct 566 ms 1896 KB Output is correct
51 Correct 560 ms 1328 KB Output is correct
52 Correct 520 ms 1472 KB Output is correct
53 Correct 1200 ms 41952 KB Output is correct
54 Correct 626 ms 1600 KB Output is correct
55 Correct 1194 ms 37344 KB Output is correct
56 Correct 812 ms 1552 KB Output is correct
57 Correct 688 ms 1792 KB Output is correct
58 Correct 894 ms 1768 KB Output is correct
59 Correct 1460 ms 49056 KB Output is correct
60 Correct 1454 ms 49120 KB Output is correct
61 Correct 1512 ms 85272 KB Output is correct
62 Correct 1784 ms 78592 KB Output is correct
63 Correct 916 ms 1752 KB Output is correct
64 Correct 1272 ms 2080 KB Output is correct
65 Correct 1476 ms 46736 KB Output is correct
66 Correct 1582 ms 41144 KB Output is correct
67 Correct 1198 ms 1856 KB Output is correct
68 Correct 1036 ms 2016 KB Output is correct
69 Correct 2054 ms 83224 KB Output is correct
70 Correct 1900 ms 68120 KB Output is correct
71 Correct 1226 ms 9000 KB Output is correct
72 Correct 1354 ms 2104 KB Output is correct