Submission #1053982

#	Time	Username	Problem	Language	Result	Execution time	Memory
1053982		vjudge1	Martian DNA (BOI18_dna)	C++17	100 / 100	20 ms	5600 KiB

dna

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dj[] = {0, 0, 1, -1, 1, -1, 1, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()

void solve() {
  int n,k,r;cin>>n>>k>>r;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];

  int not0 = 0;
  vector<int> cnt(n);
  for (int i = 0; i < r; i++) {
    int u,v;cin>>u>>v;
    cnt[u] = v;
    if (v != 0) not0++;
  }

  int j = -1;
  int ans = n+1;
  for (int i = 0; i < n; i++) {
    while (j+1 < n && not0 > 0) {
      j++;
      cnt[a[j]]--;
      if (cnt[a[j]] == 0) not0--;
    }
    if (not0 != 0) break;
    ans = min(ans, j-i+1);
    if (cnt[a[i]] == 0) not0++;
    cnt[a[i]]++;
  }

  if (ans != n+1) cout << ans << endl;
  else cout << "impossible" << endl;
}

int32_t main() {
  ios_base::sync_with_stdio(0);cin.tie(0);
  int t=1;
  while(t--) solve();

  return 0;
}

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