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