# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1153588 | lrnnz | September (APIO24_september) | C++17 | 0 ms | 0 KiB |
#include "september.h"
#include <vector>
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
int ans = 0;
int diffs = 0;
map<int,int> cnts;
for (int i = N-2; i >= 0; i--){
for (auto x : S){
int node = x[i];
cnts[node]++;
if (cnts[node] == 1){
diffs++;
}
if (cnts[node] == M){
diffs--;
}
}
if (diffs == 0)
ans++;
}
return ans;
}