제출 #56176

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
56176		aquablitz11	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	292 ms	62464 KiB

linear_garden

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

const int N = 1000010;
const int INF = 1e9;

int n, m;
char str[N];
int dp[N][15];

inline int add(int a, int b) { return (a+b)%m; }
inline int pos(int mn, int mx, int bal)
{
    if (mn == 0) {
        if (mx == 0) return 0;
        if (mx == 1) return 1+bal;
        if (mx == 2) return 3+bal;
    } else if (mn == -1) {
        if (mx == 0) return 7+bal;
        if (mx == 1) return 9+bal;
    } else if (mn == -2) {
        if (mx == 0) return 13+bal;
    }
    return 14;
}

int main()
{
    scanf("%d%d %s", &n, &m, str);
    for (int i = n; i >= 0; --i) {
        for (int mn = -2; mn <= 0; ++mn) {
            for (int mx = max(mn, 0); mx-mn <= 2; ++mx) {
                for (int bal = mn; bal <= mx; ++bal) {
                    int j = pos(mn, mx, bal);
                    if (i == n) dp[i][j] = 1;
                    else dp[i][j] = add(dp[i+1][pos(min(mn, bal-1), mx, bal-1)], dp[i+1][pos(mn, max(mx, bal+1), bal+1)]);
                }
            }
        }
    }
    
    int mn = 0, mx = 0, bal = 0, ans = 1;
    for (int i = 0; i < n; ++i) {
        if (str[i] == 'P') {
            ans = add(ans, dp[i+1][pos(min(mn, bal-1), mx, bal-1)]);
            ++bal;
            mx = max(mx, bal);
        } else {
            --bal;
            mn = min(mn, bal);
        }
    }
    printf("%d\n", ans);

    return 0;
}

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

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d %s", &n, &m, 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: 5 / 5