# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1131927 | ALTAKEXE | Financial Report (JOI21_financial) | C++20 | 832 ms | 80272 KiB |
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define inf INT_MAX
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FAR(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x.begin(), x.end())
const int MOD = 1e9 + 7;
using namespace std;
struct UNI
{
int n;
vector<int> par, size;
vector<map<int, int>> mp;
UNI(int N) : n(N), par(n + 1), size(n + 1, 1), mp(n + 1)
{
for (int i = 1; i <= n; i++)
par[i] = i;
}
int find(int u)
{
if (u == par[u])
return u;
return par[u] = find(par[u]);
}
void uni(int a, int b)
{
a = find(a);
b = find(b);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |