oj.uz

Submission #851531

# Submission time Handle Problem Language Result Execution time Memory
851531 2023-09-20T04:29:17 Z bachhoangxuan Flip it and Stick it (CCO23_day2problem1) C++17
25 / 25
 4 ms 1372 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int cc[2];

void solve(){
    string s,t;cin >> s >> t;
    int cnt=0,num=0,len=(int)t.length(),n=(int)s.length();
    for(int i=0;i<=n-len;i++) cnt+=(t==s.substr(i,len));
    for(int i=0;i<n;i++) num+=(s[i]==t[0]);
    if(len==1){
        if(cnt) cout << -1 << '\n';
        else cout << 0 << '\n';
    }
    else if(len==2){
        if(t[0]==t[1] && num>(n+1)/2) cout << -1 << '\n';
        else cout << cnt << '\n';
    }
    if(len==3){
        if(t[0]!=t[2]) cout << cnt << '\n';
        else if(t[0]!=t[1]) cout << (cnt+1)/2 << '\n';
        else{
            if(num>(2*(n/3)+n%3)) cout << -1 << '\n';
            else{
                int res=0;s+=(t[0]^1);
                vector<int> d;
                int cur=0;
                for(int i=0;i<(int)s.length();i++){
                    if(s[i]!=t[0]){
                        if(cur<=1) cc[cur]++;
                        else d.push_back(cur);
                        cur=0;
                    }
                    else cur++;
                }
                for(int x:d){
                    while(x>=4 && cc[0]) cc[0]--,x-=2,res++;
                    while(x>=3 && cc[1]) cc[1]--,x--,res++;
                    if(x>=3){
                        cc[0]--;
                        res++;
                    }
                }
                cout << res << '\n';
            }
        }
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 2 ms 856 KB Output is correct
6 Correct 2 ms 856 KB Output is correct
7 Correct 2 ms 856 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 3 ms 992 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 856 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 3 ms 1112 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 3 ms 992 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 856 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 3 ms 1112 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 3 ms 992 KB Output is correct
21 Correct 2 ms 856 KB Output is correct
22 Correct 3 ms 856 KB Output is correct
23 Correct 2 ms 856 KB Output is correct
24 Correct 3 ms 856 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 992 KB Output is correct
28 Correct 3 ms 856 KB Output is correct
29 Correct 3 ms 996 KB Output is correct
30 Correct 3 ms 1112 KB Output is correct
31 Correct 3 ms 856 KB Output is correct
32 Correct 3 ms 1060 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 3 ms 992 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 3 ms 992 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 856 KB Output is correct
13 Correct 3 ms 992 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 856 KB Output is correct
13 Correct 3 ms 856 KB Output is correct
14 Correct 3 ms 856 KB Output is correct
15 Correct 3 ms 856 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 2 ms 856 KB Output is correct
18 Correct 2 ms 856 KB Output is correct
19 Correct 3 ms 856 KB Output is correct
20 Correct 2 ms 856 KB Output is correct
21 Correct 2 ms 996 KB Output is correct
22 Correct 3 ms 856 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 3 ms 992 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 3 ms 992 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 3 ms 856 KB Output is correct
13 Correct 3 ms 992 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 3 ms 856 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 3 ms 856 KB Output is correct
27 Correct 3 ms 856 KB Output is correct
28 Correct 3 ms 856 KB Output is correct
29 Correct 4 ms 856 KB Output is correct
30 Correct 2 ms 856 KB Output is correct
31 Correct 2 ms 856 KB Output is correct
32 Correct 3 ms 856 KB Output is correct
33 Correct 2 ms 856 KB Output is correct
34 Correct 2 ms 996 KB Output is correct
35 Correct 3 ms 856 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 3 ms 856 KB Output is correct
39 Correct 4 ms 1248 KB Output is correct
40 Correct 2 ms 992 KB Output is correct
41 Correct 3 ms 856 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 3 ms 992 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 4 ms 980 KB Output is correct
46 Correct 3 ms 1372 KB Output is correct
47 Correct 3 ms 1248 KB Output is correct
48 Correct 3 ms 1372 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 3 ms 856 KB Output is correct
55 Correct 3 ms 856 KB Output is correct
56 Correct 3 ms 860 KB Output is correct
57 Correct 2 ms 992 KB Output is correct
58 Correct 3 ms 856 KB Output is correct
59 Correct 2 ms 856 KB Output is correct
60 Correct 2 ms 992 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 3 ms 856 KB Output is correct
66 Correct 2 ms 856 KB Output is correct
67 Correct 3 ms 984 KB Output is correct
68 Correct 3 ms 856 KB Output is correct
69 Correct 2 ms 992 KB Output is correct
70 Correct 3 ms 992 KB Output is correct
71 Correct 3 ms 992 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct