# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1136129 | banh@@notpro33 | Džumbus (COCI19_dzumbus) | C++20 | 39 ms | 33092 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define fi first
#define se second
#define pii pair<int, int>
#define pb push_back
#define eb emplace_back
#define task "file"
const int nmax = 1005;
int dp[nmax][nmax][2][2], sz[nmax], d[nmax], vis[nmax], n, m;
int res[nmax];
vector<int> adj[nmax];
class DSU
{
private:
vector<int> parent, rank;
public:
DSU(int n)
{
parent.resize(n + 1);
rank.resize(n + 1, 0);
for (int i = 0; i <= n; i++)
{
parent[i] = 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... |