# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1156596 | beaconmc | Team Coding (EGOI24_teamcoding) | C++20 | 1951 ms | 42336 KiB |
#include <bits/stdc++.h>
typedef int ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
vector<basic_string<ll>> edges;
vector<ll> pref;
ll n,k;
ll timer = 0;
ll tin[100005];
ll tout[100005];
ll depth[100005];
unordered_map<ll, ll> stuff[100005];
vector<ll> depths[100005];
vector<ll> consider;
vector<ll> prefs[100005];
ll ans = -1, ans2 = 0;
void dfs(ll a, ll d){
depths[d].push_back(a);
depth[a] = d;
stuff[d][pref[a]] += 1;
tin[a] = timer;
timer += 1;
for (auto&i : edges[a]){
# | 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... |