oj.uz

Submission #291290

# Submission time Handle Problem Language Result Execution time Memory
291290 2020-09-05T05:05:11 Z eggag32 Martian DNA (BOI18_dna) C++17
100 / 100
 75 ms 4856 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
const int mxN = 2e5 + 5;

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

int n, k, r;
int a[mxN], req[mxN];

bool check(int g){
	vi cnt(n, 0);
	int num = 0; //the number of ones that need fixing (good if it is 0 at some point)
	rep(i, n) if(cnt[i] < req[i]) num++;
	rep(i, g){
		cnt[a[i]]++;
		if(cnt[a[i]] == req[a[i]]) num--; //we fixed it :)
	}
	if(!num) return 1;
	repn(i, g, n){
		cnt[a[i]]++;
		if(cnt[a[i]] == req[a[i]]) num--; //we fixed it :)
		cnt[a[i - g]]--;
		if(cnt[a[i - g]] == (req[a[i - g]] - 1)) num++;
		if(!num) return 1;
	}
	return 0;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	cin >> n >> k >> r;
	rep(i, n) cin >> a[i];
	rep(i, r){
		int c, b;
		cin >> c >> b;
		req[c] = b;
	}
	int l = 1, r = n;
	while(l < r){
		int mid = (l + r) / 2;
		if(check(mid)) r = mid;
		else l = mid + 1;
	}
	if(!check(l)) cout << "impossible" << endl;
	else cout << l << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
16.0 / 16.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2336 KB Output is correct
2 Correct 35 ms 2304 KB Output is correct
3 Correct 24 ms 2408 KB Output is correct
4 Correct 34 ms 2304 KB Output is correct
5 Correct 39 ms 3200 KB Output is correct
6 Correct 30 ms 2304 KB Output is correct
7 Correct 30 ms 2544 KB Output is correct
8 Correct 46 ms 3200 KB Output is correct
9 Correct 36 ms 2944 KB Output is correct
10 Correct 36 ms 2356 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 3960 KB Output is correct
2 Correct 54 ms 3944 KB Output is correct
3 Correct 56 ms 3456 KB Output is correct
4 Correct 16 ms 2304 KB Output is correct
5 Correct 54 ms 4472 KB Output is correct
6 Correct 75 ms 4856 KB Output is correct
7 Correct 46 ms 2940 KB Output is correct
8 Correct 57 ms 3200 KB Output is correct
9 Correct 36 ms 2304 KB Output is correct
10 Correct 35 ms 2304 KB Output is correct
11 Correct 24 ms 2416 KB Output is correct
12 Correct 32 ms 2304 KB Output is correct
13 Correct 38 ms 3064 KB Output is correct
14 Correct 30 ms 2304 KB Output is correct
15 Correct 31 ms 2544 KB Output is correct
16 Correct 46 ms 3200 KB Output is correct
17 Correct 37 ms 2936 KB Output is correct
18 Correct 38 ms 2304 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 416 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct