# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
956587 | 2024-04-02T07:52:03 Z | DeltaStruct | Laugh Analysis (IOI16_laugh) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h> #include "laugh.h" using namespace std; int longest_laugh(string s){ int r = 0; for (int i(0),k(0),j(0);i < s.size();++i){ k = (s[i]==string("ah")[k&1]?k+1:(int)(s[i]=='a')); j = (s[i]==string("ha")[j&1]?j+1:(int)(s[i]=='a')); r = max(r,k); } return r; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | numbers differ - expected: '1', found: '0' |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | numbers differ - expected: '1', found: '0' |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | numbers differ - expected: '1', found: '0' |
5 | Halted | 0 ms | 0 KB | - |