Submission #1160422

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160422		kiwimsy	9월 (APIO24_september)	C++20	0 / 100	1 ms	324 KiB

september

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

vector<vector<int>> ch;
vector<vector<int>> d;
vector<int> k;
vector<bool> vis, passed;
queue<int> q;

void dfs(int node){
	vis[node] = true;
	for(int i : ch[node]){
		if(!vis[i]) dfs(i);
	}
	q.push(node);
}
/*
1
10 3
0 1 1 1 3 3 5 7 7
1 4 3 2 6 5 8 7 9
9 8 7 6 5 4 3 2 1
9 4 8 7 5 6 2 3 1
*/
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
	ch.clear(), ch.resize(N);
	d.clear(), d.resize(M);
	k.clear(), k.assign(M, 0);
	int ans = 0;
	for(int i = 1; i < N; ++i){
		ch[F[i]].push_back(i);
	}
	for(int i = 0; i < M; ++i){
		vis.assign(N, false);
		passed.assign(N, false);
		for(int j = 0; j < N-1; ++j){
			passed[S[i][j]] = true;
			if(!vis[S[i][j]]) dfs(S[i][j]);
			while(!q.empty() && passed[q.front()]){
				d[i].push_back(q.front());
				q.pop();
			}
		}
	}
	for(int i = 0; i < N-1; ++i){
		for(int j = 0; j < M; ++j) k[j] += d[j][i];
		bool s = true;
		int tm = k[0];
		for(int j = 1; j < M; ++j) if(tm != k[j]) s = false;
		if(s) ans++;
	}
	return ans;
}

• 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