oj.uz

Submission #240114

# Submission time Handle Problem Language Result Execution time Memory
240114 2020-06-18T06:00:46 Z kshitij_sodani Two Transportations (JOI19_transportations) C++17
76 / 100
 1324 ms 85624 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#include "Azer.h"
 
 
 
vector<pair<int,int>> adj[2001];
int dist[2001];
int vis[2001];
int num=0;
int cur=0;
int st=0;
int last=0;
pair<int,int> best;
int num2=0;
int cur2=0;
int n;
vector<int> Answer(){
	vector<int> ans2;
	for(int i=0;i<n;i++){
		ans2.pb(dist[i]);
	}
	return ans2;
 
}
void ReceiveA(bool x){
	if(st==0){
		if(x){
			num+=(1<<cur);
		}
		cur+=1;
		if(cur==9){
			cur=0;
			st=1;
		}
		else{
			return;
		}
		//cout<<cur<<"<"<<num<<endl;
	}
	if(st==1){
		for(auto j:adj[last]){
			if(dist[j.a]==-1 or dist[j.a]>dist[last]+j.b){
				dist[j.a]=dist[last]+j.b;
			}
		}
		best={-1,-1};
		for(int i=0;i<n;i++){
		//	//cout<<i<<":::"<<dist[i]<<endl;
			if(vis[i]==0 and dist[i]!=-1){
				if(best.a==-1){
					best={dist[i],i};
				}
				else{
					if(dist[i]<best.a){
						best={dist[i],i};
					}
				}
			}
		}
		if(best.a==-1){
			best.a=dist[last]+511;
		}
		//cout<<best.a<<"::"<<best.b<<"::"<<num<<endl;
	/*	if(num==0){
			SendA(0);
			st=3;
		}
		else if(best.a==-1){
			SendA(1);
			st=2;
		}*/
		if(best.a<num){
			SendA(0);
			st=3;
		}
		else{
			SendA(1);
			st=2;
		}
		//cout<<st<<"....."<<endl;
		if(st==2){
			return;
		}
	}
	if(st==2){
		if(x){
			num2+=(1<<cur2);
		}
		cur2+=1;
		//cout<<cur2<<";;;;;;;;;;;;;;;"<<endl;
		if(cur2==11){
			last=num2;
			//cout<<num2<<"//"<<endl;
			vis[last]=1;
			dist[last]=num;
		}
		else{
			return;
		}		
	}
	if(st==3){
		dist[best.b]=best.a;
		vis[best.b]=1;
		if(dist[last]>best.a){
			while(true){
				continue;
			}
		}
		for(int i=0;i<9;i++){
			if((1<<i)&(best.a-dist[last])){
				SendA(1);
			}
			else{
				SendA(0);
			}
		}
		for(int i=0;i<11;i++){
			if((1<<i)&best.b){
				SendA(1);
			}
			else{
				SendA(0);
			}
		}
		last=best.b;
 
	}
	//cout<<last<<','<<dist[last]<<endl;
	st=0;
	num=dist[last];
	num2=0;
	cur2=0;
	cur=0;
/*	int kk=0;
	for(int i=0;i<n;i++){
		if(vis[i]==0){
			kk=1;
		}
	}
	if(kk){
		SendA(0);
	}*/
}
void InitA(int nn,int m,vector<int> aa,vector<int> bb,vector<int> cc){
	n=nn;
	for(int i=0;i<m;i++){
		adj[aa[i]].pb({bb[i],cc[i]});
		adj[bb[i]].pb({aa[i],cc[i]});
	}
	for(int i=1;i<n;i++){
		dist[i]=-1;
	}
	vis[0]=1;
	//SendA(0);
}
 
 
/*int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
 
	return 0;
}*/
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#include "Baijan.h"
 
vector<pair<int,int>> adj2[2001];
int dist2[2001];
int st2=0;
int last2=0;
int vis2[2001];
pair<int,int> best2;
int ne;
int cur3=0;
int cur4=0;
int num3=0;
int num4=0;
void ReceiveB(bool x){
	if(st2==0){
		for(auto j:adj2[last2]){
			if(dist2[j.a]==-1 or dist2[j.a]>dist2[last2]+j.b){
				dist2[j.a]=dist2[last2]+j.b;
			}
		}
		best2={-1,-1};
		for(int i=0;i<ne;i++){
			if(vis2[i]==0 and dist2[i]!=-1){
				if(best2.a==-1){
					best2={dist2[i],i};
				}
				else{
					if(dist2[i]<best2.a){
						best2={dist2[i],i};
					}
				}
			}
		}
		if(best2.a==-1){
			best2.a=dist2[last2]+511;
		}
		//cout<<best2.a<<"::"<<best2.b<<endl;
	//	best2.a=max(best2.a,0);
		if(best2.a<dist2[last2]){
			while(true){
				continue;
			}
		}
		for(int i=0;i<9;i++){
			if((1<<i)&(best2.a-dist2[last2])){
				SendB(1);
			}
			else{
				SendB(0);
			}
		}
		st2=1;
 
		return;
	}
	if(st2==1){
		if(x){
			st2=2;
		}
		else{
			st2=3;
			return;
		}
	}
	if(st2==2){
		//cout<<1111<<endl;
		st2=0;
		dist2[best2.b]=best2.a;
		vis2[best2.b]=1;
		last2=best2.b;
		for(int i=0;i<11;i++){
			if((1<<i)&best2.b){
				SendB(1);
			}
			else{
				SendB(0);
			}
		}
	}
	if(st2==3){
		if(cur3==0){
			num3+=(dist2[last2]);
		}
		if(cur3<9){
			if(x){
				num3+=(1<<cur3);
			}
			cur3++;
			return;
		}
		else{
			if(x){
				num4+=(1<<cur4);
			}
			cur4++;
			if(cur4==11){
				//cout<<20<<endl;
 
				//cout<<num4<<",,"<<num3<<endl;
 
				dist2[num4]=num3;
				vis2[num4]=1;
				last2=num4;
				
			}
			else{
				return;
			}
		}
	}
//	//cout<<last2<<"<<<>>>>"<<endl;
	num3=0;
	num4=0;
	cur3=0;
	cur4=0;
	st2=0;
	int kk=0;
	for(int i=0;i<ne;i++){
		if(vis2[i]==0){
			kk=1;
		}
	}
	if(kk){
		ReceiveB(0);
	}
 
 
}
void InitB(int nn,int m,vector<int> aa,vector<int> bb,vector<int> cc){
	ne=nn;
	for(int i=0;i<m;i++){
		adj2[aa[i]].pb({bb[i],cc[i]});
		adj2[bb[i]].pb({aa[i],cc[i]});
	}
	for(int i=1;i<ne;i++){
		dist2[i]=-1;
	}
	vis2[0]=1;
	ReceiveB(0);
}
 
 
/*int main(){
	ios_base::sync_with_st2dio(false);
	cin.tie(NULL);
 
	return 0;
}*/

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 940 ms 1792 KB Output is correct
2 Correct 18 ms 1536 KB Output is correct
3 Correct 1074 ms 1880 KB Output is correct
4 Correct 1016 ms 20448 KB Output is correct
5 Correct 70 ms 2272 KB Output is correct
6 Correct 816 ms 4832 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1536 KB Output is correct
2 Correct 1034 ms 1856 KB Output is correct
3 Correct 1116 ms 1792 KB Output is correct
4 Incorrect 760 ms 27648 KB Wrong Answer [2]
5 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1074 ms 1792 KB Output is correct
2 Correct 18 ms 1536 KB Output is correct
3 Correct 756 ms 1808 KB Output is correct
4 Correct 964 ms 1792 KB Output is correct
5 Correct 962 ms 1792 KB Output is correct
6 Correct 1166 ms 1760 KB Output is correct
7 Correct 904 ms 1536 KB Output is correct
8 Correct 1020 ms 1792 KB Output is correct
9 Correct 900 ms 1792 KB Output is correct
10 Correct 846 ms 2016 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 526 ms 1536 KB Output is correct
2 Correct 478 ms 1856 KB Output is correct
3 Correct 658 ms 23856 KB Output is correct
4 Correct 351 ms 1792 KB Output is correct
5 Correct 593 ms 17464 KB Output is correct
6 Correct 490 ms 1792 KB Output is correct
7 Correct 392 ms 1536 KB Output is correct
8 Correct 294 ms 1736 KB Output is correct
9 Correct 786 ms 36200 KB Output is correct
10 Correct 658 ms 36232 KB Output is correct
11 Correct 958 ms 61616 KB Output is correct
12 Correct 850 ms 53736 KB Output is correct
13 Correct 402 ms 1792 KB Output is correct
14 Correct 16 ms 1536 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 526 ms 1536 KB Output is correct
2 Correct 478 ms 1856 KB Output is correct
3 Correct 658 ms 23856 KB Output is correct
4 Correct 351 ms 1792 KB Output is correct
5 Correct 593 ms 17464 KB Output is correct
6 Correct 490 ms 1792 KB Output is correct
7 Correct 392 ms 1536 KB Output is correct
8 Correct 294 ms 1736 KB Output is correct
9 Correct 786 ms 36200 KB Output is correct
10 Correct 658 ms 36232 KB Output is correct
11 Correct 958 ms 61616 KB Output is correct
12 Correct 850 ms 53736 KB Output is correct
13 Correct 402 ms 1792 KB Output is correct
14 Correct 16 ms 1536 KB Output is correct
15 Correct 622 ms 1536 KB Output is correct
16 Correct 736 ms 1760 KB Output is correct
17 Correct 586 ms 1536 KB Output is correct
18 Correct 582 ms 17608 KB Output is correct
19 Correct 629 ms 1616 KB Output is correct
20 Correct 602 ms 18512 KB Output is correct
21 Correct 562 ms 1720 KB Output is correct
22 Correct 576 ms 1536 KB Output is correct
23 Correct 1148 ms 44192 KB Output is correct
24 Correct 836 ms 44000 KB Output is correct
25 Correct 1324 ms 75464 KB Output is correct
26 Correct 1142 ms 64472 KB Output is correct
27 Correct 650 ms 1792 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 526 ms 1536 KB Output is correct
2 Correct 478 ms 1856 KB Output is correct
3 Correct 658 ms 23856 KB Output is correct
4 Correct 351 ms 1792 KB Output is correct
5 Correct 593 ms 17464 KB Output is correct
6 Correct 490 ms 1792 KB Output is correct
7 Correct 392 ms 1536 KB Output is correct
8 Correct 294 ms 1736 KB Output is correct
9 Correct 786 ms 36200 KB Output is correct
10 Correct 658 ms 36232 KB Output is correct
11 Correct 958 ms 61616 KB Output is correct
12 Correct 850 ms 53736 KB Output is correct
13 Correct 402 ms 1792 KB Output is correct
14 Correct 16 ms 1536 KB Output is correct
15 Correct 622 ms 1536 KB Output is correct
16 Correct 736 ms 1760 KB Output is correct
17 Correct 586 ms 1536 KB Output is correct
18 Correct 582 ms 17608 KB Output is correct
19 Correct 629 ms 1616 KB Output is correct
20 Correct 602 ms 18512 KB Output is correct
21 Correct 562 ms 1720 KB Output is correct
22 Correct 576 ms 1536 KB Output is correct
23 Correct 1148 ms 44192 KB Output is correct
24 Correct 836 ms 44000 KB Output is correct
25 Correct 1324 ms 75464 KB Output is correct
26 Correct 1142 ms 64472 KB Output is correct
27 Correct 650 ms 1792 KB Output is correct
28 Correct 808 ms 1792 KB Output is correct
29 Correct 600 ms 2024 KB Output is correct
30 Correct 976 ms 42008 KB Output is correct
31 Correct 670 ms 1760 KB Output is correct
32 Correct 1082 ms 37728 KB Output is correct
33 Correct 778 ms 1840 KB Output is correct
34 Correct 644 ms 2048 KB Output is correct
35 Correct 706 ms 2048 KB Output is correct
36 Correct 1276 ms 49376 KB Output is correct
37 Correct 1118 ms 49632 KB Output is correct
38 Correct 1306 ms 85624 KB Output is correct
39 Correct 1165 ms 78648 KB Output is correct
40 Correct 710 ms 2048 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 940 ms 1792 KB Output is correct
2 Correct 18 ms 1536 KB Output is correct
3 Correct 1074 ms 1880 KB Output is correct
4 Correct 1016 ms 20448 KB Output is correct
5 Correct 70 ms 2272 KB Output is correct
6 Correct 816 ms 4832 KB Output is correct
7 Correct 16 ms 1536 KB Output is correct
8 Correct 1034 ms 1856 KB Output is correct
9 Correct 1116 ms 1792 KB Output is correct
10 Incorrect 760 ms 27648 KB Wrong Answer [2]
11 Halted 0 ms 0 KB -