제출 #1345303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1345303		Newtonabc	9월 (APIO24_september)	C++20	0 / 100	2 ms	580 KiB

september

#include "september.h"
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int cnt[N],out[N];
bool vs[N];
vector<int> g[N],rev[N],lv[N];
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	for(int i=1;i<N;i++) g[F[i]].push_back(i),out[F[i]]++;
	for(int i=1;i<N;i++) rev[i].push_back(F[i]);
	int c=0,ans=0,deg0=0;
	for(int i=0;i<N-1;i++){
		//check S[0] that is it able for all node to be leave after deletion
		if(out[S[0][i]]==0) deg0++;
		vs[S[0][i]]=true;
		for(auto v:rev[S[0][i]]){
			out[v]--;
			if(vs[v] && out[v]==0) deg0++;
		}
		for(int j=0;j<M;j++){
			cnt[S[j][i]]++;
			if(cnt[S[j][i]]==M) c++;
		}
		if(c==i+1 && deg0==i+1) 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