oj.uz

Submission #123350

# Submission time Handle Problem Language Result Execution time Memory
123350 2019-07-01T08:07:02 Z 김세빈(#3018) Two Transportations (JOI19_transportations) C++14
6 / 100
 920 ms 20472 KB 
#include <bits/stdc++.h>

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

using namespace std;

typedef pair <int, int> pii;

vector <bool> R;
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;
}


vector <int> Answer()
{
	vector <int> A(n);
	int i;
	
	for(i=0; i<n; i++){
		receive(A[i], 20);
	}
	
	return A;
}

#include <bits/stdc++.h>

#include "Baijan.h"

using namespace std;

typedef pair <int, int> pii;

priority_queue <pii> Q;
vector <pii> G[2020];
bool chk[2020];

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)
{
	vector <int> A(N);
	int i, p, d;
	
	for(i=0; i<B; i++){
		G[S[i]].emplace_back(T[i], D[i]);
		G[T[i]].emplace_back(S[i], D[i]);
	}
	
	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));
			}
		}
	}
	
	for(i=0; i<N; i++){
		send(A[i], 20);
	}
}

void ReceiveB(bool y) {}

Compilation message

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 706 ms 1504 KB Output is correct
2 Correct 6 ms 1120 KB Output is correct
3 Correct 768 ms 1760 KB Output is correct
4 Correct 920 ms 20472 KB Output is correct
5 Correct 54 ms 2016 KB Output is correct
6 Correct 760 ms 4848 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1032 KB Output is correct
2 Incorrect 696 ms 1552 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

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

Subtask #4
0 / 38.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 706 ms 1504 KB Output is correct
2 Correct 6 ms 1120 KB Output is correct
3 Correct 768 ms 1760 KB Output is correct
4 Correct 920 ms 20472 KB Output is correct
5 Correct 54 ms 2016 KB Output is correct
6 Correct 760 ms 4848 KB Output is correct
7 Correct 4 ms 1032 KB Output is correct
8 Incorrect 696 ms 1552 KB Output isn't correct
9 Halted 0 ms 0 KB -