제출 #1184572

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1184572		thieunguyenhuy	September (APIO24_september)	C++20	100 / 100	143 ms	21440 KiB

september

#ifndef hwe
	#include "september.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T1, class T2> T1 random(T1 l, T2 r) {
    return uniform_int_distribution<T1>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

vector<vector<int>> opt;
vector<int> adj[N];

void dfs(int u) {
	for (auto v : adj[u]) {
		dfs(v);
		for (int i = 0; i < opt.size(); ++i) maximize(opt[i][u], opt[i][v]);
	}
}

int solve(int n, int m, vector<int> F, vector<vector<int>> s) {
	vector<ull> value(n);
	for (int i = 1; i < n; ++i) value[i] = rng();

	for (int i = 0; i < n; ++i) adj[i].clear();
	for (int i = 1; i < n; ++i) {
		adj[F[i]].emplace_back(i);
	}

	opt.assign(m, vector<int>(n, 0));
	for (int i = 0; i < m; ++i) for (int j = 0; j < s[i].size(); ++j) {
		opt[i][s[i][j]] = j;
	}

	dfs(0);

	vector<ull> pref(m, 0);
	int ans = 0;
	
	int p = -1;
	for (int j = 0; j < s[0].size(); ++j) {
		for (int i = 0; i < m; ++i) {
			pref[i] ^= value[s[i][j]];
			maximize(p, opt[i][s[i][j]]);
		}
		bool flag = true;
		for (int i = 1; i < m; ++i) flag &= (pref[i] == pref[0]);
		if (flag) ans += (j == p);
	}

	return ans;
}

#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    cout << solve(5, 2, {-1, 0, 0, 1, 1}, {{1, 2, 3, 4}, {4, 1, 2, 3}});

    return 0;
}
#endif

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