Submission #927117

#	Time	Username	Problem	Language	Result	Execution time	Memory
927117		vjudge1	Martian DNA (BOI18_dna)	C++17	40 / 100	2050 ms	9816 KiB

dna

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("popcnt")
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define emb emplace_back
#define emc emplace
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
template <class type_key, class type_val>
using um = unordered_map<type_key, type_val>;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;


int pref[200001][11];
signed main(void)
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
      
      int n, k, R;
      cin >> n >> k >> R;

      int a[n+1];
      for( int i = 1; i <= n; i++ ) {
            cin >> a[i];
      }

      pii Q[R+1];
      for( int i = 1; i <= R; i++ ) {
            cin >> Q[i].F >> Q[i].S;
      }

      for( int i = 1; i <= n; i++ ) {
            for( int j = 1; j <= R; j++ ) {
                  pref[i][j] = pref[i-1][j] + (a[i] == Q[j].F);
            }
      }

      for( int i = 1; i <= R; i++ ) {
            if( pref[n][i] < Q[i].S ) {
                  cout << "impossible";
                  return 0;
            }
      }

      int ans = INT_MAX;
      for( int r = 1; r <= n; r++ ) {
            bool ok = 1;
            for( int l = 1; l <= r; l++ ) {
                  for( int i = 1; i <= R; i++ ) {
                        if( pref[r][i] - pref[l-1][i] < Q[i].S ) {
                              ok = 0;
                              break;
                        }
                  }
                  if( !ok ) break;
                  ans = min(ans, r-l+1);
            }
      }
      cout << ans;

return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 24 / 24
• Subtask 3: 0 / 28
• Subtask 4: 0 / 32