oj.uz

Submission #505163

# Submission time Handle Problem Language Result Execution time Memory
505163 2022-01-10T20:09:53 Z nicecoder37 Kutije (COCI21_kutije) C++17
70 / 70
 234 ms 13368 KB 
/*MKAAN THE KING*/
#include <bits/stdc++.h>
#define space " "
#define endl "\n"
#define gcd __gcd
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define inf 1000000000
#define md 1000000007
#define li 1005
#define lo long long
using namespace std;
int n,m,Q,x,y,a,vis[li],renk[li];
vector<int> v[li];
void dfs(int node,int color){
	if(vis[node]) return ;
	vis[node]=1;
	renk[node]=color;
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i];
		if(vis[go]) continue;
		dfs(go,color);
	}
}
int main(){
	scanf("%d %d %d",&n,&m,&Q);
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&a);
			v[a].pb(j);
		}
	}
	for(int i=1;i<=n;i++) dfs(i,i);
	while(Q--){
		scanf("%d %d",&x,&y);
		if(renk[y]==renk[x]) printf("DA\n");
		else printf("NE\n");
	}
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |  scanf("%d %d %d",&n,&m,&Q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
Main.cpp:32:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |    scanf("%d",&a);
      |    ~~~~~^~~~~~~~~
Main.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |   scanf("%d %d",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 2124 KB Output is correct
2 Correct 106 ms 1856 KB Output is correct
3 Correct 77 ms 1776 KB Output is correct
4 Correct 104 ms 2100 KB Output is correct
5 Correct 102 ms 2016 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 312 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 3 ms 352 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 2124 KB Output is correct
2 Correct 106 ms 1856 KB Output is correct
3 Correct 77 ms 1776 KB Output is correct
4 Correct 104 ms 2100 KB Output is correct
5 Correct 102 ms 2016 KB Output is correct
6 Correct 2 ms 312 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 3 ms 352 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 356 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 179 ms 6608 KB Output is correct
27 Correct 182 ms 6620 KB Output is correct
28 Correct 153 ms 5960 KB Output is correct
29 Correct 202 ms 6656 KB Output is correct
30 Correct 168 ms 5580 KB Output is correct
31 Correct 165 ms 5828 KB Output is correct
32 Correct 184 ms 7956 KB Output is correct
33 Correct 188 ms 13368 KB Output is correct
34 Correct 205 ms 13360 KB Output is correct
35 Correct 234 ms 13304 KB Output is correct