제출 #626798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
626798		vovamr	Kutije (COCI21_kutije)	C++17	70 / 70	204 ms	24972 KiB

Main

#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 / 15
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 35 / 35