Submission #878159

#	Time	Username	Problem	Language	Result	Execution time	Memory
878159		vjudge1	Martian DNA (BOI18_dna)	C++17	100 / 100	25 ms	3932 KiB

dna

/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
//#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

#pragma GCC optimize ("O3")

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;

constexpr int MOD = 1e9 + 7, N = 2e5 + 8, M = 1e9, SQ = 300, INF = 1e9 + 8, LGN = 22, mod = 998244353, P = 131113;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, k, r, a[N], val[N], mx, ans = INF;

int32_t main(){
  fast_io;
  cin >> n >> k >> r;
  FOR (i, 0, n){
    cin >> a[i];
  }
  int need = r;
  FOR (i, 0, r){
    int aa, bb;
    cin >> aa >> bb;
    val[aa] = bb;
  }
  -- val[a[0]];
  if (!val[a[0]]){
    -- need;
  }
  int l = 0, r = 1;
  while (r < n){
    while (need && r < n){
      -- val[a[r]];
      if (val[a[r]] == 0){
        -- need;
      }
      ++ r;
    }
    while (val[a[l]] < 0){
      ++ val[a[l]];
      ++ l;
    }
    if (need == 0){
      ans = min (ans, r - l);
    }
    ++ val[a[l]];
    ++ l;
    ++ need;
  }
  if (ans <= n){
    cout << ans << '\n';
  }
  else {
    cout << "impossible\n";
  }
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

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