# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65019 | zadrga | 007 (CEOI14_007) | C++14 | 475 ms | 102504 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.
// 14.25
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1 << 27)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 200111
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
int da[maxn], db[maxn];
vector<int> adj[maxn];
void BFS(int zac, int d[]){
for(int i = 0; i < maxn; i++)
d[i] = INF;
queue<int> q;
d[zac] = 0;
q.push(zac);
while(!q.empty()){
int x = q.front();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |