Submission #993536

#	Time	Username	Problem	Language	Result	Execution time	Memory
993536		abczz	9월 (APIO24_september)	C++17	100 / 100	89 ms	12020 KiB

september

#include "september.h"
#include <iostream>
#include <vector>
#define ll long long

using namespace std;

bool B[100000][5];
ll f, x, in[100000][5], tot[100000], cnt;
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	f = cnt = x = 0;
	for (int i=1; i<N; ++i) {
		tot[i] = 0;
		for (int j=0; j<M; ++j) {
			B[i][j] = 0;
			++in[F[i]][j];
		}
	}
	for (int i=0; i<N-1; ++i) {
		for (int j=0; j<M; ++j) {
			auto u = S[j][i];
			++tot[u];
			if (tot[u] == M) ++x;
			B[u][j] = 1;
			--in[F[u]][j];
			if (B[F[u]][j] && !in[F[u]][j]) --cnt;
			if (in[u][j]) ++cnt;
		}
		if (!cnt && x == i+1) ++f;
	}
	return f;
}

• 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