oj.uz

Submission #66080

# Submission time Handle Problem Language Result Execution time Memory
66080 2018-08-09T13:39:50 Z ikura355 007 (CEOI14_007) C++14
100 / 100
 534 ms 18820 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]);
//    printf("res = %d\n",res);
    if(d[0][a] == d[1][a] && d[0][b] == d[1][b]) {
        for(int i=1;i<=n;i++) p[i] = i;
        sort(&p[1],&p[n+1],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",max(0,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
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 6 ms 5092 KB Output is correct
3 Correct 7 ms 5168 KB Output is correct
4 Correct 6 ms 5244 KB Output is correct
5 Correct 6 ms 5244 KB Output is correct
6 Correct 6 ms 5244 KB Output is correct
7 Correct 6 ms 5244 KB Output is correct
8 Correct 7 ms 5320 KB Output is correct
9 Correct 7 ms 5320 KB Output is correct
10 Correct 6 ms 5320 KB Output is correct
11 Correct 6 ms 5320 KB Output is correct
12 Correct 6 ms 5320 KB Output is correct
13 Correct 6 ms 5320 KB Output is correct
14 Correct 6 ms 5320 KB Output is correct
15 Correct 8 ms 5320 KB Output is correct
16 Correct 6 ms 5356 KB Output is correct
17 Correct 7 ms 5356 KB Output is correct
18 Correct 8 ms 5484 KB Output is correct
19 Correct 7 ms 5484 KB Output is correct
20 Correct 7 ms 5484 KB Output is correct
21 Correct 7 ms 5484 KB Output is correct
22 Correct 8 ms 5484 KB Output is correct
23 Correct 8 ms 5484 KB Output is correct
24 Correct 8 ms 5484 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 7420 KB Output is correct
2 Correct 63 ms 8396 KB Output is correct
3 Correct 45 ms 8396 KB Output is correct
4 Correct 69 ms 8456 KB Output is correct
5 Correct 32 ms 8456 KB Output is correct
6 Correct 36 ms 8456 KB Output is correct
7 Correct 51 ms 8456 KB Output is correct
8 Correct 59 ms 8456 KB Output is correct
9 Correct 63 ms 8456 KB Output is correct
10 Correct 230 ms 12604 KB Output is correct
11 Correct 85 ms 12604 KB Output is correct
12 Correct 139 ms 12604 KB Output is correct
13 Correct 116 ms 12604 KB Output is correct
14 Correct 67 ms 12604 KB Output is correct
15 Correct 124 ms 12604 KB Output is correct
16 Correct 89 ms 12604 KB Output is correct
17 Correct 107 ms 12604 KB Output is correct
18 Correct 121 ms 12604 KB Output is correct
19 Correct 200 ms 12604 KB Output is correct
20 Correct 323 ms 14972 KB Output is correct
21 Correct 186 ms 14972 KB Output is correct
22 Correct 160 ms 14972 KB Output is correct
23 Correct 131 ms 14972 KB Output is correct
24 Correct 171 ms 14972 KB Output is correct
25 Correct 194 ms 14972 KB Output is correct
26 Correct 94 ms 14972 KB Output is correct
27 Correct 191 ms 14972 KB Output is correct
28 Correct 211 ms 14972 KB Output is correct
29 Correct 278 ms 14972 KB Output is correct
30 Correct 340 ms 15764 KB Output is correct
31 Correct 222 ms 15764 KB Output is correct
32 Correct 248 ms 15764 KB Output is correct
33 Correct 201 ms 15764 KB Output is correct
34 Correct 341 ms 15764 KB Output is correct
35 Correct 290 ms 15764 KB Output is correct
36 Correct 221 ms 15764 KB Output is correct
37 Correct 194 ms 15764 KB Output is correct
38 Correct 237 ms 15764 KB Output is correct
39 Correct 319 ms 15764 KB Output is correct
40 Correct 408 ms 16552 KB Output is correct
41 Correct 534 ms 18820 KB Output is correct