제출 #95189

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
95189		easrui	Linear Garden (IOI08_linear_garden)	C++14	6 / 100	17 ms	2460 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
int N,M,X,Y,Z,u,d,tmpx;
int main()
{
    ios_base::sync_with_stdio(0),cin.tie(0);
    //freopen("input.txt","r",stdin);
    string S;
    cin >> N >> M >> S;
    for(int i=0; i<S.size(); i++) {
        tmpx = X;
        X = 2*Y + Z;
        Y = tmpx;
        if(S[i]=='P' && u!=2) {
            if(u==1)
                X++;
            else if(d==-2)
                Y++;
            else
                Z++;
        }
        if(S[i]=='L'){
            u = max(u+1,1);
            d = max(d+1,1);
        }
        else{
            u = min(u-1,-1);
            d = min(d-1,-1);
        }
        X %= M;
        Y %= M;
        Z %= M;
        //cout << X << Y << Z << u << d << '\n';
    }
    cout << (X+Y+Z+1)%M;
}

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

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:10:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<S.size(); i++) {
                  ~^~~~~~~~~

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