# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522232 | blue | Cijanobakterije (COCI21_cijanobakterije) | C++17 | 78 ms | 12916 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 <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using vi = vector<int>;
using ll = long long;
#define sz(x) int(x.size())
const int mx = 100'000;
vi edge[1+mx];
int n, m;
int res = 0;
vi visit(1+mx, 0);
vector< pair<int, int> > V; //dist, node
void dfs(int u, int d)
{
// cerr << "dfs " << u << ' ' << d << '\n';
V.push_back({-d, u});
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |