oj.uz

Submission #240113

# Submission time Handle Problem Language Result Execution time Memory
240113 2020-06-18T05:58:27 Z kshitij_sodani Two Transportations (JOI19_transportations) C++17
76 / 100
 1512 ms 85528 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;
}
 
 
/*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 582 ms 1816 KB Output is correct
2 Correct 18 ms 1536 KB Output is correct
3 Correct 780 ms 2048 KB Output is correct
4 Correct 708 ms 20232 KB Output is correct
5 Correct 50 ms 2048 KB Output is correct
6 Correct 816 ms 4680 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1536 KB Output is correct
2 Correct 1188 ms 1768 KB Output is correct
3 Correct 1014 ms 2048 KB Output is correct
4 Incorrect 790 ms 27600 KB Wrong Answer [2]
5 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1146 ms 1536 KB Output is correct
2 Correct 16 ms 1560 KB Output is correct
3 Correct 739 ms 1592 KB Output is correct
4 Correct 893 ms 1688 KB Output is correct
5 Correct 900 ms 1768 KB Output is correct
6 Correct 1244 ms 1792 KB Output is correct
7 Correct 1234 ms 1536 KB Output is correct
8 Correct 768 ms 2016 KB Output is correct
9 Correct 754 ms 1792 KB Output is correct
10 Correct 1024 ms 1792 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 568 ms 1592 KB Output is correct
2 Correct 322 ms 1768 KB Output is correct
3 Correct 672 ms 24056 KB Output is correct
4 Correct 516 ms 1792 KB Output is correct
5 Correct 538 ms 17664 KB Output is correct
6 Correct 350 ms 1760 KB Output is correct
7 Correct 398 ms 1792 KB Output is correct
8 Correct 472 ms 1792 KB Output is correct
9 Correct 888 ms 36144 KB Output is correct
10 Correct 654 ms 36168 KB Output is correct
11 Correct 1068 ms 61432 KB Output is correct
12 Correct 1040 ms 53880 KB Output is correct
13 Correct 530 ms 1792 KB Output is correct
14 Correct 18 ms 1536 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 568 ms 1592 KB Output is correct
2 Correct 322 ms 1768 KB Output is correct
3 Correct 672 ms 24056 KB Output is correct
4 Correct 516 ms 1792 KB Output is correct
5 Correct 538 ms 17664 KB Output is correct
6 Correct 350 ms 1760 KB Output is correct
7 Correct 398 ms 1792 KB Output is correct
8 Correct 472 ms 1792 KB Output is correct
9 Correct 888 ms 36144 KB Output is correct
10 Correct 654 ms 36168 KB Output is correct
11 Correct 1068 ms 61432 KB Output is correct
12 Correct 1040 ms 53880 KB Output is correct
13 Correct 530 ms 1792 KB Output is correct
14 Correct 18 ms 1536 KB Output is correct
15 Correct 458 ms 1792 KB Output is correct
16 Correct 562 ms 1792 KB Output is correct
17 Correct 558 ms 1792 KB Output is correct
18 Correct 566 ms 17864 KB Output is correct
19 Correct 518 ms 1792 KB Output is correct
20 Correct 740 ms 18256 KB Output is correct
21 Correct 496 ms 1760 KB Output is correct
22 Correct 574 ms 1792 KB Output is correct
23 Correct 1122 ms 44256 KB Output is correct
24 Correct 814 ms 44016 KB Output is correct
25 Correct 1304 ms 75096 KB Output is correct
26 Correct 1130 ms 64704 KB Output is correct
27 Correct 634 ms 1792 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 568 ms 1592 KB Output is correct
2 Correct 322 ms 1768 KB Output is correct
3 Correct 672 ms 24056 KB Output is correct
4 Correct 516 ms 1792 KB Output is correct
5 Correct 538 ms 17664 KB Output is correct
6 Correct 350 ms 1760 KB Output is correct
7 Correct 398 ms 1792 KB Output is correct
8 Correct 472 ms 1792 KB Output is correct
9 Correct 888 ms 36144 KB Output is correct
10 Correct 654 ms 36168 KB Output is correct
11 Correct 1068 ms 61432 KB Output is correct
12 Correct 1040 ms 53880 KB Output is correct
13 Correct 530 ms 1792 KB Output is correct
14 Correct 18 ms 1536 KB Output is correct
15 Correct 458 ms 1792 KB Output is correct
16 Correct 562 ms 1792 KB Output is correct
17 Correct 558 ms 1792 KB Output is correct
18 Correct 566 ms 17864 KB Output is correct
19 Correct 518 ms 1792 KB Output is correct
20 Correct 740 ms 18256 KB Output is correct
21 Correct 496 ms 1760 KB Output is correct
22 Correct 574 ms 1792 KB Output is correct
23 Correct 1122 ms 44256 KB Output is correct
24 Correct 814 ms 44016 KB Output is correct
25 Correct 1304 ms 75096 KB Output is correct
26 Correct 1130 ms 64704 KB Output is correct
27 Correct 634 ms 1792 KB Output is correct
28 Correct 680 ms 2048 KB Output is correct
29 Correct 518 ms 1760 KB Output is correct
30 Correct 1320 ms 42464 KB Output is correct
31 Correct 314 ms 1584 KB Output is correct
32 Correct 860 ms 37544 KB Output is correct
33 Correct 572 ms 1744 KB Output is correct
34 Correct 754 ms 1792 KB Output is correct
35 Correct 654 ms 1792 KB Output is correct
36 Correct 1210 ms 49648 KB Output is correct
37 Correct 714 ms 49144 KB Output is correct
38 Correct 1512 ms 85528 KB Output is correct
39 Correct 1286 ms 78624 KB Output is correct
40 Correct 728 ms 1792 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 1816 KB Output is correct
2 Correct 18 ms 1536 KB Output is correct
3 Correct 780 ms 2048 KB Output is correct
4 Correct 708 ms 20232 KB Output is correct
5 Correct 50 ms 2048 KB Output is correct
6 Correct 816 ms 4680 KB Output is correct
7 Correct 18 ms 1536 KB Output is correct
8 Correct 1188 ms 1768 KB Output is correct
9 Correct 1014 ms 2048 KB Output is correct
10 Incorrect 790 ms 27600 KB Wrong Answer [2]
11 Halted 0 ms 0 KB -