Submission #1148138

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148138		yeyso	September (APIO24_september)	C++20	100 / 100	139 ms	12992 KiB

september

#include "september.h"
#include <bits/stdc++.h>
using namespace std;
void dfs(int u, int v, vector<vector<int>> &adj, vector<bool> &disconnected, int &ptr, vector<int> &pos, int &max_seen){
	if(!disconnected[u]){
		max_seen = max(max_seen, pos[u]);
		ptr ++;
		disconnected[u] = 1;
		for(int i = 0; i < adj[u].size(); i ++){
			dfs(adj[u][i], u, adj, disconnected, ptr, pos, max_seen);
		}
	}
}
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
	vector<vector<int>> adj(N, vector<int>());
	for(int i = 1; i < F.size(); i ++){
		adj[F[i]].push_back(i);
	}
	vector<vector<bool>> disconnected(M, vector<bool>(N, 0));
	vector<vector<int>> pos(M, vector<int>(N + 1, 0));
	for(int i = 0; i < N-1; i ++){
	    for(int j = 0; j < M; j ++){
	        pos[j][S[j][i]] = i;
	    }
	}
	for(int i = 0; i < pos.size(); i ++){
		for(int j = 0; j < pos[i].size(); j ++){
			pos[0][j] = max(pos[0][j], pos[i][j]);
 		} 
	}
	//for(int i = 0; i < pos.size(); i ++){
	//	for(int j = 0; j < pos[i].size(); j ++){
			//cout << pos[i][j] << " ";
 	//	} //cout << "\n";
	//}
	vector<int> nds(M, 0);
	int days = 0;
	int max_seen = 0;
	for(int i = 0; i < S[0].size(); i ++){
		for(int j = 0; j < S.size(); j ++){
			dfs(S[j][i], 0, adj, disconnected[j], nds[j], pos[j], max_seen);
			if(disconnected[j][S[j][i]] == 1) nds[j] --;
		}
		int newday = 1;
		for(int j = 0; j < S.size(); j ++){
			if(nds[j] != 0){
				newday = 0;
			}
		}
		//cout << max_seen << " ";
		if(i < max_seen){
			newday = 0;
		} else {
			max_seen ++;
		}
		days += newday;	
	}
	//cout << "\n";
	return days;
}
/*
g++ -std=gnu++17 -O2 -o september stub.cpp september.cpp

1
5 2
0 0 2 2
4 3 1 2
3 4 1 2

4 1 2 3
*/

• 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