oj.uz

Submission #626798

# Submission time Handle Problem Language Result Execution time Memory
626798 2022-08-11T19:39:34 Z vovamr Kutije (COCI21_kutije) C++17
70 / 70
 204 ms 24972 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

const int N = 1e3 + 100;
ve<int> gr[N], gt[N], ord;
int used[N], col[N];
inline void dfs1(int v) {
	used[v] = 1;
	for (auto &to : gr[v]) {
		if (used[to]) continue;
		dfs1(to);
	} ord.pb(v);
}
inline void dfs2(int v, int c) {
	used[v] = 1, col[v] = c;
	for (auto &to : gt[v]) {
		if (used[to]) continue;
		dfs2(to, c);
	}
}

ve<int> g[N];
inline void dfs3(int v) {
	used[v] = 1;
	for (auto &to : g[v]) {
		if (used[to]) continue;
		dfs3(to);
	} ord.pb(v);
}

inline void solve() {
	int n, m, q;
	cin >> n >> m >> q;
	for (int i = 0; i < m; ++i) {
		for (int i = 0; i < n; ++i) {
			int p;
			cin >> p, --p;
			gr[p].pb(i), gt[i].pb(p);
		}
	}
	for (int i = 0; i < n; ++i) {
		if (used[i]) continue;
		dfs1(i);
	}

	reverse(all(ord));
	memset(used, 0, sizeof(used));

	int c = 1;
	for (auto &v : ord) {
		if (used[v]) continue;
		dfs2(v, c); ++c;
	}

	for (int i = 0; i < n; ++i) {
		for (auto &to : gr[i]) {
			g[col[i]].pb(col[to]);
		}
	}
	for (int i = 0; i < c; ++i) {
		sort(all(g[i]));
		g[i].erase(unique(all(g[i])), g[i].end());
	}

	ord.clear();
	memset(used, 0, sizeof(used));
	for (int i = 0; i < c; ++i) {
		if (used[i]) continue;
		dfs3(i);
	}

	ve<bitset<10005>> can(n);
	for (auto &v : ord) {
		can[v][v] = 1;
		for (auto &to : g[v]) can[v] |= can[to];
	}

	while (q--) {
		int a, b;
		cin >> a >> b;
		cout << (can[col[--a]][col[--b]] ? "DA" : "NE") << '\n';
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 7160 KB Output is correct
2 Correct 71 ms 6232 KB Output is correct
3 Correct 72 ms 5956 KB Output is correct
4 Correct 80 ms 7036 KB Output is correct
5 Correct 90 ms 6948 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 2 ms 680 KB Output is correct
5 Correct 1 ms 616 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 2 ms 756 KB Output is correct
10 Correct 2 ms 724 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 2 ms 680 KB Output is correct
5 Correct 1 ms 616 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 2 ms 756 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 2 ms 816 KB Output is correct
12 Correct 2 ms 676 KB Output is correct
13 Correct 1 ms 676 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 676 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 1 ms 676 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 7160 KB Output is correct
2 Correct 71 ms 6232 KB Output is correct
3 Correct 72 ms 5956 KB Output is correct
4 Correct 80 ms 7036 KB Output is correct
5 Correct 90 ms 6948 KB Output is correct
6 Correct 2 ms 856 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 680 KB Output is correct
10 Correct 1 ms 616 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 2 ms 756 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 2 ms 816 KB Output is correct
17 Correct 2 ms 676 KB Output is correct
18 Correct 1 ms 676 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 676 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 1 ms 676 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 196 ms 23760 KB Output is correct
27 Correct 192 ms 24972 KB Output is correct
28 Correct 158 ms 20244 KB Output is correct
29 Correct 181 ms 23008 KB Output is correct
30 Correct 161 ms 20708 KB Output is correct
31 Correct 155 ms 22112 KB Output is correct
32 Correct 181 ms 22932 KB Output is correct
33 Correct 204 ms 22992 KB Output is correct
34 Correct 193 ms 23000 KB Output is correct
35 Correct 178 ms 24312 KB Output is correct