# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541827 | Lobo | 007 (CEOI14_007) | C++17 | 264 ms | 34836 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;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxn = 2e5+10;
int n, m, a,b,s1,s2;
int d[maxn][5];
vector<int> g[maxn];
void bfs(int beg, int id) {
for(int i = 1; i <= n; i++) {
d[i][id] = inf;
}
d[beg][id] = 0;
queue<int> q; q.push(beg);
while(q.size()) {
int u = q.front();
q.pop();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |