oj.uz

답안 #534707

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534707 2022-03-08T15:04:41 Z kappa Kutije (COCI21_kutije) C++14
35 / 70
 1000 ms 13588 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(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);

	cin >> n >> m >> k;

	for (int i = 1; i <= m; ++i)
	{
		for (int j = 1; j <= n; ++j)
		{
			long long temp;
			cin >> 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;
		cin >> 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:35:2: warning: "/*" within comment [-Wcomment]
   35 |  /*for (int i = 1; i <= n; ++i)
      |

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 9796 KB Output is correct
2 Correct 108 ms 9080 KB Output is correct
3 Correct 92 ms 8768 KB Output is correct
4 Correct 197 ms 9896 KB Output is correct
5 Correct 90 ms 7780 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 6 ms 716 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 6 ms 716 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 9 ms 716 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 7 ms 760 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 9796 KB Output is correct
2 Correct 108 ms 9080 KB Output is correct
3 Correct 92 ms 8768 KB Output is correct
4 Correct 197 ms 9896 KB Output is correct
5 Correct 90 ms 7780 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 6 ms 716 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 6 ms 716 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 9 ms 716 KB Output is correct
19 Correct 3 ms 716 KB Output is correct
20 Correct 2 ms 616 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 7 ms 760 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Execution timed out 1075 ms 13588 KB Time limit exceeded
27 Halted 0 ms 0 KB -