oj.uz

Submission #927034

# Submission time Handle Problem Language Result Execution time Memory
927034 2024-02-14T07:11:13 Z vjudge1 Martian DNA (BOI18_dna) C++17
0 / 100
 128 ms 74732 KB 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define s second
#define f first
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 6e4 + 1, mod = 1e9 + 7;

const ll inf = 1e9;
 
double eps = 1e-15;
                                                
bool flg = 0;

void slv() {
	int n, k, r;
	cin >> n >> k >> r;
	int a[n + 1];
	for (int i = 1; i <= n; i++) cin >> a[i];
	vector<int> v(k);
	multiset<int> s;
	for (int i = 1; i <= r; i++) {
		int b, q;
		cin >> b >> q;
		v[b] = q;
		s.insert(0);
	}
	queue<int> ps[k];
	int mn = inf;
	for (int i = 1; i <= n; i++) {
		ps[a[i]].push(i);
		if (sz(ps[a[i]]) == v[a[i]]) 
			s.erase(s.find(0));
		if (sz(ps[a[i]]) > v[a[i]]) {
			if (v[a[i]])
				s.erase(s.find(ps[a[i]].front()));
			ps[a[i]].pop();
		}
		if (v[a[i]] && sz(ps[a[i]]) == v[a[i]]) 
			s.insert(ps[a[i]].front());
		int l = *s.begin();
		if (!l) continue;
		mn = min(mn, i - l + 1);
	}
	if (mn == inf) cout << "Impossible";
	else cout << mn;
}                                                                           
 
main() {
	//freopen("rsq.in", "r", stdin);                                                                                     
	//freopen("rsq.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (flg) cin >> tp;
	while (tp--) {  	
		slv();
	}
}
//wenomechainsama

Compilation message

dna.cpp:65:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   65 | main() {
      | ^~~~

Subtask #1
0 / 16.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 348 KB Output is correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 2136 KB Output is correct
4 Correct 2 ms 3164 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Incorrect 1 ms 456 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1884 KB Output is correct
2 Correct 13 ms 1628 KB Output is correct
3 Correct 16 ms 1680 KB Output is correct
4 Correct 14 ms 1904 KB Output is correct
5 Correct 54 ms 56404 KB Output is correct
6 Correct 10 ms 2396 KB Output is correct
7 Incorrect 11 ms 1884 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 60720 KB Output is correct
2 Correct 101 ms 46160 KB Output is correct
3 Correct 60 ms 43868 KB Output is correct
4 Correct 14 ms 1628 KB Output is correct
5 Incorrect 91 ms 74732 KB Output isn't correct
6 Halted 0 ms 0 KB -