제출 #64014

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
64014		evpipis	Linear Garden (IOI08_linear_garden)	C++11	95 / 100	1429 ms	66560 KiB

linear_garden

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

const int len = 1e6+5;
int n, m, dp[len][3][3];
char str[len];

int add(int a, int b){
    return (a+b)%m;
}

int solve(int i, int mn, int mx){
    if (mn < -2 || mx > 2) return 0;
    if (i == n) return 1;
    if (dp[i][mn+2][mx] != -1) return dp[i][mn+2][mx];

    return dp[i][mn+2][mx] = add(solve(i+1, mn-1, max(mx-1, 0)), solve(i+1, min(mn+1, 0), mx+1));
}

int main(){
    scanf("%d %d", &n, &m);
    scanf("%s", &str);

    for (int i = 0; i < n; i++)
        for (int mn = 0; mn < 3; mn++)
            for (int mx = 0; mx < 3; mx++)
                dp[i][mn][mx] = -1;

    int mn = 0, mx = 0, ans = 1;
    for (int i = 0; i < n; i++){
        if (str[i] == 'P')
            ans = add(ans, solve(i+1, mn-1, max(mx-1, 0)));

        if (str[i] == 'L')
            mn = mn-1, mx = max(mx-1, 0);
        else
            mn = min(mn+1, 0), mx = mx+1;
    }

    printf("%d\n", ans);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:22:21: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[1000005]' [-Wformat=]
     scanf("%s", &str);
                 ~~~~^
linear_garden.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
linear_garden.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", &str);
     ~~~~~^~~~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 2 / 2
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 4 / 4
• Subtask 7: 4 / 4
• Subtask 8: 4 / 4
• Subtask 9: 4 / 4
• Subtask 10: 4 / 4
• Subtask 11: 4 / 4
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 0 / 5