Submission #789462

#	Time	Username	Problem	Language	Result	Execution time	Memory
789462		Trisanu_Das	Martian DNA (BOI18_dna)	C++17	0 / 100	84 ms	4684 KiB

dna

#include <bits/stdc++.h>
using namespace std;
 
int x;
 
int main(){
  int n, k, cnt; cin >> n >> k >> cnt;
  int a[n + 1], b[n + 1], ccnt[n + 1]; memset(ccnt, 0, sizeof(ccnt));
  for(int i = 1; i < n + 1; i++) cin >> a[i];
  for(int i = 1; i < cnt + 1; i++){
    cin >> x; cin >> b[x];
  }
  int l = 1, r = 0, ans = INT_MAX;
  while(r < n + 1){
    if(cnt){
      r++; ccnt[a[r]]++;
      if(ccnt[a[r]] == b[a[r]]) cnt--;
    }else{
      ans = min(ans, r - l + 1);
      if(ccnt[a[l]] == b[a[l]]) cnt++;
      ccnt[a[l]]--; l++;
    }
  }
  if(ans == INT_MAX) cout << "impossible\n";
  else cout << ans << '\n';
}

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