Submission #1061692

#	Time	Username	Problem	Language	Result	Execution time	Memory
1061692		rainboy	9월 (APIO24_september)	C++17	100 / 100	98 ms	10288 KiB

september

#include "september.h"
#include <cstring>
#include <vector>

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;

const int N = 100000;

int gg[N], dd[N];

int solve(int n, int m, vi pp, vector<vi> iii) {
	for (int g = 0; g < n - 1; g++)
		gg[iii[0][g]] = g;
	gg[0] = n - 1;
	memset(dd, 0, n * sizeof *dd);
	for (int h = 1; h < m; h++)
		for (int g = 0; g < n - 1; g++) {
			int g_ = gg[iii[h][g]];
			if (g < g_)
				dd[g]++, dd[g_]--;
			else
				dd[g_]++, dd[g]--;
		}
	for (int j = 1; j < n; j++) {
		int i = pp[j];
		if (gg[i] < gg[j])
			dd[gg[i]]++, dd[gg[j]]--;
	}
	for (int g = 1; g < n; g++)
		dd[g] += dd[g - 1];
	int cnt = 0;
	for (int g = 0; g < n - 1; g++)
		if (dd[g] == 0)
			cnt++;
	return cnt;
}

• 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