# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
452064 | soba | Martian DNA (BOI18_dna) | C++14 | 955 ms | 8344 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;
typedef long long ll;
int const N = 2e5+3;
set<int>s;
int reqs[N] , arr[N] , cnt[N] , tmp[N];
int n , k , q , a , b;
bool check(int x)
{
s.clear();
memset(tmp , 0 , sizeof tmp);
int r = x;
for(int i = 0 ; i < x ; i++)
{
tmp[arr[i]]++;
}
for(int i = 0 ; i < k ; i++)
{
if(reqs[i]>tmp[i])
s.insert(i);
}
if(s.empty())
return true;
set<int>::iterator it;
while(r<n)
{
tmp[arr[r]]++;
tmp[arr[r-x]]--;
if(tmp[arr[r]]>=reqs[arr[r]] && s.find(arr[r])!=s.end())
# | 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... |