oj.uz

Submission #428136

# Submission time Handle Problem Language Result Execution time Memory
428136 2021-06-15T08:19:43 Z amunduzbaev Two Transportations (JOI19_transportations) C++14
6 / 100
 553 ms 10088 KB 
#include "Azer.h"
#include "bits/stdc++.h" 
using namespace std;

vector<int> tt;
int cnt, rr, last;

void InitA(int n, int a, vector<int> u, vector<int> v, vector<int> c) {
	//~ assert(!a); 
	tt.resize(n);
	cnt = 0, rr = 0, last = 1;
}

void ReceiveA(bool x) {
	cnt++, rr <<= 1; rr |= x;
	//~ cout<<x<<" ";
	if(cnt == 20) tt[last] = rr, cnt = rr = 0, last++; 
}

vector<int> Answer() {
	//~ for(int i=0;i<(int)tt.size();i++) cout<<tt[i]<<" ";
	//~ cout<<"\n";
	return tt;
}

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

#define ff first
#define ss second

const int N = 2e3+5;
vector<pair<int, int>> edges[N];
vector<int> dd(N, 1e9+7);

void InitB(int n, int b, vector<int> s, vector<int> t, vector<int> d) {
	for(int i=0;i<(int)s.size();i++){
		int a = s[i], b = t[i], c = d[i];
		edges[a].push_back({b, c}), edges[b].push_back({a, c}); 
	}
	
	priority_queue<pair<int, int>> qq;
	qq.push({0, 0}), dd[0] = 0;
	while(!qq.empty()){
		auto u = qq.top(); qq.pop();
		if(dd[u.ss] < -u.ff) continue;
		for(auto x : edges[u.ss]){
			if(dd[x.ff] > dd[u.ss] + x.ss) dd[x.ff] = dd[u.ss] + x.ss, qq.push({-dd[x.ff], x.ff});
		}
	}
	
	//~ for(int i=0;i<n;i++) cout<<dd[i]<<" ";
	//~ cout<<"\n";
	
	//~ for(int i=1;i<n;i++){
		//~ for(int j=19;j>=0;j--) cout<<(dd[i]>>j&1)<<" ";
		//~ cout<<"\n";
	//~ }
	
	for(int i=1;i<n;i++){
		for(int j=19;j>=0;j--) SendB(dd[i]>>j&1);
	}
}

/*

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

*/

void ReceiveB(bool y) {
	
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 720 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 553 ms 748 KB Output is correct
4 Correct 376 ms 10088 KB Output is correct
5 Correct 18 ms 768 KB Output is correct
6 Correct 268 ms 2228 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 524 KB Output is correct
2 Incorrect 361 ms 748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 495 ms 744 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 177 ms 516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 177 ms 516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 177 ms 516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 720 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 553 ms 748 KB Output is correct
4 Correct 376 ms 10088 KB Output is correct
5 Correct 18 ms 768 KB Output is correct
6 Correct 268 ms 2228 KB Output is correct
7 Correct 2 ms 524 KB Output is correct
8 Incorrect 361 ms 748 KB Output isn't correct
9 Halted 0 ms 0 KB -