oj.uz

답안 #152838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152838 2019-09-10T00:08:17 Z username Two Transportations (JOI19_transportations) C++14
100 / 100
 1984 ms 85200 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1100 ms 1480 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 1184 ms 1488 KB Output is correct
4 Correct 1348 ms 20128 KB Output is correct
5 Correct 70 ms 1688 KB Output is correct
6 Correct 1320 ms 4272 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1064 KB Output is correct
2 Correct 1245 ms 1760 KB Output is correct
3 Correct 1034 ms 1856 KB Output is correct
4 Correct 1607 ms 55152 KB Output is correct
5 Correct 1380 ms 47984 KB Output is correct
6 Correct 186 ms 1344 KB Output is correct
7 Correct 1612 ms 48320 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 744 ms 1760 KB Output is correct
2 Correct 6 ms 1232 KB Output is correct
3 Correct 1174 ms 1424 KB Output is correct
4 Correct 910 ms 1672 KB Output is correct
5 Correct 1214 ms 1536 KB Output is correct
6 Correct 933 ms 1600 KB Output is correct
7 Correct 1188 ms 1472 KB Output is correct
8 Correct 902 ms 1416 KB Output is correct
9 Correct 1123 ms 1376 KB Output is correct
10 Correct 998 ms 1512 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 572 ms 1320 KB Output is correct
2 Correct 546 ms 1248 KB Output is correct
3 Correct 874 ms 23456 KB Output is correct
4 Correct 416 ms 1768 KB Output is correct
5 Correct 626 ms 17128 KB Output is correct
6 Correct 546 ms 1592 KB Output is correct
7 Correct 404 ms 1760 KB Output is correct
8 Correct 306 ms 1464 KB Output is correct
9 Correct 656 ms 36056 KB Output is correct
10 Correct 952 ms 35872 KB Output is correct
11 Correct 1228 ms 61120 KB Output is correct
12 Correct 988 ms 53440 KB Output is correct
13 Correct 499 ms 1760 KB Output is correct
14 Correct 6 ms 968 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 572 ms 1320 KB Output is correct
2 Correct 546 ms 1248 KB Output is correct
3 Correct 874 ms 23456 KB Output is correct
4 Correct 416 ms 1768 KB Output is correct
5 Correct 626 ms 17128 KB Output is correct
6 Correct 546 ms 1592 KB Output is correct
7 Correct 404 ms 1760 KB Output is correct
8 Correct 306 ms 1464 KB Output is correct
9 Correct 656 ms 36056 KB Output is correct
10 Correct 952 ms 35872 KB Output is correct
11 Correct 1228 ms 61120 KB Output is correct
12 Correct 988 ms 53440 KB Output is correct
13 Correct 499 ms 1760 KB Output is correct
14 Correct 6 ms 968 KB Output is correct
15 Correct 486 ms 1384 KB Output is correct
16 Correct 430 ms 1504 KB Output is correct
17 Correct 684 ms 1512 KB Output is correct
18 Correct 1010 ms 17656 KB Output is correct
19 Correct 606 ms 1552 KB Output is correct
20 Correct 788 ms 17856 KB Output is correct
21 Correct 498 ms 1760 KB Output is correct
22 Correct 512 ms 1568 KB Output is correct
23 Correct 950 ms 43968 KB Output is correct
24 Correct 866 ms 43696 KB Output is correct
25 Correct 1334 ms 74984 KB Output is correct
26 Correct 1218 ms 64304 KB Output is correct
27 Correct 808 ms 1856 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 572 ms 1320 KB Output is correct
2 Correct 546 ms 1248 KB Output is correct
3 Correct 874 ms 23456 KB Output is correct
4 Correct 416 ms 1768 KB Output is correct
5 Correct 626 ms 17128 KB Output is correct
6 Correct 546 ms 1592 KB Output is correct
7 Correct 404 ms 1760 KB Output is correct
8 Correct 306 ms 1464 KB Output is correct
9 Correct 656 ms 36056 KB Output is correct
10 Correct 952 ms 35872 KB Output is correct
11 Correct 1228 ms 61120 KB Output is correct
12 Correct 988 ms 53440 KB Output is correct
13 Correct 499 ms 1760 KB Output is correct
14 Correct 6 ms 968 KB Output is correct
15 Correct 486 ms 1384 KB Output is correct
16 Correct 430 ms 1504 KB Output is correct
17 Correct 684 ms 1512 KB Output is correct
18 Correct 1010 ms 17656 KB Output is correct
19 Correct 606 ms 1552 KB Output is correct
20 Correct 788 ms 17856 KB Output is correct
21 Correct 498 ms 1760 KB Output is correct
22 Correct 512 ms 1568 KB Output is correct
23 Correct 950 ms 43968 KB Output is correct
24 Correct 866 ms 43696 KB Output is correct
25 Correct 1334 ms 74984 KB Output is correct
26 Correct 1218 ms 64304 KB Output is correct
27 Correct 808 ms 1856 KB Output is correct
28 Correct 834 ms 1760 KB Output is correct
29 Correct 791 ms 1392 KB Output is correct
30 Correct 1038 ms 41912 KB Output is correct
31 Correct 966 ms 1288 KB Output is correct
32 Correct 1042 ms 37216 KB Output is correct
33 Correct 588 ms 1768 KB Output is correct
34 Correct 662 ms 1624 KB Output is correct
35 Correct 590 ms 1608 KB Output is correct
36 Correct 1282 ms 49344 KB Output is correct
37 Correct 1106 ms 49104 KB Output is correct
38 Correct 1984 ms 85200 KB Output is correct
39 Correct 1414 ms 78384 KB Output is correct
40 Correct 892 ms 1928 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1100 ms 1480 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 1184 ms 1488 KB Output is correct
4 Correct 1348 ms 20128 KB Output is correct
5 Correct 70 ms 1688 KB Output is correct
6 Correct 1320 ms 4272 KB Output is correct
7 Correct 7 ms 1064 KB Output is correct
8 Correct 1245 ms 1760 KB Output is correct
9 Correct 1034 ms 1856 KB Output is correct
10 Correct 1607 ms 55152 KB Output is correct
11 Correct 1380 ms 47984 KB Output is correct
12 Correct 186 ms 1344 KB Output is correct
13 Correct 1612 ms 48320 KB Output is correct
14 Correct 744 ms 1760 KB Output is correct
15 Correct 6 ms 1232 KB Output is correct
16 Correct 1174 ms 1424 KB Output is correct
17 Correct 910 ms 1672 KB Output is correct
18 Correct 1214 ms 1536 KB Output is correct
19 Correct 933 ms 1600 KB Output is correct
20 Correct 1188 ms 1472 KB Output is correct
21 Correct 902 ms 1416 KB Output is correct
22 Correct 1123 ms 1376 KB Output is correct
23 Correct 998 ms 1512 KB Output is correct
24 Correct 572 ms 1320 KB Output is correct
25 Correct 546 ms 1248 KB Output is correct
26 Correct 874 ms 23456 KB Output is correct
27 Correct 416 ms 1768 KB Output is correct
28 Correct 626 ms 17128 KB Output is correct
29 Correct 546 ms 1592 KB Output is correct
30 Correct 404 ms 1760 KB Output is correct
31 Correct 306 ms 1464 KB Output is correct
32 Correct 656 ms 36056 KB Output is correct
33 Correct 952 ms 35872 KB Output is correct
34 Correct 1228 ms 61120 KB Output is correct
35 Correct 988 ms 53440 KB Output is correct
36 Correct 499 ms 1760 KB Output is correct
37 Correct 6 ms 968 KB Output is correct
38 Correct 486 ms 1384 KB Output is correct
39 Correct 430 ms 1504 KB Output is correct
40 Correct 684 ms 1512 KB Output is correct
41 Correct 1010 ms 17656 KB Output is correct
42 Correct 606 ms 1552 KB Output is correct
43 Correct 788 ms 17856 KB Output is correct
44 Correct 498 ms 1760 KB Output is correct
45 Correct 512 ms 1568 KB Output is correct
46 Correct 950 ms 43968 KB Output is correct
47 Correct 866 ms 43696 KB Output is correct
48 Correct 1334 ms 74984 KB Output is correct
49 Correct 1218 ms 64304 KB Output is correct
50 Correct 808 ms 1856 KB Output is correct
51 Correct 834 ms 1760 KB Output is correct
52 Correct 791 ms 1392 KB Output is correct
53 Correct 1038 ms 41912 KB Output is correct
54 Correct 966 ms 1288 KB Output is correct
55 Correct 1042 ms 37216 KB Output is correct
56 Correct 588 ms 1768 KB Output is correct
57 Correct 662 ms 1624 KB Output is correct
58 Correct 590 ms 1608 KB Output is correct
59 Correct 1282 ms 49344 KB Output is correct
60 Correct 1106 ms 49104 KB Output is correct
61 Correct 1984 ms 85200 KB Output is correct
62 Correct 1414 ms 78384 KB Output is correct
63 Correct 892 ms 1928 KB Output is correct
64 Correct 1196 ms 2088 KB Output is correct
65 Correct 1878 ms 46968 KB Output is correct
66 Correct 1358 ms 40832 KB Output is correct
67 Correct 874 ms 1976 KB Output is correct
68 Correct 820 ms 1784 KB Output is correct
69 Correct 1866 ms 83168 KB Output is correct
70 Correct 1862 ms 67808 KB Output is correct
71 Correct 1194 ms 9024 KB Output is correct
72 Correct 1240 ms 2016 KB Output is correct