#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
int k = 0;
vector<int> mp(N, 0);
vector<int> st;
int l = 0;
for (int i = 0; i< N-1;i++){
l++;
for (int j = 0; j< M;j++){
mp[S[j][i]]++;
if (mp[S[j][i]] == M){
st.push_back(S[j][i]);
}
}
if (st.size() == l){
l = 0;
k++;
st.clear();
}
}
return k;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |