Submission #1355826

#TimeUsernameProblemLanguageResultExecution timeMemory
1355826orgiloogiiSeptember (APIO24_september)C++20
0 / 100
0 ms436 KiB
#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));
	int cnt[n + 1] = {0};
	int ans = 0;
	int temp = 0;
	for (int i = 0;i < n;i++) {
		for (int j = 0;j < s.size();j++) {
			vis[j][i] = true;
			cnt[s[j][i]]++;
			if (cnt[s[j][i]] == m) temp++;
			else if (cnt[s[j][i]] == 1) temp--;
		}
		if (temp == 0) {
			ans++;
		}
	}
	return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...