oj.uz

Submission #535874

# Submission time Handle Problem Language Result Execution time Memory
535874 2022-03-11T15:27:30 Z ammar2000 Martian DNA (BOI18_dna) C++17
0 / 100
 42 ms 6768 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,k,r;
ll a[SI],w[SI],c[SI];
ll st;
int main()
{
   fast
   cin>>n>>k>>r;
   for (int i=0;i<n;i++)
    cin>>a[i];
   for (int i=0;i<r;i++)
   {
     ll x,y;
     cin>>x>>y;
     w[x]=y;
     st++;
   }
   ll f=0,s=0,ans=INF;
   while (f<n)
   {
       while (s<n&&st)
       {
          c[a[s]]++;
          if (c[a[s]]==w[a[s]])
            st--;
          s++;
       }
       //cout<<f<<" "<<s<<"\n";
       if (s==n)
        break;
       ans=min(ans,s-f);
       if (c[a[f]]==w[a[f]])
        st++;
       c[a[f++]]--;
   }
   if (ans==INF)
    cout <<"impossible";
   else cout <<ans;
   // use scanf not cin
   return 0;
}

/*
5 2 2
0 1 1 0 1
0 1
1 1
*/

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2268 KB Output is correct
2 Correct 14 ms 2188 KB Output is correct
3 Correct 13 ms 2236 KB Output is correct
4 Correct 11 ms 2252 KB Output is correct
5 Correct 18 ms 3656 KB Output is correct
6 Incorrect 11 ms 2280 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 4816 KB Output is correct
2 Correct 26 ms 4388 KB Output is correct
3 Correct 22 ms 4044 KB Output is correct
4 Correct 11 ms 2224 KB Output is correct
5 Correct 42 ms 5600 KB Output is correct
6 Correct 33 ms 6768 KB Output is correct
7 Correct 17 ms 2952 KB Output is correct
8 Correct 20 ms 3276 KB Output is correct
9 Correct 12 ms 2260 KB Output is correct
10 Correct 11 ms 2260 KB Output is correct
11 Correct 13 ms 2260 KB Output is correct
12 Correct 12 ms 2260 KB Output is correct
13 Correct 16 ms 3660 KB Output is correct
14 Incorrect 10 ms 2260 KB Output isn't correct
15 Halted 0 ms 0 KB -