# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58244 | evpipis | 007 (CEOI14_007) | C++14 | 915 ms | 16584 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
const int len = 2e5+5, inf = 1e9;
int dis[len], tim[len];
int n, m, s1, s2, t1, t2;
queue<int> myq;
vector<int> adj[len];
bool check(int x){
for (int i = 1; i <= n; i++)
dis[i] = inf;
if (0 < tim[s2]+x)
dis[s2] = 0, myq.push(s2);
while (!myq.empty()){
int u = myq.front();
myq.pop();
for (int j = 0; j < adj[u].size(); j++){
int v = adj[u][j];
if (dis[v] == inf && dis[u]+1 != tim[v]+x)
dis[v] = dis[u]+1, myq.push(v);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |