oj.uz

Submission #290414

# Submission time Handle Problem Language Result Execution time Memory
290414 2020-09-03T18:27:55 Z TadijaSebez Two Transportations (JOI19_transportations) C++14
52 / 100
 1686 ms 75056 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back

namespace{
	const int N=2050;
	const int L=20;
	const int inf=(1<<20)-1;
	vector<pii> E[N];
	int dist[N],n;
	bool was[N];
	void Upd(int x){
		was[x]=1;
		for(auto e:E[x]){
			int v,w;tie(v,w)=e;
			if(!was[v]){
				dist[v]=min(dist[v],dist[x]+w);
			}
		}
	}
	int cnt,X,Y,node,D;
	int w;
	void Send(){
		Y=inf;
		bool ok=0;
		for(int i=0;i<n;i++)if(!was[i]){
			ok=1;
			if(Y>dist[i]){
				Y=dist[i];
				node=i;
			}
		}
		if(!ok)return;
		for(int i=L-1;~i;i--)SendA(Y>>i&1);
		w=1;
	}
}

void InitA(int n,int a,vi u,vi v,vi w){
	::n=n;
	for(int i=0;i<a;i++)E[u[i]].pb({v[i],w[i]}),E[v[i]].pb({u[i],w[i]});
	for(int i=1;i<n;i++)dist[i]=inf;
	Upd(0);
	Send();
}

void ReceiveA(bool x){
	X=X*2+x;
	cnt++;
	if(w==1){
		if(cnt==L){
			if(Y<=X){
				for(int i=10;~i;i--)SendA(node>>i&1);
				Upd(node);
				Send();
				cnt=0;
				X=0;
			}else{
				D=X;
				w=2;
				cnt=0;
				X=0;
			}
		}
	}else if(w==2){
		if(cnt==11){
			dist[X]=D;
			Upd(X);
			Send();
			cnt=0;
			X=0;
		}
	}
}

vi Answer(){
	vi ans;
	for(int i=0;i<n;i++)ans.pb(dist[i]);
	return ans;
}
#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back

namespace{
	const int N=2050;
	const int L=20;
	const int inf=(1<<L)-1;
	vector<pii> E[N];
	int dist[N],n;
	bool was[N];
	void Upd(int x){
		was[x]=1;
		for(auto e:E[x]){
			int v,w;tie(v,w)=e;
			if(!was[v]){
				dist[v]=min(dist[v],dist[x]+w);
			}
		}
	}
	int cnt,X,Y,node,D;
	int w;
	void Send(){
		Y=inf;
		bool ok=0;
		for(int i=0;i<n;i++)if(!was[i]){
			ok=1;
			if(Y>dist[i]){
				Y=dist[i];
				node=i;
			}
		}
		if(!ok)return;
		for(int i=L-1;~i;i--)SendB(Y>>i&1);
		w=1;
	}
}

void InitB(int n,int b,vi u,vi v,vi w){
	::n=n;
	for(int i=0;i<b;i++)E[u[i]].pb({v[i],w[i]}),E[v[i]].pb({u[i],w[i]});
	for(int i=1;i<n;i++)dist[i]=inf;
	Upd(0);
	Send();
}

void ReceiveB(bool y){
	X=X*2+y;
	cnt++;
	if(w==1){
		if(cnt==L){
			if(Y<X){
				for(int i=10;~i;i--)SendB(node>>i&1);
				Upd(node);
				Send();
				cnt=0;
				X=0;
			}else{
				D=X;
				w=2;
				cnt=0;
				X=0;
			}
		}
	}else if(w==2){
		if(cnt==11){
			dist[X]=D;
			Upd(X);
			Send();
			cnt=0;
			X=0;
		}
	}
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 455 ms 768 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Incorrect 529 ms 768 KB Wrong Answer [2]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 472 ms 768 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 813 ms 1760 KB Output is correct
2 Correct 826 ms 1536 KB Output is correct
3 Correct 934 ms 23800 KB Output is correct
4 Correct 1068 ms 1600 KB Output is correct
5 Correct 1027 ms 17464 KB Output is correct
6 Correct 903 ms 1768 KB Output is correct
7 Correct 1032 ms 1600 KB Output is correct
8 Correct 706 ms 1600 KB Output is correct
9 Correct 1268 ms 36096 KB Output is correct
10 Correct 1259 ms 36344 KB Output is correct
11 Correct 1400 ms 61640 KB Output is correct
12 Correct 1488 ms 53848 KB Output is correct
13 Correct 920 ms 1640 KB Output is correct
14 Correct 2 ms 1536 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 813 ms 1760 KB Output is correct
2 Correct 826 ms 1536 KB Output is correct
3 Correct 934 ms 23800 KB Output is correct
4 Correct 1068 ms 1600 KB Output is correct
5 Correct 1027 ms 17464 KB Output is correct
6 Correct 903 ms 1768 KB Output is correct
7 Correct 1032 ms 1600 KB Output is correct
8 Correct 706 ms 1600 KB Output is correct
9 Correct 1268 ms 36096 KB Output is correct
10 Correct 1259 ms 36344 KB Output is correct
11 Correct 1400 ms 61640 KB Output is correct
12 Correct 1488 ms 53848 KB Output is correct
13 Correct 920 ms 1640 KB Output is correct
14 Correct 2 ms 1536 KB Output is correct
15 Correct 1024 ms 1632 KB Output is correct
16 Correct 1272 ms 1656 KB Output is correct
17 Correct 1048 ms 1536 KB Output is correct
18 Correct 1242 ms 17592 KB Output is correct
19 Correct 982 ms 1648 KB Output is correct
20 Correct 1144 ms 18152 KB Output is correct
21 Correct 1124 ms 2072 KB Output is correct
22 Correct 1218 ms 1600 KB Output is correct
23 Correct 1620 ms 44256 KB Output is correct
24 Correct 1380 ms 43824 KB Output is correct
25 Correct 1686 ms 75056 KB Output is correct
26 Correct 1514 ms 64440 KB Output is correct
27 Correct 1120 ms 1600 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 813 ms 1760 KB Output is correct
2 Correct 826 ms 1536 KB Output is correct
3 Correct 934 ms 23800 KB Output is correct
4 Correct 1068 ms 1600 KB Output is correct
5 Correct 1027 ms 17464 KB Output is correct
6 Correct 903 ms 1768 KB Output is correct
7 Correct 1032 ms 1600 KB Output is correct
8 Correct 706 ms 1600 KB Output is correct
9 Correct 1268 ms 36096 KB Output is correct
10 Correct 1259 ms 36344 KB Output is correct
11 Correct 1400 ms 61640 KB Output is correct
12 Correct 1488 ms 53848 KB Output is correct
13 Correct 920 ms 1640 KB Output is correct
14 Correct 2 ms 1536 KB Output is correct
15 Correct 1024 ms 1632 KB Output is correct
16 Correct 1272 ms 1656 KB Output is correct
17 Correct 1048 ms 1536 KB Output is correct
18 Correct 1242 ms 17592 KB Output is correct
19 Correct 982 ms 1648 KB Output is correct
20 Correct 1144 ms 18152 KB Output is correct
21 Correct 1124 ms 2072 KB Output is correct
22 Correct 1218 ms 1600 KB Output is correct
23 Correct 1620 ms 44256 KB Output is correct
24 Correct 1380 ms 43824 KB Output is correct
25 Correct 1686 ms 75056 KB Output is correct
26 Correct 1514 ms 64440 KB Output is correct
27 Correct 1120 ms 1600 KB Output is correct
28 Incorrect 421 ms 816 KB Wrong Answer [2]
29 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 455 ms 768 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -