oj.uz

Submission #428268

# Submission time Handle Problem Language Result Execution time Memory
428268 2021-06-15T09:21:23 Z tengiz05 Two Transportations (JOI19_transportations) C++17
0 / 100
 378 ms 6284 KB 
#include "Azer.h"
#include <bits/stdc++.h>

namespace {

int n;
int count;
int u[10000], v[10000], d[10000];
int idx;

}  // namespace

void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
           std::vector<int> C) {
  ::n = N;
  count = 0;
  idx = 0;
  for (; idx < A; idx++) {
	  u[idx] = U[idx];
	  v[idx] = V[idx];
	  d[idx] = C[idx];
  }
  return;
}
void ReceiveA(bool x) {
	int t = count % 32;
	if (t < 11) {
		u[idx] += x * (1<<t);
	} else if (t < 22) {
		t -= 11;
		v[idx] += x * (1<<t);
	} else {
		t -= 22;
		d[idx] += x * (1<<t);
	}
	count++;
	if (count % 32 == 0) idx++;
	return;
}

typedef std::pair<int, int> pii;
std::vector<int> Answer() {
	std::vector<int> ans(n);
	std::vector<std::vector<std::pair<int, int>>> e(n);
	for (int i = 0; i < n - 1; i++) {
		e[u[i]].emplace_back(v[i], d[i]);
		e[v[i]].emplace_back(u[i], d[i]);
	}
	std::priority_queue<pii, std::vector<pii>> q;
	q.emplace(0, 0);
	std::vector<int> dist(n, 1e9);
	dist[0] = 0;
	while (!q.empty()) {
		auto [d, u] = q.top();
		q.pop();
		if (d > dist[u]) {
			continue;
		}
		for (auto [v, w] : e[u]) {
			if (dist[v] > d + w) {
				dist[v] = d + w;
				q.emplace(dist[v], v);
			}
		}
	}
	ans = dist;
  return ans;
}

#include "Baijan.h"
#include <bits/stdc++.h>

namespace {
int n;
}  // namespace

typedef std::pair<int, int> pii;
void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D) {
	::n = N;
	for (int i = 0; i < B; i++) {
		for (int j = 0; j < 11; j++) {
			SendB(bool((1<<j) & S[i]));
		}
		for (int j = 0; j < 11; j++) {
			SendB(bool((1<<j) & T[i]));
		}
		for (int j = 0; j < 10; j++) {
			SendB(bool((1 << j) & D[i]));
		}
	}
	return;
}

void ReceiveB(bool y) {
	while (true) {; }
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 260 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 384 KB Output is correct
2 Correct 378 ms 660 KB Output is correct
3 Incorrect 324 ms 700 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 768 KB Output is correct
2 Correct 1 ms 392 KB Output is correct
3 Runtime error 1 ms 192 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 624 KB Output is correct
2 Correct 156 ms 616 KB Output is correct
3 Runtime error 35 ms 6284 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 624 KB Output is correct
2 Correct 156 ms 616 KB Output is correct
3 Runtime error 35 ms 6284 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 624 KB Output is correct
2 Correct 156 ms 616 KB Output is correct
3 Runtime error 35 ms 6284 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

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