oj.uz

Submission #927036

# Submission time Handle Problem Language Result Execution time Memory
927036 2024-02-14T07:12:06 Z vjudge1 Martian DNA (BOI18_dna) C++17
100 / 100
 154 ms 137812 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
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 600 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2140 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 344 KB Output is correct
8 Correct 0 ms 348 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 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1628 KB Output is correct
2 Correct 13 ms 1368 KB Output is correct
3 Correct 16 ms 1112 KB Output is correct
4 Correct 14 ms 1372 KB Output is correct
5 Correct 52 ms 55228 KB Output is correct
6 Correct 9 ms 1880 KB Output is correct
7 Correct 11 ms 1116 KB Output is correct
8 Correct 113 ms 137720 KB Output is correct
9 Correct 16 ms 7516 KB Output is correct
10 Correct 17 ms 1968 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 2140 KB Output is correct
14 Correct 3 ms 3164 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 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 600 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 131 ms 58956 KB Output is correct
2 Correct 98 ms 44624 KB Output is correct
3 Correct 74 ms 42576 KB Output is correct
4 Correct 14 ms 1116 KB Output is correct
5 Correct 83 ms 72488 KB Output is correct
6 Correct 154 ms 129872 KB Output is correct
7 Correct 45 ms 7872 KB Output is correct
8 Correct 67 ms 16456 KB Output is correct
9 Correct 13 ms 1884 KB Output is correct
10 Correct 13 ms 1628 KB Output is correct
11 Correct 16 ms 1880 KB Output is correct
12 Correct 14 ms 1884 KB Output is correct
13 Correct 52 ms 56496 KB Output is correct
14 Correct 10 ms 2396 KB Output is correct
15 Correct 11 ms 1732 KB Output is correct
16 Correct 107 ms 137812 KB Output is correct
17 Correct 17 ms 7516 KB Output is correct
18 Correct 17 ms 1948 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 2140 KB Output is correct
22 Correct 2 ms 3028 KB Output is correct
23 Correct 1 ms 1372 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 456 KB Output is correct
27 Correct 0 ms 344 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 1 ms 344 KB Output is correct