oj.uz

Submission #632133

# Submission time Handle Problem Language Result Execution time Memory
632133 2022-08-19T13:33:55 Z TranGiaHuy1508 Martian DNA (BOI18_dna) C++17
100 / 100
 64 ms 6276 KB 
/*
	Unknown's C++ Template (v3.2)
*/

#include "bits/stdc++.h"
using namespace std;

#define int long long

using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
using vvi = vector<vi>;
using vvii = vector<vii>;
template <class T> using maxpq = priority_queue<T>;
template <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mid ((l+r)>>1)
#define fi first
#define se second

#ifdef LOCAL
	#define debug(x) cout << #x << " = " << x << "\n";
#else
	#define debug(x) ;
#endif

template <class A, class B>
ostream& operator << (ostream& out, pair<A, B> x)
{ out << "(" << x.first << ", " << x.second << ")"; return out; }

template <class T>
ostream& operator << (ostream& out, vector<T> x){
	out << "[";
	for (int i=0; i<sz(x); i++) { out << (i ? ", " : "") << x[i]; }
	out << "]"; return out;
}

template <class T>
istream& operator >> (istream& in, vector<T> &x){
	for (auto &i: x) in >> i;
	return in;
}

const ld PI = acos(-1.0);
const int allmod[3] = {(int)1e9+7, 998244353, (int)1e9+9};
const int mod = allmod[0];
const int maxn = 2e5 + 64;
const ll inf = 1e18;
const ld eps = 1e-6;
const int multitest = 0;

int n, k, q, tt;
vi v, req, cnt;

bool check(int X){
	cnt.assign(k, 0); tt = k - q;
	for (int i = 0; i < X; i++){
		cnt[v[i]]++;
		if (req[v[i]] == cnt[v[i]]) tt++;
	}
	if (tt == k) return true;
	for (int i = X; i < n; i++){
		if (req[v[i-X]] == cnt[v[i-X]]) tt--;
		cnt[v[i-X]]--;
		cnt[v[i]]++;
		if (req[v[i]] == cnt[v[i]]) tt++;
		if (tt == k) return true;
	}
	return false;
}

void main_program(){
	cin >> n >> k >> q;
	v.resize(n); cin >> v;
	req.assign(k, 0);

	for (int i = 0; i < q; i++){
		int x, y; cin >> x >> y; req[x] = y;
	}

	int l = 1, r = n + 1;
	while (r - l > 1){
		if (check(mid)) r = mid;
		else l = mid + 1;
	}
	if (l <= n && check(l)) cout << l << "\n";
	else if (r > n) cout << "impossible\n";
	else cout << r << "\n";
}

void pre_main(){

}

signed main(){
	#ifdef LOCAL
		auto stime = chrono::high_resolution_clock::now();
	#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	#ifndef ONLINE_JUDGE
		if (fopen(".inp", "r")){
			freopen(".inp", "r", stdin);
			freopen(".out", "w", stdout);
		}
	#endif
	int t = 1; if (multitest) cin >> t;
	pre_main();
	while (t--) main_program();
	#ifdef LOCAL
		auto etime = chrono::high_resolution_clock::now();
		auto duration = chrono::duration_cast<chrono::milliseconds>(etime-stime).count();
		cout << "\n[" << duration << "ms]\n";
	#endif
}

Compilation message

dna.cpp: In function 'int main()':
dna.cpp:108:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |    freopen(".inp", "r", stdin);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~
dna.cpp:109:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |    freopen(".out", "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1884 KB Output is correct
2 Correct 23 ms 1876 KB Output is correct
3 Correct 16 ms 1876 KB Output is correct
4 Correct 21 ms 1876 KB Output is correct
5 Correct 32 ms 3140 KB Output is correct
6 Correct 21 ms 1876 KB Output is correct
7 Correct 22 ms 1900 KB Output is correct
8 Correct 44 ms 6276 KB Output is correct
9 Correct 26 ms 2900 KB Output is correct
10 Correct 26 ms 2260 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 368 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 324 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3040 KB Output is correct
2 Correct 41 ms 2772 KB Output is correct
3 Correct 49 ms 2824 KB Output is correct
4 Correct 9 ms 1876 KB Output is correct
5 Correct 42 ms 3444 KB Output is correct
6 Correct 64 ms 4704 KB Output is correct
7 Correct 28 ms 2004 KB Output is correct
8 Correct 43 ms 2156 KB Output is correct
9 Correct 25 ms 1876 KB Output is correct
10 Correct 23 ms 1876 KB Output is correct
11 Correct 16 ms 1876 KB Output is correct
12 Correct 24 ms 1876 KB Output is correct
13 Correct 30 ms 3156 KB Output is correct
14 Correct 21 ms 1876 KB Output is correct
15 Correct 21 ms 1876 KB Output is correct
16 Correct 43 ms 6224 KB Output is correct
17 Correct 31 ms 2892 KB Output is correct
18 Correct 26 ms 2248 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 324 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct