Submission #1591871


Source Code Expand

#include<bits/stdc++.h>
using namespace std;


#define INF 1000000005
typedef pair<int, int> P;


int N, Q;
vector< vector<int> > edges(100005);
int d[100005];

 
void dijkstra(int x) {
	for(int i=0;i<N+1;i++) d[i] = INF;
	priority_queue< P, vector<P>, greater<P> > q;
	d[x] = 0;
	q.push(P(0, x));
	while(!q.empty()){
		P p = q.top();
		q.pop();
		int dist = p.first;
		int u = p.second;
		for(int i = 0; i < edges[u].size(); i++){
			int v = edges[u][i];
			if(dist > d[v]) continue;
			if(d[v] > d[u] + 1) {
				d[v] = d[u] + 1;
				q.push(P(d[v], v));
			}
		}
	}
}
 
 
int main() {
	scanf("%d", &N);
	for(int i=0;i<N-1;i++){
		int u, v;
		scanf("%d %d", &u, &v);
		edges[u].push_back(v);
		edges[v].push_back(u);
	}
	
	scanf("%d", &Q);
	for(int i=0;i<Q;i++){
		int u, v;
		scanf("%d %d", &u, &v);
		dijkstra(u);
		printf("%d\n", d[v] + 1);
	}
	return 0;
}

Submission Info

Submission Time
Task D - 閉路
User jack
Language C++14 (GCC 5.4.1)
Score 30
Code Size 911 Byte
Status TLE
Exec Time 2104 ms
Memory 6500 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:37:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:40:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &u, &v);
                         ^
./Main.cpp:45:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
                 ^
./Main.cpp:48:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &u, &v);
                         ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
AC × 12
AC × 17
TLE × 10
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 2 ms 2560 KB
subtask0_sample02.txt AC 2 ms 2560 KB
subtask0_sample03.txt AC 2 ms 2560 KB
subtask1_01.txt AC 32 ms 6144 KB
subtask1_02.txt AC 31 ms 6144 KB
subtask1_03.txt AC 2 ms 2560 KB
subtask1_04.txt AC 2 ms 2560 KB
subtask1_05.txt AC 3 ms 2688 KB
subtask1_06.txt AC 3 ms 2560 KB
subtask1_07.txt AC 50 ms 6400 KB
subtask1_08.txt AC 49 ms 6400 KB
subtask1_09.txt AC 48 ms 6144 KB
subtask1_10.txt AC 48 ms 6144 KB
subtask1_11.txt AC 48 ms 6144 KB
subtask1_12.txt AC 47 ms 6144 KB
subtask2_01.txt TLE 2104 ms 6144 KB
subtask2_02.txt TLE 2104 ms 6144 KB
subtask2_03.txt AC 57 ms 2816 KB
subtask2_04.txt AC 616 ms 2816 KB
subtask2_05.txt TLE 2103 ms 2688 KB
subtask2_06.txt TLE 2103 ms 2816 KB
subtask2_07.txt TLE 2104 ms 6500 KB
subtask2_08.txt TLE 2104 ms 6408 KB
subtask2_09.txt TLE 2104 ms 6144 KB
subtask2_10.txt TLE 2104 ms 6144 KB
subtask2_11.txt TLE 2104 ms 6144 KB
subtask2_12.txt TLE 2104 ms 6144 KB