# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1123130 | SalihSahin | Game (IOI14_game) | C++20 | 1094 ms | 2632 KiB |
#include <bits/stdc++.h>
#define pb push_back
//#define int long long
using namespace std;
#include "game.h"
int N;
vector<int> par;
struct DSU{
vector<int> arr;
int option;
};
vector<DSU> dsuarr;
vector<vector<int> > edge;
int fnd(int a){
if(a == par[a]) return a;
else return par[a] = fnd(par[a]);
}
void merge(int a, int b){
int olda = a, oldb = b;
a = fnd(a), b = fnd(b);
int new_op = dsuarr[a].option + dsuarr[b].option - 2;
par[b] = a;
for(auto itr: dsuarr[b].arr){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |