# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99413 | nad312 | ICC (CEOI16_icc) | C++17 | 0 ms | 0 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.
#include<icc.h>
#include<bits/stdc++.h>
#define P pair<lli, lli>
#define mp make_pair
#define x first
#define y second
using namespace std;
typedef long long int lli;
const lli N=109;
lli n, dd[N], cnt, a[N], b[N];
deque<lli> D[N], p[N], q1, q2, cop;
void DFS(lli u)
{
p[cnt].push_back(u);
dd[u]=1;
for(auto v: D[u])
{
if(dd[v]==0)
{
DFS(v);
}
}
}
lli Add(lli x, lli y)
{
if(x==0)
{
for(auto v: p[y])
{