oj.uz

Submission #123348

# Submission time Handle Problem Language Result Execution time Memory
123348 2019-07-01T08:01:35 Z 김세빈(#3018) Two Transportations (JOI19_transportations) C++14
8 / 100
 1138 ms 55128 KB 
#include <bits/stdc++.h>

#include "Azer.h"
#include <vector>

using namespace std;

typedef pair <int, int> pii;

priority_queue <pii> Q;
vector <bool> R;
vector <pii> G[2020];
bool chk[2020];
int n, m, s;

void ReceiveA(bool x)
{
	R.emplace_back(x);
}

int receive(int &v, int x)
{
	int i;
	
	v = 0;
	
	for(i=0; i<x; i++){
		v |= R[s] << i;
		s ++;
	}
}

void InitA(int _N, int A, vector <int> U, vector <int> V, vector<int> C)
{
	n = _N;
	
	int i;
	
	for(i=0; i<A; i++){
		G[U[i]].emplace_back(V[i], C[i]);
		G[V[i]].emplace_back(U[i], C[i]);
	}
}


vector <int> Answer()
{
	vector <int> A(n);
	int d, p, i, u, v, c;
	
	receive(m, 10);
	
	for(i=0; i<m; i++){
		receive(u, 11); receive(v, 11); receive(c, 9);
		G[u].emplace_back(v, c);
		G[v].emplace_back(u, c);
	}
	
	Q.push(pii(0, 0));
	
	for(; !Q.empty(); ){
		tie(d, p) = Q.top(); Q.pop();
		if(chk[p]) continue;
		A[p] = -d; chk[p] = 1;
		for(pii &t: G[p]){
			if(!chk[t.first]){
				Q.push(pii(d - t.second, t.first));
			}
		}
	}
	
	return A;
}

#include <bits/stdc++.h>

#include "Baijan.h"

using namespace std;

void send(int v, int x)
{
	int i;
	
	for(i=0; i<x; i++){
		if(v & (1 << i)) SendB(1);
		else SendB(0);
	}
}

void InitB(int N, int B, vector <int> S, vector<int> T, vector<int> D)
{
	int i;
	
	send(B, 10);
	
	for(i=0; i<B; i++){
		send(S[i], 11);
		send(T[i], 11);
		send(D[i], 9);
	}
}

void ReceiveB(bool y) {}

Compilation message

Azer.cpp: In function 'int receive(int&, int)':
Azer.cpp:31:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
0 / 6.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1000 KB Output is correct
2 Correct 376 ms 1504 KB Output is correct
3 Correct 508 ms 1512 KB Output is correct
4 Correct 937 ms 55128 KB Output is correct
5 Correct 550 ms 48280 KB Output is correct
6 Correct 522 ms 1344 KB Output is correct
7 Correct 1138 ms 48936 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 1656 KB Output is correct
2 Correct 8 ms 992 KB Output is correct
3 Incorrect 12 ms 624 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 1168 KB Output is correct
2 Correct 446 ms 1136 KB Output is correct
3 Incorrect 127 ms 8364 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 1168 KB Output is correct
2 Correct 446 ms 1136 KB Output is correct
3 Incorrect 127 ms 8364 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 1168 KB Output is correct
2 Correct 446 ms 1136 KB Output is correct
3 Incorrect 127 ms 8364 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

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