Submission #1355839

#	Time	Username	Problem	Language	Result	Execution time	Memory
1355839		orgiloogii	September (APIO24_september)	C++20	28 / 100	52 ms	5288 KiB

september

#include "september.h"
#include <bits/stdc++.h>
using namespace std;
int solve(int n, int m, vector<int> f, vector<vector<int>> s) {
	vector <vector <bool>> vis(m + 1,vector <bool>(n + 1, 0));
	vector <int> mn(m + 1, INT_MAX);
	int ans = 0;
	int temp = 0;
	for (int i = 0;i < n - 1;i++) {
		int ls = temp;
		for (int j = 0;j < s.size();j++) {
			mn[j] = min(mn[j], s[j][i]);
		}
		bool pos = true;
		if (mn[0] != n - i - 1) continue;
		for (int i = 1;i < m;i++) {
			if (mn[i] != mn[0]) {
				pos = false;
				break;
			}
		}
		if (pos) ans++;
	}
	return ans;
}

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