oj.uz

답안 #534706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534706 2022-03-08T15:01:25 Z kappa Kutije (COCI21_kutije) C++14
0 / 70
 149 ms 9776 KB 
#include <bits/stdc++.h>
#define pii pair<long long, long long>
#define pb push_back
#define st first
#define nd second

using namespace std;

long long n, m, k, d[1005], s[1005][1005], ol[1005][1005], vis[1005];

set<int> st[1005];

unordered_map<int, vector<int> > mp;

int main(){
	scanf("%lld %lld %lld", &n, &m, &k);

	for (int i = 1; i <= m; ++i)
	{
		for (int j = 1; j <= n; ++j)
		{
			long long temp;
			scanf("%lld", &temp);
			//s[i][temp] = j;
			//st[temp].insert(j);
			mp[temp].pb(j);
		}
	}

	/*queue<pii> q;

	/*for (int i = 1; i <= n; ++i)
	{
		q.push({i, i});
	}

	//q.push({1, 1});

	while(!q.empty()){
		pii curr = q.front();
		q.pop();

		if(ol[curr.nd][curr.st]){
			continue;
		}

		ol[curr.nd][curr.st] = 1;

		for (int i = 1; i <= m; ++i)
		{
			q.push({s[i][curr.st], curr.nd});
		}
	}*/

	/*for (int i = 1; i <= n; ++i)
	{
		cout << i << " ";

		for (int j = 1; j <= n; ++j)
		{
			cout << ol[i][j];
		}

		cout << "\n";
	}*/

	while(k--){
		long long l, r;
		scanf("%lld %lld", &l, &r);

		/*if(ol[l][r]){
			printf("DA\n");
		}else{
			printf("NE\n");
		}*/

		if(ol[l][l] == 1){
			if(ol[l][r] == 1){
				cout << "DA\n";
			}else{
				cout << "NE\n";
			}
			continue;
		}

		queue<pii> q;

		q.push({l, l});

		while(!q.empty()){
			pii curr = q.front();
			q.pop();

			if(ol[curr.nd][curr.st]){
				continue;
			}

			ol[curr.nd][curr.st] = 1;
			ol[curr.st][curr.nd] = 1;

			for (auto i : mp[curr.st])
			{
				//cout << curr.st << " " << i << "\n";

				if(ol[curr.nd][i] == 0){
					q.push({i, curr.nd});
				}
			}
		}

		if(ol[l][r] == 0){
			cout << "NE\n";
		}else{
			cout << "DA\n";
		}

		memset(vis, 0, sizeof vis);
	}
}

Compilation message

Main.cpp:32:2: warning: "/*" within comment [-Wcomment]
   32 |  /*for (int i = 1; i <= n; ++i)
      |   
Main.cpp: In function 'int main()':
Main.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%lld %lld %lld", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:23:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |    scanf("%lld", &temp);
      |    ~~~~~^~~~~~~~~~~~~~~
Main.cpp:69:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |   scanf("%lld %lld", &l, &r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 149 ms 9776 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 4 ms 844 KB Output is correct
4 Correct 3 ms 944 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 5 ms 972 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 3 ms 844 KB Output is correct
10 Incorrect 2 ms 844 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 4 ms 844 KB Output is correct
4 Correct 3 ms 944 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 5 ms 972 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 3 ms 844 KB Output is correct
10 Incorrect 2 ms 844 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 149 ms 9776 KB Output isn't correct
2 Halted 0 ms 0 KB -