제출 #991519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991519		Nika533	9월 (APIO24_september)	C++17	45 / 100	117 ms	8872 KiB

september

#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;

const int N=1e5+5;
int T,k,sz[N],p[N];
vector<int> g[N];

void make_set(int v) {
	p[v]=v; sz[v]=1;
}
int find_set(int v) {
	if (p[v]==v) return v;
	return p[v]=find_set(p[v]);
}
void merge(int a, int b) {
	a=find_set(a); b=find_set(b);
	if (a==b) return;
	if (sz[a]<sz[b]) swap(a,b);
	sz[a]+=sz[b]; p[b]=a;
}

void add_edges(int v) {
	for (auto u:g[v]) if (p[u]>=0) merge(u,v);
}

int solve(int n, int m, vector<int> F,vector<vector<int>> S) {
	for (int i=0; i<n; i++) {
		p[i]=-1;
		g[i].clear();
	}
	for (int i=1; i<n; i++) {
		g[i].pb(F[i]); g[F[i]].pb(i);
	}
	int ans=0;
	make_set(0);
	for (int i=n-2; i>=0; i--) {
		int x=S[0][i];
		make_set(x);
		add_edges(x);
		if (sz[find_set(x)]==n-i) ans++;
	}
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

september.cpp:1:32: warning: '-std=c++11' is not an option that controls warnings [-Wpragmas]
    1 | #pragma GCC diagnostic warning "-std=c++11"
      |                                ^~~~~~~~~~~~

• 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