#include <bits/stdc++.h>
using namespace std;
int solve(int n, int m, vector<int> p, vector<vector<int>> s) {
vector<set<int>> a(m);
int k = 0;
for (int i = 0; i < s[0].size(); ++i) {
set<set<int>> p;
for (int j = 0; j < m; ++j) a[j].insert(s[j][i]), p.insert(a[j]);
k += p.size() == 1;
}
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... |