답안 #346439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
346439 2021-01-09T17:22:23 Z alishahali1382 Martian DNA (BOI18_dna) C++14
100 / 100
38 ms 3948 KB
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=300010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN], ted[MAXN];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>k>>m;
	for (int i=1; i<=n; i++) cin>>A[i];
	for (int i=0; i<m; i++) cin>>x>>y, ted[x]+=y;
	int j=1, i=1;
	while(i<=n){
		m-=(0==--ted[A[i]]);
		if (!m) break ;
		i++;
	}
	if (m) kill("impossible")
	while (ted[A[j]]) ted[A[j++]]++;
	ans=i-j+1;
	for (i++; i<=n; i++){
		ted[A[i]]--;
		while (ted[A[j]]) ted[A[j++]]++;
		ans=min(ans, i-j+1);
	}
	kill(ans)
	
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1536 KB Output is correct
2 Correct 16 ms 1536 KB Output is correct
3 Correct 16 ms 1516 KB Output is correct
4 Correct 15 ms 1516 KB Output is correct
5 Correct 25 ms 2540 KB Output is correct
6 Correct 17 ms 1516 KB Output is correct
7 Correct 14 ms 1772 KB Output is correct
8 Correct 22 ms 3180 KB Output is correct
9 Correct 18 ms 2156 KB Output is correct
10 Correct 14 ms 1516 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 372 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 3180 KB Output is correct
2 Correct 29 ms 2924 KB Output is correct
3 Correct 23 ms 2668 KB Output is correct
4 Correct 15 ms 1516 KB Output is correct
5 Correct 35 ms 3692 KB Output is correct
6 Correct 38 ms 3948 KB Output is correct
7 Correct 19 ms 2156 KB Output is correct
8 Correct 23 ms 2540 KB Output is correct
9 Correct 14 ms 1516 KB Output is correct
10 Correct 16 ms 1516 KB Output is correct
11 Correct 16 ms 1572 KB Output is correct
12 Correct 15 ms 1516 KB Output is correct
13 Correct 21 ms 2540 KB Output is correct
14 Correct 14 ms 1516 KB Output is correct
15 Correct 14 ms 1900 KB Output is correct
16 Correct 21 ms 3180 KB Output is correct
17 Correct 18 ms 2156 KB Output is correct
18 Correct 14 ms 1516 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct