oj.uz

답안 #66068

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
66068 2018-08-09T13:28:41 Z ikura355 007 (CEOI14_007) C++14
66.6667 / 100
 471 ms 18748 KB 
#include<bits/stdc++.h>
using namespace std;

const int maxn = 2e5 + 5;
const int inf = 1e9;

int n,m,a,b,s1,s2;
vector<int> way[maxn];
int d[2][maxn];
int q[maxn];
int p[maxn], wow[maxn];

int sssp(int k, int u) {
    int l = 1, r = 0;
	for(int i=1;i<=n;i++) d[k][i] = inf;
	d[k][u] = 0; q[++r] = u;
	while(l<=r) {
		int u = q[l++];
		for(auto v : way[u]) {
			if(d[k][v] > d[k][u] + 1) {
				d[k][v] = d[k][u] + 1; q[++r] = v;
			}
		}
	}
}

bool cmp(int x, int y) {
    if(d[0][x]!=d[0][y]) return d[0][x] < d[0][y];
    if(d[1][x]!=d[1][y]) return d[1][x] < d[1][y];
    return x<y;
}

int main() {
	scanf("%d%d",&n,&m);
	scanf("%d%d%d%d",&a,&b,&s1,&s2);
	for(int i=1;i<=m;i++) {
		int u,v; scanf("%d%d",&u,&v);
		way[u].push_back(v); way[v].push_back(u);
	}
	sssp(0,s1); sssp(1,s2);
	if(d[0][a]>d[0][b] || d[1][a]>d[1][b]) return !printf("-1");
    int res = min(d[0][b]-d[0][a], d[1][b]-d[1][a]);
    if(res==0) return !printf("0");
//    printf("res = %d\n",res);
    if(d[0][b]-d[0][a] == d[1][b]-d[1][a]) {
        for(int i=1;i<=n;i++) p[i] = i;
        sort(&p[1],&p[n],cmp);
        for(int i=1;i<=n;i++) {
            int u = p[i];
            for(auto v : way[u]) {
                if(d[0][v]==d[0][u]+1 && d[1][v]==d[1][u]+1) wow[v] = max(wow[v], wow[u]+1);
            }
//            printf("wow %d = %d\n",u,wow[u]);
        }
        if(wow[a]+res<wow[b]) res = res-1;
    }
    printf("%d",res);
}

Compilation message

007.cpp: In function 'int sssp(int, int)':
007.cpp:25:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
007.cpp: In function 'int main()':
007.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
007.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d",&a,&b,&s1,&s2);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
007.cpp:37:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int u,v; scanf("%d%d",&u,&v);
            ~~~~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 6 ms 5232 KB Output is correct
3 Correct 7 ms 5232 KB Output is correct
4 Incorrect 8 ms 5232 KB Output isn't correct
5 Correct 8 ms 5364 KB Output is correct
6 Correct 7 ms 5364 KB Output is correct
7 Correct 6 ms 5364 KB Output is correct
8 Correct 6 ms 5364 KB Output is correct
9 Correct 9 ms 5364 KB Output is correct
10 Correct 7 ms 5364 KB Output is correct
11 Correct 8 ms 5364 KB Output is correct
12 Correct 7 ms 5364 KB Output is correct
13 Correct 6 ms 5364 KB Output is correct
14 Correct 8 ms 5364 KB Output is correct
15 Correct 6 ms 5364 KB Output is correct
16 Correct 7 ms 5364 KB Output is correct
17 Correct 10 ms 5364 KB Output is correct
18 Correct 8 ms 5364 KB Output is correct
19 Correct 7 ms 5364 KB Output is correct
20 Correct 6 ms 5364 KB Output is correct
21 Correct 8 ms 5364 KB Output is correct
22 Correct 7 ms 5364 KB Output is correct
23 Correct 9 ms 5364 KB Output is correct
24 Correct 8 ms 5484 KB Output is correct

Subtask #2
46.666667 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 7292 KB Output is correct
2 Incorrect 56 ms 8316 KB Output isn't correct
3 Correct 46 ms 8316 KB Output is correct
4 Correct 66 ms 8440 KB Output is correct
5 Correct 32 ms 8440 KB Output is correct
6 Correct 33 ms 8440 KB Output is correct
7 Correct 55 ms 8440 KB Output is correct
8 Correct 66 ms 8440 KB Output is correct
9 Correct 80 ms 8440 KB Output is correct
10 Correct 243 ms 12668 KB Output is correct
11 Correct 102 ms 12668 KB Output is correct
12 Correct 119 ms 12668 KB Output is correct
13 Correct 119 ms 12668 KB Output is correct
14 Correct 58 ms 12668 KB Output is correct
15 Correct 123 ms 12668 KB Output is correct
16 Correct 101 ms 12668 KB Output is correct
17 Correct 111 ms 12668 KB Output is correct
18 Correct 157 ms 12668 KB Output is correct
19 Correct 204 ms 12668 KB Output is correct
20 Correct 300 ms 15108 KB Output is correct
21 Correct 167 ms 15108 KB Output is correct
22 Correct 155 ms 15108 KB Output is correct
23 Correct 157 ms 15108 KB Output is correct
24 Correct 162 ms 15108 KB Output is correct
25 Correct 175 ms 15108 KB Output is correct
26 Correct 147 ms 15108 KB Output is correct
27 Correct 247 ms 15108 KB Output is correct
28 Correct 225 ms 15108 KB Output is correct
29 Correct 215 ms 15108 KB Output is correct
30 Correct 307 ms 15740 KB Output is correct
31 Correct 212 ms 15740 KB Output is correct
32 Correct 205 ms 15740 KB Output is correct
33 Correct 213 ms 15740 KB Output is correct
34 Correct 239 ms 15740 KB Output is correct
35 Correct 235 ms 15740 KB Output is correct
36 Correct 183 ms 15740 KB Output is correct
37 Correct 191 ms 15740 KB Output is correct
38 Correct 276 ms 15740 KB Output is correct
39 Correct 329 ms 15740 KB Output is correct
40 Correct 360 ms 16448 KB Output is correct
41 Correct 471 ms 18748 KB Output is correct