제출 #991200

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991200		model_code	9월 (APIO24_september)	C++17	100 / 100	113 ms	15308 KiB

september

#include"september.h"
#define MaxN 100500
int son[MaxN];
bool vis[MaxN];
std::vector<int> g[MaxN];
void calc(int N, std::vector<int>& S, bool *flag, int *tmin, int *tmax)
{
	for (int i = 0; i < N; i++)
		vis[i] = 0;
	int cnt = 0;
	for (int i = 0; i < N-1; i++) {
		int u = S[i];
		tmin[u] = std::min(tmin[u], i);
		tmax[u] = std::max(tmax[u], i);
		vis[u] = 1;
		cnt += son[u];
		for (int j = 0; j < g[u].size(); j++)
			if (vis[g[u][j]])
				cnt--;
		flag[i] &= (cnt==0);
	}
}
int tmin[MaxN], tmax[MaxN], o[MaxN];
bool flag[MaxN];
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	for (int i = 0; i < N; i++) {
		g[i].clear();
	 	son[i] = 0;
    }
	for (int i = 1; i < N; i++) {
		g[F[i]].push_back(i);
		g[i].push_back(F[i]);
		son[F[i]]++;
	}
	for (int i = 0; i+1 < N-1; i++) {
		flag[i] = 1;
		o[i] = 0;
	}
	for (int i = 1; i < N; i++) {
		tmin[i] = N+1;
		tmax[i] = -1;
	}
	for (int i = 0; i < M; i++)
		calc(N, S[i], flag, tmin, tmax);
	for (int id = 1; id < N; id++) {
		o[tmin[id]]++;
		o[tmax[id]]--;
	}
	int ans = 1;
	for (int i = 0; i+1 < N-1; i++) {
		if (i>0)
			o[i] += o[i-1];
		if (!o[i] && flag[i])
			ans++;
	}
	return ans;
}

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

september.cpp: In function 'void calc(int, std::vector<int>&, bool*, int*, int*)':
september.cpp:17:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |   for (int j = 0; j < g[u].size(); j++)
      |                   ~~^~~~~~~~~~~~~

• 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