# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
213577 | SamAnd | Monthly railway pass (LMIO18_menesinis_bilietas) | C++17 | 696 ms | 86184 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 m_p make_pair
const int N = 500005;
int n, m;
vector<int> a[N];
vector<pair<int, int> > v;
int k;
int c[N];
void dfs(int x)
{
c[x] = k;
for (int i = 0; i < a[x].size(); ++i)
{
int h = a[x][i];
if (!c[h])
dfs(h);
}
}
int q[N];
set<int> s[N];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i)
{
Compilation message (stderr)
# | 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... |