oj.uz

Submission #579167

# Submission time Handle Problem Language Result Execution time Memory
579167 2022-06-18T12:37:23 Z Trisanu_Das Kutije (COCI21_kutije) C++17
0 / 70
 767 ms 5640 KB 
#include <bits/stdc++.h>
using namespace std;
 
int parent[1001];
 
int find(int u){
  if(u = parent[u]) return u;
  return parent[u] = find(parent[u]);
}
 
void join(int u, int v){
  u = find(u); v = find(v);
  if(u == v) return;
  parent[v] = u;
}
 
int main(){
  int n, m, q; cin >> n >> m >> q;
  for(int i = 1; i < n + 1; i++) parent[i] = i;
  for(int i = 1; i <= m; i++)
  {
		for(int j = 1; j <= n; j++)
		{
			int x; cin >> x;
			if(find(x) != find(j)) join(x, j);
		}
  }
  while(q--){
    int a, b; cin >> a >> b;
    if(find(a) == find(b)) cout << "DE\n"; else cout << "NE\n";
  }
}

Compilation message

Main.cpp: In function 'int find(int)':
Main.cpp:7:8: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    7 |   if(u = parent[u]) return u;
      |      ~~^~~~~~~~~~~

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 767 ms 5640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 767 ms 5640 KB Output isn't correct
2 Halted 0 ms 0 KB -