| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1082941 | djs100201 | 9월 (APIO24_september) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include "september.h"
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ = 1e5 + 10, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353;
ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k;
ll par[n_], idx[n_][6], mn[n_], U[n_], dep[n_], R[n_];
ll find(ll x) {
if (par[x] < 0) return x;
return par[x] = find(par[x]);
}
void merge(ll x, ll y) {
x = find(x), y = find(y);
if (x == y) return;
par[x] = y;
}
bool cmp(ll x, ll y) { return idx[x][a] < idx[y][a]; }
vector<ll> v[n_];
void dfs(ll x, ll i,ll val,ll node) {
if (idx[x][i] >= val) {
R[val] = idx[x][i];
U[x] = dep[node];
val = idx[x][i];
node = x;
}
else {
U[x] = dep[x];
}
for (auto nxt : v[x]) {
dep[nxt] = dep[x] + 1;
dfs(nxt, i, val, node);
U[x] = min(U[x], U[nxt]);
if (U[nxt] != dep[nxt]) {
//cout << x << ' ' << nxt << endl;
merge(x, nxt);
}
}
//cout << x << ' ' << U[x] << ' ' <<dep[x]<<' '<<val<<endl;
}
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
n = N - 1, m = M;
memset(par, -1, sizeof(par));
vector<ll> T;
for (int j = 0; j < m; j++)
for (int i = 0; i < n; i++) idx[S[j][i]][j] = i;
for (int i = 1; i <= n; i++) T.push_back(i);
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++) {
a = i, b = j;
sort(all(T), cmp);
stack<ll> st;
for (auto nxt : T) {
while (st.size() && idx[st.top()][b] > idx[nxt][b]) {
merge(st.top(), nxt);
st.pop();
}
st.push(nxt);
}
}
for (int i = 1; i <= n; i++) {
v[F[i]].push_back(i);
}
for (int i = 0; i < m; i++) {
for (int j = 0; j <= n; j++)R[j] = j;
for (auto nxt : v[0]) {
dep[nxt] = 0;
dfs(nxt, i, idx[nxt][i], nxt);
}
for (int j = 0; j < n; j++) {
if (R[j] > j)merge(S[i][j], S[i][j + 1]);
R[j + 1] = max(R[j], R[j + 1]);
}
}
ll ret = 0;
for (int i = 1; i <= n; i++) {
if (find(i) == i) ret++;
}
return ret;
}
int main() {
// ans -> 2
//cout << solve(6, 1, { -1, 0, 0, 1, 1,2 }, { {3,2,1,4,5} }) << endl;
cout << solve(6, 1, { -1, 0, 0, 1, 1,2 }, { {2,3,4,1,5} }) << endl;
}