#include <bits/stdc++.h>
#include "september.h"
using namespace std;
int solve (int n, int m, vector<int> f, vector<vector<int>> v) {
vector<pair<int, int>> p(n, {1e9, -1e9});
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
p[v[i][j] - 1].first = min(p[v[i][j] - 1].first, j);
p[v[i][j] - 1].second = max(p[v[i][j] - 1].second, j);
}
}
sort(p.begin(), p.end());
int ans = 0, en = 0;
for (int i = 0; i < p.size(); i++) {
if (p[i].first > en) {
en = p[i].second;
ans++;
} else {
en = max(en, p[i].second);
}
}
return ans;
}
# | 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... |