Submission #1082886

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082886		djs100201	September (APIO24_september)	C++17	0 / 100	1036 ms	3420 KiB

september

#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_];
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) {
    mn[x] = idx[x][i];
    for (auto nxt : v[x]) {
        dfs(nxt, i);
        mn[x] = min(mn[x], mn[nxt]);
    }
    for (auto nxt : v[x]) {
        if (mn[x] < idx[nxt][i]) {
            merge(x, nxt);
        }
    }
}
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++) dfs(0, i);
    ll ret = 0;
    for (int i = 1; i <= n; i++) {
        if (find(i) == i) ret++;
    }
    return ret;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 5
• Subtask 4: 0 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16