oj.uz

Submission #878159

# Submission time Handle Problem Language Result Execution time Memory
878159 2023-11-24T06:23:08 Z vjudge1 Martian DNA (BOI18_dna) C++17
100 / 100
 25 ms 3932 KB 
/// 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.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 500 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 476 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1624 KB Output is correct
2 Correct 9 ms 1624 KB Output is correct
3 Correct 10 ms 1628 KB Output is correct
4 Correct 9 ms 1624 KB Output is correct
5 Correct 13 ms 2652 KB Output is correct
6 Correct 8 ms 1624 KB Output is correct
7 Correct 9 ms 1628 KB Output is correct
8 Correct 14 ms 3068 KB Output is correct
9 Correct 11 ms 2140 KB Output is correct
10 Correct 8 ms 1628 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 756 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3164 KB Output is correct
2 Correct 18 ms 2912 KB Output is correct
3 Correct 15 ms 2652 KB Output is correct
4 Correct 10 ms 1628 KB Output is correct
5 Correct 25 ms 3540 KB Output is correct
6 Correct 24 ms 3932 KB Output is correct
7 Correct 12 ms 2140 KB Output is correct
8 Correct 14 ms 2400 KB Output is correct
9 Correct 8 ms 1624 KB Output is correct
10 Correct 9 ms 1632 KB Output is correct
11 Correct 10 ms 1636 KB Output is correct
12 Correct 9 ms 1636 KB Output is correct
13 Correct 13 ms 2900 KB Output is correct
14 Correct 8 ms 1632 KB Output is correct
15 Correct 9 ms 1636 KB Output is correct
16 Correct 14 ms 3248 KB Output is correct
17 Correct 11 ms 2136 KB Output is correct
18 Correct 9 ms 1644 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 0 ms 352 KB Output is correct
21 Correct 1 ms 352 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 468 KB Output is correct