oj.uz

Submission #683623

# Submission time Handle Problem Language Result Execution time Memory
683623 2023-01-18T22:42:41 Z MilosMilutinovic Two Transportations (JOI19_transportations) C++14
100 / 100
 816 ms 48900 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;

namespace {
const int N=2020;
const int inf=(int)1e9;
int n,dist[N],x,d,wei,num,cnt,st,mx;
vector<pair<int,int>> g[N];
bool act[N];

void init() {
	for (int i=0;i<N;i++) dist[i]=inf;
	dist[0]=0;
	act[0]=1;
	cnt=0;
	num=0;
	st=1;
}
void send(int v) {
	mx=0;
	for (int i=0;i<n;i++) if (act[i]) mx=max(mx,dist[i]);
	d=dist[v]-mx;
	d=min(d,511);
	for (int i=8;i>=0;i--) SendA(d>>i&1);
}
void update(int v) {
//	printf("A updatuje %d\n",v);
	for (auto&e : g[v]) {
		int u=e.first;
		int w=e.second;
		dist[u]=min(dist[u],dist[v]+w);
	}
	x=-1;
	for (int i=0;i<n;i++) {
		if (!act[i]&&(x==-1||dist[i]<dist[x])) {
			x=i;
		}
	}
	if (x!=-1) send(x);
}

}

void InitA(int N,int A,vector<int> U,vector<int> V,vector<int> C) {
	::n=N;
	for (int i=0;i<A;i++) {
		g[U[i]].push_back({V[i],C[i]});
		g[V[i]].push_back({U[i],C[i]});
	}
	init();
	update(0);
}

void ReceiveA(bool y) {
	num=num*2+y;
	cnt++;
	if (st==1&&cnt==9) {
//		printf("A recieved %d\n",num);
		cnt=0;
		if (num>=d) {
			for (int i=10;i>=0;i--) SendA(x>>i&1);
			act[x]=1;
			update(x);
			num=0;
			st=1;
		} else {
			wei=num;
			cnt=0;
			num=0;
			st=2;
		}
	}
	if (st==2&&cnt==11) {
		cnt=0;
		dist[num]=mx+wei;
		act[num]=1;
		update(num);
		num=0;
		st=1;
	}
}

vector<int> Answer() {
	vector<int> ans;
	for (int i=0;i<n;i++) ans.push_back(dist[i]);
	return ans;
}

/*
4 3 4
0 1 6
2 1 4
2 0 10
1 2 3
3 1 1
3 2 3
3 0 7
*/

#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;

namespace {
const int N=2020;
const int inf=(int)1e9;
int n,dist[N],x,d,wei,num,cnt,st,mx;
vector<pair<int,int>> g[N];
bool act[N];

void init() {
	for (int i=0;i<N;i++) dist[i]=inf;
	dist[0]=0;
	act[0]=1;
	cnt=0;
	num=0;
	st=1;
}
void send(int v) {
	mx=0;
	for (int i=0;i<n;i++) if (act[i]) mx=max(mx,dist[i]);
	d=dist[v]-mx;
	d=min(d,511);
	for (int i=8;i>=0;i--) SendB(d>>i&1);
}
void update(int v) {
//	printf("B updatuje %d\n",v);
	for (auto&e : g[v]) {
		int u=e.first;
		int w=e.second;
		dist[u]=min(dist[u],dist[v]+w);
	}
	x=-1;
	for (int i=0;i<n;i++) {
		if (!act[i]&&(x==-1||dist[i]<dist[x])) {
			x=i;
		}
	}
//	printf("B je naso x=%d\n",x);
	if (x!=-1) send(x);
}

}

void InitB(int N,int B,vector<int> S,vector<int> T,vector<int> D) {
	::n=N;
	for (int i=0;i<B;i++) {
		g[S[i]].push_back({T[i],D[i]});
		g[T[i]].push_back({S[i],D[i]});
	}
	init();
	update(0);
}

void ReceiveB(bool y) {
	num=num*2+y;
	cnt++;
	if (st==1&&cnt==9) {
//		printf("B recieved %d\n",num);
		cnt=0;
		if (num>d) {
			for (int i=10;i>=0;i--) SendB(x>>i&1);
			act[x]=1;
			update(x);
			num=0;
			st=1;
		} else {
			wei=num;
			cnt=0;
			num=0;
			st=2;
		}
	}
	if (st==2&&cnt==11) {
		cnt=0;
		dist[num]=mx+wei;
		act[num]=1;
		update(num);
		num=0;
		st=1;
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 549 ms 800 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 593 ms 784 KB Output is correct
4 Correct 564 ms 10096 KB Output is correct
5 Correct 27 ms 936 KB Output is correct
6 Correct 465 ms 2216 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 656 KB Output is correct
2 Correct 445 ms 756 KB Output is correct
3 Correct 528 ms 812 KB Output is correct
4 Correct 667 ms 27524 KB Output is correct
5 Correct 655 ms 24072 KB Output is correct
6 Correct 105 ms 676 KB Output is correct
7 Correct 728 ms 24332 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 724 KB Output is correct
2 Correct 1 ms 656 KB Output is correct
3 Correct 474 ms 660 KB Output is correct
4 Correct 534 ms 748 KB Output is correct
5 Correct 536 ms 740 KB Output is correct
6 Correct 494 ms 732 KB Output is correct
7 Correct 501 ms 740 KB Output is correct
8 Correct 539 ms 672 KB Output is correct
9 Correct 496 ms 700 KB Output is correct
10 Correct 435 ms 776 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 688 KB Output is correct
2 Correct 218 ms 776 KB Output is correct
3 Correct 317 ms 13196 KB Output is correct
4 Correct 224 ms 724 KB Output is correct
5 Correct 320 ms 10128 KB Output is correct
6 Correct 167 ms 704 KB Output is correct
7 Correct 226 ms 656 KB Output is correct
8 Correct 230 ms 656 KB Output is correct
9 Correct 289 ms 18248 KB Output is correct
10 Correct 328 ms 18188 KB Output is correct
11 Correct 465 ms 35680 KB Output is correct
12 Correct 459 ms 30672 KB Output is correct
13 Correct 229 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 688 KB Output is correct
2 Correct 218 ms 776 KB Output is correct
3 Correct 317 ms 13196 KB Output is correct
4 Correct 224 ms 724 KB Output is correct
5 Correct 320 ms 10128 KB Output is correct
6 Correct 167 ms 704 KB Output is correct
7 Correct 226 ms 656 KB Output is correct
8 Correct 230 ms 656 KB Output is correct
9 Correct 289 ms 18248 KB Output is correct
10 Correct 328 ms 18188 KB Output is correct
11 Correct 465 ms 35680 KB Output is correct
12 Correct 459 ms 30672 KB Output is correct
13 Correct 229 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 260 ms 696 KB Output is correct
16 Correct 250 ms 728 KB Output is correct
17 Correct 265 ms 720 KB Output is correct
18 Correct 316 ms 10124 KB Output is correct
19 Correct 262 ms 736 KB Output is correct
20 Correct 341 ms 10372 KB Output is correct
21 Correct 236 ms 744 KB Output is correct
22 Correct 239 ms 748 KB Output is correct
23 Correct 379 ms 22152 KB Output is correct
24 Correct 263 ms 22212 KB Output is correct
25 Correct 510 ms 43608 KB Output is correct
26 Correct 433 ms 36384 KB Output is correct
27 Correct 276 ms 760 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 688 KB Output is correct
2 Correct 218 ms 776 KB Output is correct
3 Correct 317 ms 13196 KB Output is correct
4 Correct 224 ms 724 KB Output is correct
5 Correct 320 ms 10128 KB Output is correct
6 Correct 167 ms 704 KB Output is correct
7 Correct 226 ms 656 KB Output is correct
8 Correct 230 ms 656 KB Output is correct
9 Correct 289 ms 18248 KB Output is correct
10 Correct 328 ms 18188 KB Output is correct
11 Correct 465 ms 35680 KB Output is correct
12 Correct 459 ms 30672 KB Output is correct
13 Correct 229 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 260 ms 696 KB Output is correct
16 Correct 250 ms 728 KB Output is correct
17 Correct 265 ms 720 KB Output is correct
18 Correct 316 ms 10124 KB Output is correct
19 Correct 262 ms 736 KB Output is correct
20 Correct 341 ms 10372 KB Output is correct
21 Correct 236 ms 744 KB Output is correct
22 Correct 239 ms 748 KB Output is correct
23 Correct 379 ms 22152 KB Output is correct
24 Correct 263 ms 22212 KB Output is correct
25 Correct 510 ms 43608 KB Output is correct
26 Correct 433 ms 36384 KB Output is correct
27 Correct 276 ms 760 KB Output is correct
28 Correct 361 ms 712 KB Output is correct
29 Correct 320 ms 664 KB Output is correct
30 Correct 542 ms 24076 KB Output is correct
31 Correct 371 ms 664 KB Output is correct
32 Correct 459 ms 21184 KB Output is correct
33 Correct 367 ms 732 KB Output is correct
34 Correct 359 ms 776 KB Output is correct
35 Correct 380 ms 784 KB Output is correct
36 Correct 534 ms 24724 KB Output is correct
37 Correct 479 ms 24724 KB Output is correct
38 Correct 615 ms 48900 KB Output is correct
39 Correct 589 ms 44252 KB Output is correct
40 Correct 379 ms 920 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 549 ms 800 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 593 ms 784 KB Output is correct
4 Correct 564 ms 10096 KB Output is correct
5 Correct 27 ms 936 KB Output is correct
6 Correct 465 ms 2216 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Correct 445 ms 756 KB Output is correct
9 Correct 528 ms 812 KB Output is correct
10 Correct 667 ms 27524 KB Output is correct
11 Correct 655 ms 24072 KB Output is correct
12 Correct 105 ms 676 KB Output is correct
13 Correct 728 ms 24332 KB Output is correct
14 Correct 463 ms 724 KB Output is correct
15 Correct 1 ms 656 KB Output is correct
16 Correct 474 ms 660 KB Output is correct
17 Correct 534 ms 748 KB Output is correct
18 Correct 536 ms 740 KB Output is correct
19 Correct 494 ms 732 KB Output is correct
20 Correct 501 ms 740 KB Output is correct
21 Correct 539 ms 672 KB Output is correct
22 Correct 496 ms 700 KB Output is correct
23 Correct 435 ms 776 KB Output is correct
24 Correct 222 ms 688 KB Output is correct
25 Correct 218 ms 776 KB Output is correct
26 Correct 317 ms 13196 KB Output is correct
27 Correct 224 ms 724 KB Output is correct
28 Correct 320 ms 10128 KB Output is correct
29 Correct 167 ms 704 KB Output is correct
30 Correct 226 ms 656 KB Output is correct
31 Correct 230 ms 656 KB Output is correct
32 Correct 289 ms 18248 KB Output is correct
33 Correct 328 ms 18188 KB Output is correct
34 Correct 465 ms 35680 KB Output is correct
35 Correct 459 ms 30672 KB Output is correct
36 Correct 229 ms 656 KB Output is correct
37 Correct 2 ms 656 KB Output is correct
38 Correct 260 ms 696 KB Output is correct
39 Correct 250 ms 728 KB Output is correct
40 Correct 265 ms 720 KB Output is correct
41 Correct 316 ms 10124 KB Output is correct
42 Correct 262 ms 736 KB Output is correct
43 Correct 341 ms 10372 KB Output is correct
44 Correct 236 ms 744 KB Output is correct
45 Correct 239 ms 748 KB Output is correct
46 Correct 379 ms 22152 KB Output is correct
47 Correct 263 ms 22212 KB Output is correct
48 Correct 510 ms 43608 KB Output is correct
49 Correct 433 ms 36384 KB Output is correct
50 Correct 276 ms 760 KB Output is correct
51 Correct 361 ms 712 KB Output is correct
52 Correct 320 ms 664 KB Output is correct
53 Correct 542 ms 24076 KB Output is correct
54 Correct 371 ms 664 KB Output is correct
55 Correct 459 ms 21184 KB Output is correct
56 Correct 367 ms 732 KB Output is correct
57 Correct 359 ms 776 KB Output is correct
58 Correct 380 ms 784 KB Output is correct
59 Correct 534 ms 24724 KB Output is correct
60 Correct 479 ms 24724 KB Output is correct
61 Correct 615 ms 48900 KB Output is correct
62 Correct 589 ms 44252 KB Output is correct
63 Correct 379 ms 920 KB Output is correct
64 Correct 501 ms 964 KB Output is correct
65 Correct 585 ms 26524 KB Output is correct
66 Correct 630 ms 23428 KB Output is correct
67 Correct 502 ms 944 KB Output is correct
68 Correct 582 ms 940 KB Output is correct
69 Correct 816 ms 47620 KB Output is correct
70 Correct 806 ms 39432 KB Output is correct
71 Correct 554 ms 5012 KB Output is correct
72 Correct 443 ms 1192 KB Output is correct