oj.uz

Submission #781784

# Submission time Handle Problem Language Result Execution time Memory
781784 2023-07-13T10:52:22 Z Dan4Life Two Transportations (JOI19_transportations) C++17
6 / 100
 311 ms 10224 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
using ar = array<int,2>;
using vi = vector<int>;
#define pb push_back

namespace {
	const int mxN = (int)2e3+10;
	int n,cnt,dis[mxN];
	vector<ar> adj[mxN];
	void dijkstra(){
		priority_queue<ar,vector<ar>,greater<ar>> pq;
		memset(dis,63,sizeof(dis));
		pq.push({0,0}); dis[0]=0;
		while(!pq.empty()){
			auto [D,a] = pq.top(); pq.pop();
			if(D!=dis[a]) continue;
			for(auto [b,w] : adj[a])
				if(dis[b]>dis[a]+w) 
					dis[b]=dis[a]+w,pq.push({dis[b],b});
		}
	}
	void Send(int x){
		for(int i = 0; i < 8; i++) 
			SendA((x>>i)&1);
	}
}

void InitA(int N, int A, vi U, vi V, vi C) {
	n = N; fill(dis,dis+mxN,0);
	for (int i = 0; i < A; ++i) {
		adj[U[i]].pb({V[i],C[i]});
		adj[V[i]].pb({U[i],C[i]});
	}
}

int tot = 1, cur = 0;
void ReceiveA(bool x) {
	dis[tot]|=(1<<cur)*x; cur++;
	if(cur>=20) cur=0,tot++;
}

vi Answer() {
	vi ans(n,0);
	for(int k = 1; k < n; ++k)
		ans[k] = dis[k];
	return ans;
}

#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;
using ar = array<int,2>;
using vi = vector<int>;
#define pb push_back

namespace {
	const int mxN = (int)2e3+10;
	int n,cnt,dis[mxN];
	vector<ar> adj[mxN];
	void dijkstra(){
		priority_queue<ar,vector<ar>,greater<ar>> pq;
		memset(dis,63,sizeof(dis));
		pq.push({0,0}); dis[0]=0;
		while(!pq.empty()){
			auto [D,a] = pq.top(); pq.pop();
			if(D!=dis[a]) continue;
			for(auto [b,w] : adj[a])
				if(dis[b]>dis[a]+w) 
					dis[b]=dis[a]+w,pq.push({dis[b],b});
		}
	}
	void Send(int x){
		for(int i = 0; i < 20; i++) 
			SendB((x>>i)&1);
	}
}

void InitB(int N, int B, vi U, vi V, vi C) {
	n = N; fill(dis,dis+mxN,0);
	for (int i = 0; i < B; ++i) {
		adj[U[i]].pb({V[i],C[i]});
		adj[V[i]].pb({U[i],C[i]});
	}
	dijkstra();
	for(int i = 1; i < n; i++) Send(dis[i]);
}

void ReceiveB(bool y) {
	
}

Compilation message

Azer.cpp:24:7: warning: 'void {anonymous}::Send(int)' defined but not used [-Wunused-function]
   24 |  void Send(int x){
      |       ^~~~
Azer.cpp:12:7: warning: 'void {anonymous}::dijkstra()' defined but not used [-Wunused-function]
   12 |  void dijkstra(){
      |       ^~~~~~~~
Azer.cpp:10:8: warning: '{anonymous}::cnt' defined but not used [-Wunused-variable]
   10 |  int n,cnt,dis[mxN];
      |        ^~~

Baijan.cpp:10:8: warning: '{anonymous}::cnt' defined but not used [-Wunused-variable]
   10 |  int n,cnt,dis[mxN];
      |        ^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 788 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 240 ms 840 KB Output is correct
4 Correct 237 ms 10224 KB Output is correct
5 Correct 14 ms 912 KB Output is correct
6 Correct 275 ms 2300 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 656 KB Output is correct
2 Incorrect 247 ms 872 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

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

Subtask #4
0 / 38.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 788 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 240 ms 840 KB Output is correct
4 Correct 237 ms 10224 KB Output is correct
5 Correct 14 ms 912 KB Output is correct
6 Correct 275 ms 2300 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Incorrect 247 ms 872 KB Output isn't correct
9 Halted 0 ms 0 KB -