제출 #486723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
486723		Spade1	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	19 ms	5184 KiB

linear_garden

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
using namespace std;

int t[1000010];
char s[1000010];

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    scanf("%s", s + 1);
    t[0] = 1;
    for (int i = 1; i <= n; ++i) t[i] = (2*t[i - 1]) % m;
    int h = 0, l = 0; ll ans = 0;
    int cur = 0;
    for (int i = 1; i <= n; ++i) {
        h = max(h, cur);
        l = min(l, cur);
        if (s[i] == 'L') ++cur;
        if (s[i] == 'P') {
            ++cur;
            if (cur - l > 2) {

            }
            else if (max(cur, h) - l == 2){
                if (cur == (max(cur, h) + l)/2) {
                    ans += t[(n-i+1)/2];
                    ans %= m;
                }
                else {
                    ans += t[(n-i)/2];
                    ans %= m;
                }
            }
            else {
                ans += t[(n-i)/2] + t[(n-i+1)/2] - 1;
                ans %= m;
            }
            cur -= 2;
        }
    }

    printf("%d", (ans + 1) % m);

    return 0;
}

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

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:47:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   47 |     printf("%d", (ans + 1) % m);
      |             ~^   ~~~~~~~~~~~~~
      |              |             |
      |              int           long long int
      |             %lld
linear_garden.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
linear_garden.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%s", s + 1);
      |     ~~~~~^~~~~~~~~~~~~

• 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