oj.uz

답안 #58937

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58937 2018-07-19T21:02:07 Z Benq 컴퓨터 네트워크 (BOI14_network) C++14
50 / 100
 145 ms 24312 KB 
#include "network.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int dist(int a, int b) { 
	if (a == b) return 0; 
	return ping(a,b)+1; 
}

vi v[1001];

void findRoute (int N, int a, int b) {
	int tot = dist(a,b);
	FOR(i,1,N+1) if (i != a && i != b) {
		int x = dist(a,i), y = dist(i,b);
		if (x+y == tot) v[x].pb(i);
	}
	v[0].pb(a);
	v[tot].pb(b);

	int cur = a, d = 0;
	while (cur != b) {
		for (int i: v[d+1]) if (dist(cur,i) == 1) {
			cur = i;
			d ++;
			travelTo(i);
			break;
		}
	}
}

Compilation message

grader.c: In function 'int main()':
grader.c:48:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d%d%d%d", &N, &a, &b, &M);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
grader.c:51:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &distance[u][v]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 145 ms 4308 KB Too many calls to ping
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 4364 KB Output is correct
2 Correct 32 ms 4364 KB Output is correct
3 Correct 139 ms 8612 KB Output is correct
4 Correct 98 ms 10664 KB Output is correct
5 Correct 116 ms 14432 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 14444 KB Output is correct
2 Correct 31 ms 14444 KB Output is correct
3 Correct 128 ms 18556 KB Output is correct
4 Correct 123 ms 20468 KB Output is correct
5 Correct 128 ms 24312 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 118 ms 24312 KB Too many calls to ping
2 Halted 0 ms 0 KB -