#include "september.h"
#include <bits/stdc++.h>
using namespace std;
int solve(int n, int M, vector<int> F, vector<std::vector<int>> S) {
int c = n - 1;
int j = 0, ans = 0;
while(c != 0) {
if(j < n - 1 &&c == S[0][j]) {
++ans;
--c;
++j;
continue;
} else {
set<int> s;
int mn = INT_MAX, mx = INT_MIN;
mn = S[0][j];
mx = S[0][j];
s.insert(S[0][j]);
++j;
while(j < n - 1) {
s.insert(S[0][j]);
mn = min(S[0][j], mn);
mx = max(S[0][j], mx);
if(s.size() == mx - mn + 1) {
++ans;
c = mn - 1;
++j;
break;
}
++j;
}
}
}
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... |