Submission #1018361

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018361		MohamedFaresNebili	September (APIO24_september)	C++17	45 / 100	117 ms	20916 KiB

september

#include <bits/stdc++.h>

		using namespace std;

		vector<int> adj[100005];
		int act[100005], rem[100005];
		bool leaf[100005];
		vector<int> pos;

		void dfs(int v) {
			for(auto u : adj[v]) {
				dfs(u);
				pos[v] = max(pos[v], pos[u]);
			}
		}

		int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
			for(int l = 0; l < N; l++) 
				adj[l].clear(), act[l] = leaf[l] = 0;
			for(int l = 1; l < N; l++) 
				adj[F[l]].push_back(l);
			
			pos = vector<int> (N);
			for(int l = 0; l < N - 1; l++) 
				pos[S[0][l]] = l;

			dfs(0);

			int res = 0;
			int hi = -1;
			for(int l = 0; l < N - 1; l++) {
				hi = max(hi, pos[S[0][l]]);
				if(hi == l) res++;
			}

			return res;
		}

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