Submission #744637

#	Time	Username	Problem	Language	Result	Execution time	Memory
744637		MohamedAhmed04	Kutije (COCI21_kutije)	C++14	70 / 70	161 ms	13832 KiB

Main

#include <bits/stdc++.h>

using namespace std ;

const int MAX = 1000 + 10 ;

int arr[MAX] ;
int n , m , q ;

vector< vector<int> >adj(MAX) ;

int val[MAX] ;

void dfs(int node)
{
	for(auto &child : adj[node])
	{
		if(!val[child])
			val[child] = val[node] , dfs(child) ;
	}
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m>>q ;
	for(int i = 1 ; i <= m ; ++i)
	{
		for(int i = 1 ; i <= n ; ++i)
		{
			int x ;
			cin>>x ;
			adj[x].push_back(i) ;
		}
	}
	for(int i = 1 ; i <= n ; ++i)
	{
		if(val[i])
			continue ;
		val[i] = i , dfs(i) ;
	}
	while(q--)
	{
		int x , y ;
		cin>>x>>y ;
		if(val[x] == val[y])
			cout<<"DA\n" ;
		else
			cout<<"NE\n" ;
	}
	return 0 ;
}		

• Subtask 1: 15 / 15
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 35 / 35