| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1311140 | vanguard | September (APIO24_september) | C++20 | 0 ms | 0 KiB |
#include "september.h"
#include <vector>
map < int, int > mpp;
int cnt = 0;
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
for (int i = 0; i < n-1; i++) {
for (int j = 0; j < m; j++) {
mpp[rec[j][i]]++;
if (mpp[rec[j][i]] == m) {
// cout<<"erased: "<<rec[j][i]<<"count being: "<<mpp[rec[j][i]]<<nl;
mpp.erase(rec[j][i]);
if(mpp.size()==0)cnt++;
}
}
}
return cnt;
}
