oj.uz

답안 #1079452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079452 2024-08-28T14:55:57 Z MrPavlito JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 14 ms 6672 KB 
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
//#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;

signed main()
{
    //ios_base::sync_with_stdio(false),cin.tie(0), cout.tie(0);
    int tt=1;
    ///cin >> tt;
    while(tt--)
    {
        int n,k;
        cin >> n >> k;
        vector<int>jpref(n+1,0);
        vector<int>ipref(n+1,0);
        vector<int>opref(n+1,0);
        vector<int>svij;
        vector<int>svio;
        string s;cin >> s;
        for(int i=0; i<n; i++)
        {
            if(s[i] == 'O')opref[i+1] ++;
            else if(s[i] == 'J')
            {
                jpref[i+1] ++;
                svij.pb(i);
            }
            opref[i+1] += opref[i];
            jpref[i+1] += jpref[i];
        }
        for(int i=n-1; i>=0; i--)
        {
            if(s[i] == 'I')ipref[i]++;
            ipref[i]+= ipref[i+1];
        }
        int rez = inf;
        int jpointer = 0;
        for(int i=0; i<n; i++)
        {
            if(s[i]== 'J' && jpref[i+1] >= k)
            {
                int l = i+1; int r = n-1;int p = inf;
                while(l<=r)
                {
                    int mid = l+r>>1;
                    bool b1 = ipref[mid] >= k;
                    bool b2 = opref[mid+1] - opref[i] >=k;
                    if(b1 && b2)
                    {
                        p = mid;
                        r = mid-1;
                    }
                    else if(b1)l = mid+1;
                    else if(b2)r = mid-1;
                    else break;
                }
                if(p == inf)continue;
                int trazi = ipref[p] - k+1;
                l = p, r = n-1;
                while(l<=r)
                {
                    int mid = l+r>>1;
                    if(ipref[mid] >= trazi)
                    {
                        l = mid+1;
                        p = mid;
                    }
                    else r = mid-1;
                }
                rez = min(rez, p-svij[jpointer]-1-3*k+2);
                jpointer++;
            }
        }
        if(rez== inf)cout << -1 << endl;
        else cout << rez << endl;
    }
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:57:32: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |                     int mid = l+r>>1;
      |                               ~^~
ho_t2.cpp:74:32: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   74 |                     int mid = l+r>>1;
      |                               ~^~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 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 1 ms 348 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 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 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 1 ms 348 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 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 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 408 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 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 1 ms 348 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 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 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 408 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 11 ms 5732 KB Output is correct
37 Correct 13 ms 6500 KB Output is correct
38 Correct 13 ms 6592 KB Output is correct
39 Correct 13 ms 6500 KB Output is correct
40 Correct 10 ms 6500 KB Output is correct
41 Correct 11 ms 6576 KB Output is correct
42 Correct 14 ms 6500 KB Output is correct
43 Correct 6 ms 4196 KB Output is correct
44 Correct 7 ms 4968 KB Output is correct
45 Correct 8 ms 6492 KB Output is correct
46 Correct 9 ms 6500 KB Output is correct
47 Correct 8 ms 6496 KB Output is correct
48 Correct 8 ms 6500 KB Output is correct
49 Correct 5 ms 4260 KB Output is correct
50 Correct 7 ms 6500 KB Output is correct
51 Correct 9 ms 6496 KB Output is correct
52 Correct 8 ms 5908 KB Output is correct
53 Correct 7 ms 6672 KB Output is correct
54 Correct 10 ms 6500 KB Output is correct
55 Correct 7 ms 6500 KB Output is correct
56 Correct 6 ms 6568 KB Output is correct