# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1058879 | Thanhs | Kutije (COCI21_kutije) | C++14 | 117 ms | 9556 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.
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define endl '\n'
#define fastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define setmin(x, y) x = min((x), (y))
#define setmax(x, y) x = max((x), (y))
#define sqr(x) ((x) * (x))
#define fi first
#define se second
#define all(x) x.begin(), x.end()
// mt19937 hdp(chrono::high_resolution_clock::now().time_since_epoch().count());
// int rand(int l, int r){return l + ((hdp() % (r - l + 1)) + r - l + 1) % (r - l + 1);}
const int NM = 1e3 + 5;
const int inf = 1e9;
int p[NM], n, m, q;
int find(int u) {return p[u] < 0 ? u : p[u] = find(p[u]);}
void join(int u, int v)
{
u = find(u), v = find(v);
if (u == v)
return;
if (p[u] > p[v])
swap(u, v);
p[u] += p[v];
p[v] = u;
}
void solve()
{
memset(p, -1, sizeof p);
cin >> n >> m >> q;
while (m--)
{
for (int i = 1; i <= n; i++)
{
int j;
cin >> j;
join(i, j);
}
}
while (q--)
{
int u, v;
cin >> u >> v;
cout << (find(u) == find(v) ? "DA" : "NE") << endl;
}
}
signed main()
{
fastIO
if (fopen("in.txt", "r"))
{
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
int tc = 1;
// cin >> tc;
while (tc--)
solve();
}
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... |