| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 590352 |
2022-07-05T21:20:30 Z |
ioi |
JJOOII 2 (JOI20_ho_t2) |
C++14 |
|
10 ms |
5516 KB |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("cardgame.in" , "r" , stdin);
#define outF freopen("cardgame.out" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long
#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define int ll
const int N = 3e5 + 5 , M = N * 4 , MX = 2e4 + 40;
const ll MOD = 998244353 , oo = 1e9 + 9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;
int di[] = {1 , -1 , 0 , 0};
int dj[] = {0 , 0 , 1 , -1};
int32_t main()
{
// inF;
// inF;outF;
fastio;
//Welcome back without <TAWJIHI>
int n , k;
string s ;
cin >> n >> k >> s ;
deque<int> j ,o , i ;
int oafterj[n] = {} , iaftero[n] = {};
int mn = 1e9 ;
for(int c = 0 ; c < n ; c ++){
if(s[c] == 'J')j.push_back(c);
else if(s[c] == 'O')o.push_back(c) , oafterj[c] = 1;
else i.push_back(c) , iaftero[c] = 1;
if(c)oafterj[c] += oafterj[c - 1];
if(c)iaftero[c] += iaftero[c - 1];
}
for(int c = 0 ; c < n && j.size() >= k ; c ++){
int curr = j[k - 1];
int counto = oafterj[n - 1];
if(curr)counto -= oafterj[curr - 1];
if(counto < k)break;
int po = o[o.size() - 1 - counto + k];
int counti = iaftero[n - 1];
if(po)counti -= iaftero[po - 1];
if(counti < k)break;
int pi = i[i.size() - 1 - counti + k];
int tmp = c ;
tmp += (n - pi - 1);
tmp += 3 * k ;
mn = min(mn , n - tmp);
if(s[c] == 'J')j.pop_front();
else if(s[c] == 'I')i.pop_front();
else o.pop_front();
}
cout << (mn == 1e9 ? -1 : mn);
}
Compilation message
ho_t2.cpp: In function 'int32_t main()':
ho_t2.cpp:59:38: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
59 | for(int c = 0 ; c < n && j.size() >= k ; c ++){
| ~~~~~~~~~^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
324 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
320 KB |
Output is correct |
| 7 |
Correct |
0 ms |
316 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
324 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
320 KB |
Output is correct |
| 7 |
Correct |
0 ms |
316 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
324 KB |
Output is correct |
| 18 |
Correct |
0 ms |
352 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
0 ms |
340 KB |
Output is correct |
| 22 |
Correct |
0 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Correct |
0 ms |
340 KB |
Output is correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Correct |
1 ms |
340 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
0 ms |
340 KB |
Output is correct |
| 29 |
Correct |
0 ms |
340 KB |
Output is correct |
| 30 |
Correct |
1 ms |
340 KB |
Output is correct |
| 31 |
Correct |
0 ms |
340 KB |
Output is correct |
| 32 |
Correct |
1 ms |
316 KB |
Output is correct |
| 33 |
Correct |
1 ms |
340 KB |
Output is correct |
| 34 |
Correct |
1 ms |
340 KB |
Output is correct |
| 35 |
Correct |
0 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
324 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
320 KB |
Output is correct |
| 7 |
Correct |
0 ms |
316 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
324 KB |
Output is correct |
| 18 |
Correct |
0 ms |
352 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
0 ms |
340 KB |
Output is correct |
| 22 |
Correct |
0 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Correct |
0 ms |
340 KB |
Output is correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Correct |
1 ms |
340 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
0 ms |
340 KB |
Output is correct |
| 29 |
Correct |
0 ms |
340 KB |
Output is correct |
| 30 |
Correct |
1 ms |
340 KB |
Output is correct |
| 31 |
Correct |
0 ms |
340 KB |
Output is correct |
| 32 |
Correct |
1 ms |
316 KB |
Output is correct |
| 33 |
Correct |
1 ms |
340 KB |
Output is correct |
| 34 |
Correct |
1 ms |
340 KB |
Output is correct |
| 35 |
Correct |
0 ms |
340 KB |
Output is correct |
| 36 |
Correct |
9 ms |
5064 KB |
Output is correct |
| 37 |
Correct |
9 ms |
5512 KB |
Output is correct |
| 38 |
Correct |
9 ms |
5492 KB |
Output is correct |
| 39 |
Correct |
10 ms |
5468 KB |
Output is correct |
| 40 |
Correct |
7 ms |
5472 KB |
Output is correct |
| 41 |
Correct |
8 ms |
5472 KB |
Output is correct |
| 42 |
Correct |
9 ms |
5420 KB |
Output is correct |
| 43 |
Correct |
4 ms |
3540 KB |
Output is correct |
| 44 |
Correct |
6 ms |
4296 KB |
Output is correct |
| 45 |
Correct |
6 ms |
5472 KB |
Output is correct |
| 46 |
Correct |
6 ms |
5472 KB |
Output is correct |
| 47 |
Correct |
6 ms |
5516 KB |
Output is correct |
| 48 |
Correct |
6 ms |
5472 KB |
Output is correct |
| 49 |
Correct |
4 ms |
3680 KB |
Output is correct |
| 50 |
Correct |
6 ms |
5472 KB |
Output is correct |
| 51 |
Correct |
6 ms |
5472 KB |
Output is correct |
| 52 |
Correct |
6 ms |
5216 KB |
Output is correct |
| 53 |
Correct |
6 ms |
5472 KB |
Output is correct |
| 54 |
Correct |
5 ms |
5472 KB |
Output is correct |
| 55 |
Correct |
5 ms |
5472 KB |
Output is correct |
| 56 |
Correct |
5 ms |
5448 KB |
Output is correct |
