Submission #1197743

#	Time	Username	Problem	Language	Result	Execution time	Memory
1197743		steveonalex	Laugh Analysis (IOI16_laugh)	C++20	100 / 100	2 ms	584 KiB

laugh

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
#include "laugh.h"

bool check(char c){
    return (c == 'a' || c == 'h');
}

int longest_laugh(string s){
    int ans = 0;
    for(char c: s){
        if (check(c)) ans = 1;
    }   
    if (ans == 0) return 0;
    int cur = 0;
    for(int i = 1; i < (int)s.size(); ++i){
        if (s[i-1] != s[i] && check(s[i-1]) && check(s[i])){
            if (cur == 0) cur = 2;
            else if (cur >= 2) cur++;
        }
        else cur = 0;
        maximize(ans, cur);
    }
    return ans;
}

Compilation message (stderr)

laugh.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
laugh_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 21 / 21
• Subtask 2: 26 / 26
• Subtask 3: 53 / 53