304 North Cardinal St.
Dorchester Center, MA 02124

# Dish Owner CodeChef Solution

## Dish Owner CodeChef Solution in C++17

``````
#include<bits/stdc++.h>
using namespace std;
#define all(arr) arr.begin(),arr.end()
#define rep(i,s,e) for(int i=s;i<e;i++)
#define lli long long int
#define ll long long
const ll INF=1e18;
const int mod=1e9+7;
int find(int a,vector<int>&rank){
if(a==rank[a]){return a;}
return rank[a]=find(rank[a],rank);
}
void uni(int a,int b,vector<int>&arr,vector<int>&rank){
a=find(a,rank);
b=find(b,rank);
if(a==b){cout<<"Invalid query!\n";}
else if(arr[a]>arr[b]){
rank[b]=a;
}
else if(arr[a]<arr[b]){
rank[a]=b;
}
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t;cin>>t;
while(t--){
int n;cin>>n;
vector<int>rank(n),point(n,0);
for(int i=0;i<n;i++){rank[i]=i;}
vector<int>arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
int q;cin>>q;
while(q--){
int type;cin>>type;
if(type==0){
int in1,in2;cin>>in1>>in2;
uni(in1-1,in2-1,arr,rank);
}
else{
int in;cin>>in;
cout<<find(in-1,rank)+1<<"\n";
}
}
}
return 0;
}``````

## Dish Owner CodeChef Solution in C++14

``````#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

using namespace std;

struct PairHash {inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }};

// speed
#define Code ios_base::sync_with_stdio(false);
#define By ios::sync_with_stdio(0);
#define Sumfi cout.tie(NULL);

// alias
using ll = long long;
using ld = long double;
using ull = unsigned long long;

// constants
const ld PI = 3.14159265358979323846;  /* pi */
const ll INF = 1e18;
const ld EPS = 1e-9;
const ll MAX_N = 202020;
const ll mod = 1e9 + 7;

// typedef
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef array<ll,3> all3;
typedef array<ll,5> all5;
typedef vector<all3> vall3;
typedef vector<all5> vall5;
typedef vector<ld> vld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef deque<ll> dqll;
typedef deque<pll> dqpll;
typedef pair<string, string> pss;
typedef vector<pss> vpss;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef unordered_set<ll> usll;
typedef unordered_set<pll, PairHash> uspll;
typedef unordered_map<ll, ll> umll;
typedef unordered_map<pll, ll, PairHash> umpll;

// macros
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,m,n) for(ll i=n;i>=m;i--)
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define INF(a) memset(a,0x3f3f3f3f3f3f3f3fLL,sizeof(a))
#define ASCEND(a) iota(all(a),0)
#define sz(x) ll((x).size())
#define BIT(a,i) (a & (1ll<<i))
#define BITSHIFT(a,i,n) (((a<<i) & ((1ll<<n) - 1)) | (a>>(n-i)))
#define pyes cout<<"Yes\n";
#define pno cout<<"No\n";
#define endl "\n"
#define pneg1 cout<<"-1\n";
#define ppossible cout<<"Possible\n";
#define pimpossible cout<<"Impossible\n";
#define TC(x) cout<<"Case #"<<x<<": ";
#define X first
#define Y second

// utility functions
template <typename T>
void print(T &&t)  { cout << t << "\n"; }
template<typename T>
void printv(vector<T>v){ll n=v.size();rep(i,0,n){cout<<v[i];if(i+1!=n)cout<<' ';}cout<<endl;}
template<typename T>
void printvln(vector<T>v){ll n=v.size();rep(i,0,n)cout<<v[i]<<endl;}
void fileIO(string in = "input.txt", string out = "output.txt") {freopen(in.c_str(),"r",stdin); freopen(out.c_str(),"w",stdout);}
template<typename T>
template<typename T, typename U>
template<typename T, typename U>

struct Combination {
vll fac, inv;
ll n, MOD;

ll modpow(ll n, ll x, ll MOD = mod) { if(!x) return 1; ll res = modpow(n,x>>1,MOD); res = (res * res) % MOD; if(x&1) res = (res * n) % MOD; return res; }

Combination(ll _n, ll MOD = mod): n(_n + 1), MOD(MOD) {
inv = fac = vll(n,1);
rep(i,1,n) fac[i] = fac[i-1] * i % MOD;
inv[n - 1] = modpow(fac[n - 1], MOD - 2, MOD);
rrep(i,1,n - 2) inv[i] = inv[i + 1] * (i + 1) % MOD;
}

ll fact(ll n) {return fac[n];}
ll nCr(ll n, ll r) {
if(n < r or n < 0 or r < 0) return 0;
return fac[n] * inv[r] % MOD * inv[n-r] % MOD;
}
};

struct Matrix {
ll r,c;
vvll matrix;
Matrix(ll r, ll c, ll v = 0): r(r), c(c), matrix(vvll(r,vll(c,v))) {}

Matrix operator*(const Matrix& B) const {
Matrix res(r, B.c);
rep(i,0,r) rep(j,0,B.c) rep(k,0,B.r) {
res.matrix[i][j] = (res.matrix[i][j] + matrix[i][k] * B.matrix[k][j] % mod) % mod;
}
return res;
}

Matrix copy() {
Matrix copy(r,c);
copy.matrix = matrix;
return copy;
}

Matrix pow(ll n) {
assert(r == c);
Matrix res(r,r);
Matrix now = copy();
rep(i,0,r) res.matrix[i][i] = 1;
while(n) {
if(n & 1) res = res * now;
now = now * now;
n /= 2;
}
return res;
}
};

// geometry data structures
template <typename T>
struct Point {
T y,x;
Point(T y, T x) : y(y), x(x) {}
Point(pair<T,T> p) : y(p.first), x(p.second) {}
Point() {}
void input() {cin>>y>>x;}
friend ostream& operator<<(ostream& os, const Point<T>& p) { os<<p.y<<' '<<p.x<<'\n'; return os;}
Point<T> operator+(Point<T>& p) {return Point<T>(y + p.y, x + p.x);}
Point<T> operator-(Point<T>& p) {return Point<T>(y - p.y, x - p.x);}
Point<T> operator*(ll n) {return Point<T>(y*n,x*n); }
Point<T> operator/(ll n) {return Point<T>(y/n,x/n); }
bool operator<(const Point &other) const {if (x == other.x) return y < other.y;return x < other.x;}
Point<T> rotate(Point<T> center, ld angle) {
ld si = sin(angle * PI / 180.), co = cos(angle * PI / 180.);
ld y = this->y - center.y;
ld x = this->x - center.x;

return Point<T>(y * co - x * si + center.y, y * si + x * co + center.x);
}
ld distance(Point<T> other) {
T dy = abs(this->y - other.y);
T dx = abs(this->x - other.x);
return sqrt(dy * dy + dx * dx);
}

T norm() { return x * x + y * y; }
};

template<typename T>
struct Line {
Point<T> A, B;
Line(Point<T> A, Point<T> B) : A(A), B(B) {}
Line() {}

void input() {
A = Point<T>();
B = Point<T>();
A.input();
B.input();
}

T ccw(Point<T> &a, Point<T> &b, Point<T> &c) {
T res = a.x * b.y + b.x * c.y + c.x * a.y;
res -= (a.x * c.y + b.x * a.y + c.x * b.y);
return res;
}

bool isIntersect(Line<T> o) {
T p1p2 = ccw(A,B,o.A) * ccw(A,B,o.B);
T p3p4 = ccw(o.A,o.B,A) * ccw(o.A,o.B,B);
if (p1p2 == 0 && p3p4 == 0) {
pair<T,T> p1(A.y, A.x), p2(B.y,B.x), p3(o.A.y, o.A.x), p4(o.B.y, o.B.x);
if (p1 > p2) swap(p2, p1);
if (p3 > p4) swap(p3, p4);
return p3 <= p2 && p1 <= p4;
}
return p1p2 <= 0 && p3p4 <= 0;
}

pair<bool,Point<ld>> intersection(Line<T> o) {
if(!this->intersection(o)) return {false, {}};
ld det = 1. * (o.B.y-o.A.y)*(B.x-A.x) - 1.*(o.B.x-o.A.x)*(B.y-A.y);
ld t = ((o.B.x-o.A.x)*(A.y-o.A.y) - (o.B.y-o.A.y)*(A.x-o.A.x)) / det;
return {true, {A.y + 1. * t * (B.y - A.y), B.x + 1. * t * (B.x - A.x)}};
}

//@formula for : y = ax + b
//@return {a,b};
pair<ld, ld> formula() {
T y1 = A.y, y2 = B.y;
T x1 = A.x, x2 = B.x;
if(y1 == y2) return {1e9, 0};
if(x1 == x2) return {0, 1e9};
ld a = 1. * (y2 - y1) / (x2 - x1);
ld b = -x1 * a + y1;
return {a, b};
}
};

template<typename T>
struct Circle {
Point<T> center;
Circle() {}

void input() {
center = Point<T>();
center.input();
}

bool circumference(Point<T> p) {
return (center.x - p.x) * (center.x - p.x) + (center.y - p.y) * (center.y - p.y) == radius * radius;
}

bool intersect(Circle<T> c) {
T d = (center.x - c.center.x) * (center.x - c.center.x) + (center.y - c.center.y) * (center.y - c.center.y);
}

bool include(Circle<T> c) {
T d = (center.x - c.center.x) * (center.x - c.center.x) + (center.y - c.center.y) * (center.y - c.center.y);
}
};

ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
all3 __exgcd(ll x, ll y) { if(!y) return {x,1,0}; auto [g,x1,y1] = __exgcd(y, x % y); return {g, y1, x1 - (x/y) * y1}; }
ll __lcm(ll x, ll y) { return x / __gcd(x,y) * y; }
ll modpow(ll n, ll x, ll MOD = mod) { n%=MOD; if(!x) return 1; ll res = modpow(n,x>>1,MOD); res = (res * res) % MOD; if(x&1) res = (res * n) % MOD; return res; }

ll uf[10101];

ll find(ll u) {
return uf[u] == u ? u : uf[u] = find(uf[u]);
}

void uni(ll u, ll v) {
ll pu = find(u), pv = find(v);
uf[pv] = pu;
}

vs solve(ll n, vll A, vall3 Q) {
ASCEND(uf);
vs res;
umll mp;
rep(i,0,sz(Q)) {
auto [op, a, b] = Q[i];
if(op == 1) res.push_back(to_string(find(a - 1) + 1));
else {
auto pa = find(a - 1), pb = find(b - 1);
if(pa == pb) res.push_back("Invalid query!");
else {
if(A[pa] == A[pb]) continue;
else if(A[pa] < A[pb]) uni(pb,pa);
else if(A[pa] > A[pb]) uni(pa,pb);
}
}
}
return res;
}

int main() {
Code By Sumfi
cout.precision(12);
ll tc = 1;
cin>>tc;
rep(i,1,tc+1) {
ll n,q;
cin>>n;
vll A(n);
cin>>q;
vall3 Q(q);
rep(i,0,q) {
cin>>Q[i][0]>>Q[i][1];
if(Q[i][0] == 0) cin>>Q[i][2];
}
printvln(solve(n,A,Q));
}
return 0;
}``````

## Dish Owner CodeChef Solution in PYTH 3

``````from sys import setrecursionlimit
setrecursionlimit(int(1e6))

class DSU:
def __init__(self, s):
self.p = [-(i+1) for i in s]

def find(self, n):
if(self.p[n] < 0):
return n
self.p[n] = self.find(self.p[n])
return self.p[n]

def union(self, a, b):
a = self.find(a)
b = self.find(b)

if(a == b):
print('Invalid query!')
elif(self.p[a] == self.p[b]):
return
elif (self.p[a] < self.p[b]):
self.p[a] = min(self.p[a],self.p[b])
self.p[b] = a
else:
self.p[b] = min(self.p[a],self.p[b])
self.p[a] = b

t = int(input())
for _ in range(t):
n = int(input())
s = list(map(int,input().split()))
d = DSU(s)
q = int(input())
for i in range(q):
a = list(map(int,input().split()))
if(a[0] == 0):
d.union(a[1]-1,a[2]-1)
else:
print(d.find(a[1]-1)+1)``````

## Dish Owner CodeChef Solution in C

``````#include <stdio.h>
int main(void) {
long long int no[10100],c[10100],a,b,x,q,n,t,temp;
scanf("%lld",&t);
while(t--){
scanf("%lld",&n);
for(x=1;x<=n;x++){
scanf("%lld",&no[x]);
c[x]=x;
}
scanf("%lld",&q);
while(q--){
scanf("%lld",&x);
if(x==0){
scanf("%lld%lld",&a,&b);
temp=a;
while(c[temp]!=temp){
temp=c[temp];
}
c[a]=temp;
a=temp;
temp=b;
while(c[temp]!=temp){
temp=c[temp];
}
c[b]=temp;
b=temp;
if(a==b){
printf("Invalid query!\n");
}else if (no[a]!=no[b]){
if(no[a]>no[b]){
c[b]=a;
}else{
c[a]=b;
}
}
}else{
scanf("%lld",&a);
while(c[a]!=a){
a=c[a];
}
printf("%lld\n",a);
}
}
}
return 0;
}``````

## Dish Owner CodeChef Solution in JAVA

``````/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
public static void main (String[] args) throws java.lang.Exception
{
int n = sc.nextInt();
for(int i=0;i<n;i++){
int num = sc.nextInt();
int[] S = new int[num+1];
int x,y;
int[] parent = new int[num+1];
for(int j=0;j<=num;j++){
parent[j] = j;
}

for(int j=1;j<=num;j++){
S[j] = sc.nextInt();
}

int q = sc.nextInt();
for(int j=0;j<q;j++){
int query = sc.nextInt();
if(query==0){
x = sc.nextInt();
y = sc.nextInt();
union(x,y,parent,S);
}
else{
System.out.println(findParent(sc.nextInt(),parent));
}
}

}
}

static void union(int x,int y,int[] parent,int[] s){
x = findParent(x,parent);
y = findParent(y,parent);
if(findParent(x,parent)==findParent(y,parent)) {
System.out.println("Invalid query!");
return;
}

if(s[x]<s[y]) parent[x] = y;
else if(s[x]>s[y]) parent[y] = x;
}

static int findParent(int n, int[] parent){
if(n==parent[n]) return n;
return parent[n]=findParent(parent[n],parent);
}

StringTokenizer st;
}
String next(){
while(st==null || !st.hasMoreTokens()){
try {
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt(){
return Integer.parseInt(next());
}
long nextLong(){
return Long.parseLong(next());
}
double nextDouble(){
return Double.parseDouble(next());
}
String nextLine(){
String str="";
try {
} catch (Exception e) {
e.printStackTrace();
}
return str;
}
}
static class FastWriter {
private final BufferedWriter bw;

public FastWriter() {
this.bw = new BufferedWriter(new OutputStreamWriter(System.out));
}

public void print(Object object) throws IOException {
bw.append("" + object);
}

public void println(Object object) throws IOException {
print(object);
bw.append("\n");
}

public void close() throws IOException {
bw.close();
}
}
}``````

## Dish Owner CodeChef Solution in PYTH

``````def getp(n,L):
r = n
while r <> L[r][0]:
r = L[r][0]
# endwhile
L[n][0] = r
return r
# end fun
t = int(raw_input())
for i in range(t):
N = int(raw_input())
L = []
L.append([0,0])
st = raw_input().split()
for k in range(1,N+1):
n = int(st[k-1])
L.append([k,n])
# endfor k
Q = int(raw_input())
for k in range(Q):
st = raw_input().split()
if int(st[0]) == 1:
x = int(st[1])
r = getp(x,L)
print r
else:
x = int(st[1])
y = int(st[2])
n1 = getp(x,L)
n2 = getp(y,L)
if n1 == n2:
print 'Invalid query!'
else:
s1 = L[n1][1]
s2 = L[n2][1]
if s2 > s1:
n1,n2 = n2,n1
# endif
if s1 <> s2:
L[n2][0] = n1
# endif
# endif
# endif
# endfor k
# endfor i
``````

## Dish Owner CodeChef Solution in C#

``````using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Text;

namespace Practise
{
class Program
{
public static void Main(string[] args)
{
int T, N, Q, qId, x, y;
StringBuilder sb = new StringBuilder();

while (T-- > 0)
{
int[] S = new int[N];
int[] chefmap = new int[N];

for (int i = 0; i < N; i++)
{
S[i] = Convert.ToInt32(input[i]);
chefmap[i] = i;
}
while (Q-- > 0)
{
qId = int.Parse(query[0]);
x = int.Parse(query[1]);
x--;

int chefIdX = chefmap[x];
if (chefmap[chefIdX] != chefIdX)
{
int start = x;
while (chefmap[chefIdX] != chefIdX)
{
chefIdX = chefmap[chefIdX];
}
while (chefmap[start] != chefIdX)
{
int temp = chefmap[start];
chefmap[start] = chefIdX;
start = temp;
}
}

if (qId == 0)
{
y = int.Parse(query[2]);
y--;

int chefIdY = chefmap[y];
if (chefmap[chefIdY] != chefIdY)
{
int start = y;
while (chefmap[chefIdY] != chefIdY)
{
chefIdY = chefmap[chefIdY];
}
while (chefmap[start] != chefIdY)
{
int temp = chefmap[start];
chefmap[start] = chefIdY;
start = temp;
}
}

if (chefIdX == chefIdY)
{
sb.AppendLine("Invalid query!");
continue;
}
else
{
if (S[chefIdX] == S[chefIdY])
continue;

if (S[chefIdX] > S[chefIdY])
{
chefmap[chefIdY] = chefIdX;
}
else
{
chefmap[chefIdX] = chefIdY;
}
}
}
else
{
sb.AppendLine((chefIdX + 1).ToString());
}
}
}
Console.Write(sb.ToString());
}
}
}``````
##### Dish Owner CodeChef Solution Review:

In our experience, we suggest you solve this Dish Owner CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Dish Owner CodeChef Solution.

Find on CodeChef

##### Conclusion:

I hope this Dish Owner CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Programming Language in a business context; there are no prerequisites.

Keep Learning!