oj.uz

Submission #1102512

# Submission time Handle Problem Language Result Execution time Memory
1102512 2024-10-18T08:14:44 Z EkinOnal Kutije (COCI21_kutije) C++17
70 / 70
 136 ms 1876 KB 
//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
using namespace std;

struct DSU {
	vector<short> e; void init(short N) { e = vector<short>(N,-1);}
	short get(short x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(short a, short b) { return get(a) == get(b); }
	short size(short x) { return -e[get(x)]; }
	bool unite(short x, short y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x;  return 1;
	}
};

DSU t;
short n,m,a,b;
int q;
int32_t main(){
	ios_base::sync_with_stdio(0); cin.tie(0);		
	scanf("%hi %hi %d",&n,&m,&q);

	t.init(n+2);
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			scanf("%hi",&a); 
			t.unite(j,a);
		}
	}
	while(q--){
		scanf("%hi %hi",&a,&b);
		if(t.sameSet(a,b)) printf("DA\n");
		else printf("NE\n");
	}
 		
	return 0;	 			
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:23:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |  scanf("%hi %hi %d",&n,&m,&q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:28:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |    scanf("%hi",&a);
      |    ~~~~~^~~~~~~~~~
Main.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   scanf("%hi %hi",&a,&b);
      |   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 1864 KB Output is correct
2 Correct 56 ms 1636 KB Output is correct
3 Correct 56 ms 1608 KB Output is correct
4 Correct 71 ms 1864 KB Output is correct
5 Correct 68 ms 1872 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 504 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 1864 KB Output is correct
2 Correct 56 ms 1636 KB Output is correct
3 Correct 56 ms 1608 KB Output is correct
4 Correct 71 ms 1864 KB Output is correct
5 Correct 68 ms 1872 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 504 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 504 KB Output is correct
26 Correct 131 ms 1864 KB Output is correct
27 Correct 123 ms 1732 KB Output is correct
28 Correct 102 ms 1608 KB Output is correct
29 Correct 118 ms 1728 KB Output is correct
30 Correct 111 ms 1608 KB Output is correct
31 Correct 102 ms 1620 KB Output is correct
32 Correct 119 ms 1864 KB Output is correct
33 Correct 126 ms 1864 KB Output is correct
34 Correct 126 ms 1872 KB Output is correct
35 Correct 136 ms 1876 KB Output is correct