oj.uz

답안 #239274

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239274 2020-06-15T06:07:58 Z alishahali1382 JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 22 ms 2052 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 ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=100010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans=inf;
int A[MAXN];
vector<int> J, O, I;
string S;

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>>S;
	for (int i=0; i<n; i++){
		if (S[i]=='J') J.pb(i);
		if (S[i]=='O') O.pb(i);
		if (S[i]=='I') I.pb(i);
	}
	J.pb(inf);
	O.pb(inf);
	I.pb(inf);
	
	for (int i=0; i<n; i++) if (S[i]=='J'){
		int pos=i, tmp;
		tmp=lower_bound(all(J), pos)-J.begin();
		if (tmp+k-1>=J.size()-1) continue ;
		pos=J[tmp+k-1]+1;
		
		tmp=lower_bound(all(O), pos)-O.begin();
		if (tmp+k-1>=O.size()-1) continue ;
		pos=O[tmp+k-1]+1;
		
		tmp=lower_bound(all(I), pos)-I.begin();
		if (tmp+k-1>=I.size()-1) continue ;
		pos=I[tmp+k-1]+1;
		
		ans=min(ans, pos-i-3*k);
	}
	if (ans>n) ans=-1;
	cout<<ans<<'\n';
	
	return 0;
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:48:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (tmp+k-1>=J.size()-1) continue ;
       ~~~~~~~^~~~~~~~~~~~
ho_t2.cpp:52:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (tmp+k-1>=O.size()-1) continue ;
       ~~~~~~~^~~~~~~~~~~~
ho_t2.cpp:56:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (tmp+k-1>=I.size()-1) continue ;
       ~~~~~~~^~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 19 ms 1536 KB Output is correct
37 Correct 22 ms 2036 KB Output is correct
38 Correct 21 ms 2036 KB Output is correct
39 Correct 21 ms 2052 KB Output is correct
40 Correct 17 ms 2020 KB Output is correct
41 Correct 19 ms 2036 KB Output is correct
42 Correct 20 ms 1924 KB Output is correct
43 Correct 13 ms 1376 KB Output is correct
44 Correct 14 ms 1524 KB Output is correct
45 Correct 17 ms 2052 KB Output is correct
46 Correct 17 ms 1920 KB Output is correct
47 Correct 17 ms 2052 KB Output is correct
48 Correct 17 ms 2052 KB Output is correct
49 Correct 13 ms 1292 KB Output is correct
50 Correct 17 ms 1924 KB Output is correct
51 Correct 18 ms 1924 KB Output is correct
52 Correct 13 ms 1608 KB Output is correct
53 Correct 14 ms 1864 KB Output is correct
54 Correct 13 ms 2052 KB Output is correct
55 Correct 13 ms 2052 KB Output is correct
56 Correct 11 ms 2052 KB Output is correct