# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916635 | penguin133 | Martian DNA (BOI18_dna) | C++17 | 37 ms | 6996 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;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, m, k, A[200005], req[200005], cur[200005];
void solve(){
cin >> n >> m >> k;
for(int i = 1; i <= n; i++)cin >> A[i];
int cnt = 0;
for(int i = 1; i <= k; i++){
int a, b; cin >> a >> b;
req[a] = max(req[a], b);
}
int ans = 1e18, l = 1;
for(int i = 0; i < m; i++)if(!req[i])cnt++;
for(int i = 1; i <= n; i++){
cur[A[i]]++;
if(cur[A[i]] == req[A[i]])cnt++;
while(cnt == m){
ans = min(ans, i - l + 1);
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... |