oj.uz

Submission #939395

# Submission time Handle Problem Language Result Execution time Memory
939395 2024-03-06T10:21:35 Z KK_1729 Laugh Analysis (IOI16_laugh) C++17
0 / 100
 0 ms 348 KB 
#include "laugh.h"
#include <bits/stdc++.h>
using namespace std;
int longest_laugh(string s)
{
    int n = s.size();
    vector<int> dp(n);
    if (s[0] == 'h' || s[0] == 'a') dp[0] = 1;
    for (int i = 0; i < n; ++i){
      if (s[i] == 'h'){
        if (s[i-1] == 'a') dp[i] = dp[i-1]+1;
      }
      if (s[i] == 'a'){
        if (s[i-1] == 'h') dp[i] = dp[i-1]+1;
      }
    }
    int ans = 0;
    for (auto x: dp) ans = max(ans, x);

    return ans;
}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB numbers differ - expected: '2', found: '1'
3 Halted 0 ms 0 KB -

Subtask #2
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB numbers differ - expected: '2', found: '1'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB numbers differ - expected: '2', found: '1'
3 Halted 0 ms 0 KB -