oj.uz

답안 #123353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
123353 2019-07-01T08:13:59 Z 김세빈(#3018) Two Transportations (JOI19_transportations) C++14
8 / 100
 759 ms 23560 KB 
#include <bits/stdc++.h>

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

using namespace std;

typedef pair <int, int> pii;

static priority_queue <pii> Q;
static vector <bool> R;
static vector <pii> G[2020];
static bool chk[2020];
static 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, v, c;
	
	for(i=0; i<n; i++){
		receive(v, 11); receive(c, 9);
		if(v == n) continue;
		G[i].emplace_back(v, c);
		G[v].emplace_back(i, 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;

typedef pair <int, int> pii;

static vector <pii> G[2020];
static int P[2020], K[2020];
static 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 dfs(int p, int r)
{
	chk[p] = 1;
	for(pii &t: G[p]){
		if(!chk[t.first]){
			P[t.first] = p;
			K[t.first] = t.second;
			dfs(t.first, p);
		}
	}
}

void InitB(int N, int B, vector <int> S, vector<int> T, vector<int> D)
{
	int i;
	
	for(i=0; i<B; i++){
		G[S[i]].emplace_back(T[i], D[i]);
		G[T[i]].emplace_back(S[i], D[i]);
	}
	
	for(i=0; i<N; i++){
		P[i] = N; K[i] = 0;
	}
	
	for(i=0; i<N; i++){
		if(!chk[i]) dfs(i, i);
	}
	
	for(i=0; i<N; i++){
		send(P[i], 11); send(K[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]
 }
 ^
Azer.cpp: At global scope:
Azer.cpp:14:15: warning: 'm' defined but not used [-Wunused-variable]
 static int n, m, s;
               ^

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 450 ms 1616 KB Output is correct
2 Correct 6 ms 1224 KB Output is correct
3 Incorrect 628 ms 1760 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1248 KB Output is correct
2 Correct 624 ms 1728 KB Output is correct
3 Incorrect 660 ms 1832 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 506 ms 1504 KB Output is correct
2 Correct 7 ms 992 KB Output is correct
3 Correct 366 ms 1720 KB Output is correct
4 Correct 588 ms 1656 KB Output is correct
5 Correct 442 ms 1904 KB Output is correct
6 Correct 606 ms 1576 KB Output is correct
7 Correct 759 ms 1608 KB Output is correct
8 Correct 542 ms 1528 KB Output is correct
9 Correct 594 ms 1608 KB Output is correct
10 Correct 730 ms 1760 KB Output is correct

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 1376 KB Output is correct
2 Correct 198 ms 1512 KB Output is correct
3 Correct 520 ms 23560 KB Output is correct
4 Incorrect 320 ms 1760 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 1376 KB Output is correct
2 Correct 198 ms 1512 KB Output is correct
3 Correct 520 ms 23560 KB Output is correct
4 Incorrect 320 ms 1760 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 1376 KB Output is correct
2 Correct 198 ms 1512 KB Output is correct
3 Correct 520 ms 23560 KB Output is correct
4 Incorrect 320 ms 1760 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 450 ms 1616 KB Output is correct
2 Correct 6 ms 1224 KB Output is correct
3 Incorrect 628 ms 1760 KB Output isn't correct
4 Halted 0 ms 0 KB -