Submission #1494007


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

long long int N, d[114], i;
char s[114];

int main(){
    fill(d, d + 114, 114514);
    *d = 0;
    scanf("%lld%s", &N, s);
    for(int i = 1; i < N; ++i){
        for(int j = max(0, i - 3); j < i; ++j){
            d[i] = min(d[i], d[j]);
        }
        if(s[i] == 'X')++d[i];
    }
    cout << d[N - 1] << endl;
    return 0;
}

Submission Info

Submission Time
Task B - 雨上がり
User MMNMM
Language C++14 (GCC 5.4.1)
Score 50
Code Size 399 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%s", &N, s);
                           ^

Judge Result

Set Name All
Score / Max Score 50 / 50
Status
AC × 43
Set Name Test Cases
All case_000.txt, case_001.txt, case_002.txt, case_003.txt, case_004.txt, case_005.txt, case_006.txt, case_007.txt, case_008.txt, case_009.txt, case_010.txt, case_011.txt, case_012.txt, case_013.txt, case_014.txt, case_015.txt, case_016.txt, case_017.txt, case_018.txt, case_019.txt, case_020.txt, case_021.txt, case_022.txt, case_023.txt, case_024.txt, case_025.txt, case_026.txt, case_027.txt, case_028.txt, case_029.txt, case_030.txt, case_031.txt, case_032.txt, case_033.txt, case_034.txt, case_035.txt, case_036.txt, case_037.txt, case_038.txt, case_039.txt, case_040.txt, case_041.txt, case_042.txt
Case Name Status Exec Time Memory
case_000.txt AC 1 ms 256 KB
case_001.txt AC 1 ms 256 KB
case_002.txt AC 1 ms 256 KB
case_003.txt AC 1 ms 256 KB
case_004.txt AC 1 ms 256 KB
case_005.txt AC 1 ms 256 KB
case_006.txt AC 1 ms 256 KB
case_007.txt AC 1 ms 256 KB
case_008.txt AC 1 ms 256 KB
case_009.txt AC 1 ms 256 KB
case_010.txt AC 1 ms 256 KB
case_011.txt AC 1 ms 256 KB
case_012.txt AC 1 ms 256 KB
case_013.txt AC 1 ms 256 KB
case_014.txt AC 1 ms 256 KB
case_015.txt AC 1 ms 256 KB
case_016.txt AC 1 ms 256 KB
case_017.txt AC 1 ms 256 KB
case_018.txt AC 1 ms 256 KB
case_019.txt AC 1 ms 256 KB
case_020.txt AC 1 ms 256 KB
case_021.txt AC 1 ms 256 KB
case_022.txt AC 1 ms 256 KB
case_023.txt AC 1 ms 256 KB
case_024.txt AC 1 ms 256 KB
case_025.txt AC 1 ms 256 KB
case_026.txt AC 1 ms 256 KB
case_027.txt AC 1 ms 256 KB
case_028.txt AC 1 ms 256 KB
case_029.txt AC 1 ms 256 KB
case_030.txt AC 1 ms 256 KB
case_031.txt AC 1 ms 256 KB
case_032.txt AC 1 ms 256 KB
case_033.txt AC 1 ms 256 KB
case_034.txt AC 1 ms 256 KB
case_035.txt AC 1 ms 256 KB
case_036.txt AC 1 ms 256 KB
case_037.txt AC 1 ms 256 KB
case_038.txt AC 1 ms 256 KB
case_039.txt AC 1 ms 256 KB
case_040.txt AC 1 ms 256 KB
case_041.txt AC 1 ms 256 KB
case_042.txt AC 1 ms 256 KB