# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
399756 | Sorting | Martian DNA (BOI18_dna) | C++17 | 39 ms | 2720 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
template<typename T> void check_min(T &a, const T &b){ a = (a < b) ? a : b; }
template<typename T> void check_max(T &a, const T &b){ a = (a > b) ? a : b; }
typedef long long ll;
#define all(x) (x).begin(), (x).end()
int read_int();
const int N = 2e5 + 3;
int n, k, r, a[N];
int mn[N], cnt[N], cnt_ok;
void add(int x){
++cnt[x];
if(cnt[x] == mn[x]) ++cnt_ok;
}
void rem(int x){
if(cnt[x] == mn[x]) --cnt_ok;
--cnt[x];
}
bool check(int mid){
fill(cnt, cnt + k, 0);
cnt_ok = k - r;
for(int i = 0; i < mid; ++i)
add(a[i]);
Compilation message (stderr)
# | 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... |