Submission #1182488

#	Time	Username	Problem	Language	Result	Execution time	Memory
1182488		Agageldi	September (APIO24_september)	C++20	0 / 100	54 ms	117828 KiB

september

#include "bits/stdc++.h"
#include "september.h"
// #include "stub.cpp"
using namespace std;

#define SZ(v) (int)v.size()
#define ll long long
#define MAX_N 5000005

int n, vis[MAX_N], ans, ind[MAX_N], r = -1;
vector <int> v[MAX_N];

// void solve(int x) {
// 	vis[x] = 1;
// 	r = max(r, ind[x]);
// 	for(auto i : v[x]) {
// 		solve(i);
// 		v[i].clear();
// 	}
// }

int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
	ans = 0;
	r = -1;
	for(int i = 0; i < N; i++) {
		vis[i] = 0;
	}
	for(int j = 0; j < N - 1; j++) {
		bool tr = 0;
		for(int i = 0; i < M; i++) {
			vis[S[i][M]]++;
			if(i == M - 1 && vis[S[i][j]] != j + 1) tr = 1;
		}
		ans += 1 - tr;
	}
	return ans;
}

• 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