Submission #1206298

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206298		tamzid	September (APIO24_september)	C++20	0 / 100	0 ms	324 KiB

september

#include "september.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
	if(is_sorted(S[0].rbegin(),S[0].rend()))
		return N-1;

	int k = 0;
	std::set<int> s1,s2;
	for(int i=N-1;i>=1;i--)
	{
		if(S[0][i] == i)
		{
			++k;
		}
		else
		{
			while(S[0][i] != i && s1 != s2)
			{
				s1.insert(S[0][i]);
				s2.insert(i);
				--i;
				if(i == 0)
					break;
			}
			if(s1 == s2)
			{
				++k;
				s1.clear();
				s2.clear();
			}
		}
	}
	return k;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 5
• Subtask 4: 0 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16