제출 #996663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
996663		ainta	9월 (APIO24_september)	C++17	100 / 100	107 ms	13516 KiB

september

#include "september.h"


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

#define rng(i,a,b) for(int i=int(a);i<=int(b);i++)
#define rep(i,b) rng(i,0,b-1)
#define gnr(i,b,a) for(int i=int(b);i>=int(a);i--)
#define per(i,b) gnr(i,b-1,0)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
typedef long long ll;
using pii=pair<int,int>;
using vi=vc<int>;
using uint=unsigned;
using ull=unsigned long long;
using pil=pair<int,ll>;
using pli=pair<ll,int>;
using pll=pair<ll,ll>;
using t3=tuple<int,int,int>;

#define N_ 101000

vi E[N_];

int vis[N_], Q[N_], head,tail;

void Add(int a){
	if(vis[a])return;
	vis[a]=1;
	Q[++tail]=a;
}

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	rng(i,0,N){
		E[i].clear();
		vis[i]=0;
	}
	rng(i,1,N-1){
		E[F[i]].pb(i);
	}
	for(auto &t: S){
		rng(j,1,si(t)-1){
			E[t[j]].pb(t[j-1]);
		}
	}
	int pv = 0, res=0;
	while(pv < N-1){
		res++;
		head=tail=0;
		Add(S[0][pv]);
		while(head<tail){
			int x = Q[++head];
			for(auto &y:E[x]){
				Add(y);
			}
		}
		pv+=tail;
	}
	return res;
}

• 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