# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209533 | model_code | Island (NOI18_island) | C++17 | 101 ms | 2812 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 int MAXN = 200004;
int N, M, cnt[MAXN], fac[MAXN];
int main() {
scanf("%d%d", &N, &M);
for (int i = 0, u, v; i < N+M-1; ++i) {
scanf("%d%d", &u, &v);
if (cnt[u-1]++ > 1)
printf("%d 1\n", cnt[u-1]-1);
if (cnt[v-1]++ > 1)
printf("%d 1\n", cnt[v-1]-1);
}
}
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... |