oj.uz

답안 #1102508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102508 2024-10-18T08:11:55 Z EkinOnal Kutije (COCI21_kutije) C++17
70 / 70
 136 ms 5828 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<int> e; void init(int N) { e = vector<int>(N,-1);}
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int 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;
int n,m,q,a,b;
int32_t main(){
	ios_base::sync_with_stdio(0); cin.tie(0);		
	scanf("%d %d %d",&n,&m,&q);

	t.init(n*m+2);
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&a); 
			t.unite(j,a);
		}
	}
	while(q--){
		scanf("%d %d",&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:22:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  scanf("%d %d %d",&n,&m,&q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
Main.cpp:27:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |    scanf("%d",&a);
      |    ~~~~~^~~~~~~~~
Main.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |   scanf("%d %d",&a,&b);
      |   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 1864 KB Output is correct
2 Correct 55 ms 1608 KB Output is correct
3 Correct 51 ms 1608 KB Output is correct
4 Correct 59 ms 1864 KB Output is correct
5 Correct 88 ms 1864 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 2 ms 336 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 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 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 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 1864 KB Output is correct
2 Correct 55 ms 1608 KB Output is correct
3 Correct 51 ms 1608 KB Output is correct
4 Correct 59 ms 1864 KB Output is correct
5 Correct 88 ms 1864 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 2 ms 500 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 496 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 2 ms 336 KB Output is correct
16 Correct 2 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 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 2 ms 336 KB Output is correct
26 Correct 114 ms 5704 KB Output is correct
27 Correct 116 ms 5704 KB Output is correct
28 Correct 91 ms 4684 KB Output is correct
29 Correct 111 ms 5448 KB Output is correct
30 Correct 136 ms 5192 KB Output is correct
31 Correct 110 ms 5192 KB Output is correct
32 Correct 110 ms 5704 KB Output is correct
33 Correct 119 ms 5720 KB Output is correct
34 Correct 132 ms 5652 KB Output is correct
35 Correct 133 ms 5828 KB Output is correct