CS Academy - Submission

C++2.1 KB

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include "bits/stdc++.h"
using namespace std;
const int N = 1104;
int mtx[N][N], vis[N], dis[N], low[N];
int parent[N];
vector< int > g[N];
void dfs( int u, int par, int dep )
{
        //cout<<u<<endl;
        vis[u] = 1;
        dis[u] = low[u] = dep;
        for(auto v : g[u]) {
                if( vis[v] && v != par )
                        low[u] = min(low[u], dis[v]);
                if(!vis[v]) {
                        dfs(v, u, dep + 1);
                        low[u] = min( low[u], low[v] );
                        if( low[v] > dis[u] ) {
                                mtx[u][v] = 1;
                                mtx[v][u] = 1;
                        }
                }
        }
}
int main()
{
        int n, m, qq;
        scanf("%d %d %d", &n, &m, &qq);
        for(int i = 0; i < m; i++) {
                int x, y; scanf("%d %d", &x, &y);
                g[x].push_back(y), g[y].push_back(x);
        }
        dfs(1, 0, 0);
        while(qq--) {
                int from, to;
                scanf("%d %d", &from, &to);
                memset(vis, 0, sizeof vis);
                queue< int> q;
                q.push(from);
                vis[from] = 1;
                parent[from] = from;
                while(!q.empty()) {
                        int top = q.front(); q.pop();
                        for(auto v : g[top]) {
                                if(vis[v]) continue;
                                vis[v]=1;
                                parent[v] = top;
                                q.push(v);
                        }
                }
                int pos = to;
                int ans = 1;
                while( parent[pos] != pos ) {
                        if( mtx[ parent[pos] ][pos] == 0 ) {
                                ans = 0;
                                break;
                        }
                        pos = parent[pos];
                }
                printf("%d\n", ans);
        }
        return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Summary

User: Ashini Singha

Verdict: 100 points

Language: C++

CPU Time usage: 32 ms

Memory usage: 4572 KB

Source code: 2.1 KB

Compilation

Compilation done in 2.112 seconds.

Results

Test Number	CPU Usage	Memory Usage	Result
21	24 ms	4476 KB	OK
20	21 ms	4344 KB	OK
19	21 ms	4356 KB	OK
18	21 ms	4232 KB	OK
17	16 ms	632 KB	OK
16	20 ms	2428 KB	OK
15	24 ms	3572 KB	OK
14	27 ms	4572 KB	OK
13	22 ms	4068 KB	OK
12	32 ms	4240 KB	OK
11	20 ms	3820 KB	OK
10	23 ms	3948 KB	OK
9	23 ms	3728 KB	OK
8	22 ms	2756 KB	OK
7	13 ms	2180 KB	OK
6	12 ms	1560 KB	OK
5	5 ms	908 KB	OK
4	7 ms	844 KB	OK
3	7 ms	760 KB	OK
2	6 ms	672 KB	OK
1	6 ms	668 KB	OK
0	8 ms	644 KB	OK