oj.uz

답안 #29984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
29984 2017-07-21T11:37:17 Z PrOAhMeT 007 (CEOI14_007) C++14
9 / 100
 1000 ms 20516 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;

const int MAXN=200005;
int n,m,dis[4][MAXN],s,d,a,b,t,tt,vis[MAXN];
vector<int> v[MAXN];

void bfs(int start,int wait,int u) {

	memset(dis[u],-1,sizeof dis[u]);
	queue<int> q;
	dis[u][start]=0;
	int x,y;
	q.push(start);
	while(!q.empty()) {
		x=q.front();
		q.pop();
		for(int i=0;i<v[x].size();++i) {
			y=v[x][i];
			if(dis[u][y]==-1) {
				dis[u][y]=dis[u][x]+1;
				q.push(y);
			}
		}
	}

}

void go(int x,int d1,int d2) {

	vis[x]=1;
	for(int i=0;i<v[x].size();++i) {
		int y=v[x][i];
		if(dis[d1][y]<dis[d1][x]&&dis[d2][y]<dis[d1][x])
			go(y,d1,d2);
	}

}

int main() {

	scanf("%d %d",&n,&m);
	scanf("%d %d %d %d",&s,&d,&a,&b);
	for(int i=0;i<m;++i) {
		scanf("%d %d",&t,&tt);
		v[t].pb(tt);
		v[tt].pb(t);
	}
	int l=0,r=n,ans=-1,md;
	bfs(d,0,1);
	bfs(s,0,0);
	bfs(a,0,2);
	bfs(b,0,3);
	if(dis[0][a]>dis[1][a]||dis[0][b]>dis[1][b])
		cout<<-1<<endl;
	else if(!((dis[1][a]-dis[0][a]==dis[1][b]-dis[0][b])&&dis[0][a]==dis[0][b])){
		cout<<min(dis[1][a]-dis[0][a],dis[1][b]-dis[0][b])<<endl;
	}
	else {
		go(s,2,3);
		if(vis[a]==0||vis[b]==0) {
			cout<<dis[1][a]-dis[0][a]-1<<endl;
		}
		else cout<<dis[1][a]-dis[0][a]<<endl;
	}

}

Compilation message

007.cpp: In function 'void bfs(int, int, int)':
007.cpp:25:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<v[x].size();++i) {
                ^
007.cpp: In function 'void go(int, int, int)':
007.cpp:39:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<v[x].size();++i) {
               ^
007.cpp: In function 'int main()':
007.cpp:56:6: warning: unused variable 'l' [-Wunused-variable]
  int l=0,r=n,ans=-1,md;
      ^
007.cpp:56:10: warning: unused variable 'r' [-Wunused-variable]
  int l=0,r=n,ans=-1,md;
          ^
007.cpp:56:14: warning: unused variable 'ans' [-Wunused-variable]
  int l=0,r=n,ans=-1,md;
              ^
007.cpp:56:21: warning: unused variable 'md' [-Wunused-variable]
  int l=0,r=n,ans=-1,md;
                     ^
007.cpp:49:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
                      ^
007.cpp:50:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d",&s,&d,&a,&b);
                                  ^
007.cpp:52:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&t,&tt);
                        ^

Subtask #1
9.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 10616 KB Output is correct
2 Correct 0 ms 10616 KB Output is correct
3 Partially correct 3 ms 10616 KB Partially correct
4 Correct 3 ms 10616 KB Output is correct
5 Correct 0 ms 10616 KB Output is correct
6 Partially correct 0 ms 10616 KB Partially correct
7 Partially correct 3 ms 10616 KB Partially correct
8 Correct 3 ms 10616 KB Output is correct
9 Partially correct 6 ms 10616 KB Partially correct
10 Correct 0 ms 10616 KB Output is correct
11 Correct 0 ms 10616 KB Output is correct
12 Correct 0 ms 10616 KB Output is correct
13 Partially correct 3 ms 10616 KB Partially correct
14 Correct 3 ms 10616 KB Output is correct
15 Partially correct 0 ms 10616 KB Partially correct
16 Correct 3 ms 10616 KB Output is correct
17 Correct 0 ms 10616 KB Output is correct
18 Correct 0 ms 10616 KB Output is correct
19 Partially correct 3 ms 10616 KB Partially correct
20 Partially correct 3 ms 10616 KB Partially correct
21 Correct 6 ms 10616 KB Output is correct
22 Partially correct 6 ms 10616 KB Partially correct
23 Partially correct 0 ms 10616 KB Partially correct
24 Correct 0 ms 10616 KB Output is correct

Subtask #2
0.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 33 ms 11936 KB Partially correct
2 Correct 43 ms 12560 KB Output is correct
3 Partially correct 23 ms 11936 KB Partially correct
4 Correct 33 ms 12688 KB Output is correct
5 Correct 33 ms 11804 KB Output is correct
6 Correct 33 ms 12068 KB Output is correct
7 Partially correct 43 ms 12200 KB Partially correct
8 Partially correct 39 ms 12200 KB Partially correct
9 Execution timed out 1000 ms 12596 KB Execution timed out
10 Execution timed out 1000 ms 16820 KB Execution timed out
11 Correct 106 ms 13520 KB Output is correct
12 Partially correct 89 ms 14180 KB Partially correct
13 Correct 96 ms 13652 KB Output is correct
14 Correct 76 ms 13256 KB Output is correct
15 Partially correct 106 ms 14312 KB Partially correct
16 Correct 73 ms 14444 KB Output is correct
17 Partially correct 116 ms 14048 KB Partially correct
18 Correct 113 ms 14048 KB Output is correct
19 Execution timed out 1000 ms 15236 KB Execution timed out
20 Execution timed out 1000 ms 18008 KB Execution timed out
21 Correct 133 ms 16060 KB Output is correct
22 Partially correct 163 ms 14972 KB Partially correct
23 Correct 159 ms 15632 KB Output is correct
24 Partially correct 153 ms 15832 KB Partially correct
25 Correct 89 ms 15236 KB Output is correct
26 Correct 116 ms 14972 KB Output is correct
27 Partially correct 163 ms 15632 KB Partially correct
28 Partially correct 209 ms 15632 KB Partially correct
29 Execution timed out 1000 ms 16424 KB Execution timed out
30 Execution timed out 1000 ms 18536 KB Execution timed out
31 Correct 173 ms 17112 KB Output is correct
32 Partially correct 223 ms 15632 KB Partially correct
33 Correct 183 ms 15764 KB Output is correct
34 Correct 173 ms 16028 KB Output is correct
35 Correct 179 ms 16156 KB Output is correct
36 Correct 189 ms 16832 KB Output is correct
37 Correct 229 ms 16688 KB Output is correct
38 Partially correct 243 ms 16556 KB Partially correct
39 Partially correct 303 ms 16556 KB Partially correct
40 Execution timed out 1000 ms 18272 KB Execution timed out
41 Execution timed out 1000 ms 20516 KB Execution timed out