Submission #82364

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
82364	2018-10-30 09:57:46	EntityIT	007 (CEOI14_007)	C++14	0 / 100	370 ms	16636 KiB

007

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
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef pair<int, int> ii;
const int N = 2e5 + 5, inf = 1e9 + 123;
int n, m, src[2], a[2], d[2][N], l = -1, r = 6e5 + 5;
vector<int> gr[N];
void dijkstra (bool _) {
    for (int i = 1; i <= n; ++i) d[_][i] = inf;
    d[_][ src[_] ] = 0;
    priority_queue<ii, vector<ii>, greater<ii> > pq; pq.push(ii(d[_][ src[_] ], src[_]) );
    while (!pq.empty() ) {
        ii tmp = pq.top(); pq.pop();
        int u = tmp.se;
        if (tmp.fi > d[_][u]) continue ;
        for (int v : gr[u]) {
            if (d[_][v] > d[_][u] + 1) {
                d[_][v] = d[_][u] + 1;
                pq.push(ii(d[_][v], v) );
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70