oj.uz

Submission #537982

# Submission time Handle Problem Language Result Execution time Memory
537982 2022-03-16T01:48:20 Z thegrimbee Martian DNA (BOI18_dna) C++14
0 / 100
 2000 ms 4464 KB 
	#include<bits/stdc++.h>
	using namespace std;
	#define int long long
	bool debug = false;
	signed main(){
		cin.tie(0);
		ios_base::sync_with_stdio(0);
		int n, k, r, temp; cin >> n >> k >> r;
		vector<int> v(n);
		for (int i = 0 ;i < n; ++i){
			cin >> v[i];
		}
		vector<int> val(k, 1e9+7);
		for (int i = 0;i < r; ++i){
			cin >> temp;
			cin >> val[temp];
		}
		int lo = 1, hi = n+1, mid = (lo + hi)/2;
		temp = 0;
		while (mid != n+1 && !(temp == r && lo == mid)){
			if(debug) cout << mid << '\n';
			temp = 0;
			vector<int> cur(n, 0);
			for (int i = 0; i < mid; ++i){
				cur[v[i]]++;
				if(cur[v[i]] == val[v[i]])temp++;
			}
			if(temp == r){
				hi = mid;
				mid = (lo + hi)/2;
				continue;
			}
			for (int i = mid; i < n; ++i){
				cur[v[i]]++;
				cur[v[i-mid]]--;
				if (v[i] != v[i-mid]){
					if(cur[v[i]] == val[v[i]])temp++;
					if (cur[v[i-mid]] == val[v[i-mid]]-1)temp--;
				}
				if(temp == r){
					hi = mid;
					mid = (lo + hi)/2;
					continue;
				}
			}
			lo = mid+1;
			mid = (lo + hi)/2;
		}
		if(debug)cout << temp << ' ';
		if (temp != r && mid == n+1)cout << "impossible";
		else cout << mid;

	}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2086 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2093 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 3796 KB Output is correct
2 Execution timed out 2086 ms 3824 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2076 ms 4464 KB Time limit exceeded
2 Halted 0 ms 0 KB -