# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474649 | sean617 | 우호 조약 체결 (JOI14_friends) | C++98 | 85 ms | 13512 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 <cstdio>
#include <vector>
#include <queue>
#define N 100005
using namespace std;
typedef long long ll;
ll n, m, ans, bu[N], v[N], m1[N*2], m2[N*2], s[N];
vector<int> a[N];
queue<int> qu;
ll f(ll p) {
if (bu[p] == p) return p;
else return bu[p] = f(bu[p]);;
}
int main()
{
ll i, j, t, t1, t2, x1, x2;
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> t1 >> t2;
m1[i] = t1;
m2[i] = t2;
a[t1].push_back(t2);
}
for (i = 1; i <= n; i++) bu[i] = i;
for (i = 1; i <= n; i++) {
if (a[i].size() >= 2) {
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... |