Submission #1022177

#	Time	Username	Problem	Language	Result	Execution time	Memory
1022177		vjudge1	Kutije (COCI21_kutije)	C++17	70 / 70	898 ms	2132 KiB

Main

#include<bits/stdc++.h>

using namespace std;

const int N = 1000 + 10;
int n, par[N];

int root(int x)
{
  if(par[x] == x) return x;
  return par[x] = root(par[x]);
}
void merge(int x, int y)
{
  x = root(x), y = root(y);
  if(x == y) return;
  par[x] = y;
}

int main()
{
  int n, m, q;
  cin >> n >> m >> q;

  iota(par, par + n + 1, 0);

  for(int i = 0; i < m ; i++)
    {
      for(int j = 1, pj; j <= n; j ++)
	{
	  cin >> pj;
	  merge(j, pj);
	}
    }

  while(q--)
    {
      int x, y;
      cin >> x >> y;
      cout << (root(x) == root(y) ? "DA" : "NE") << endl;
    }
  return 0;
}

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