Submission #95190

#	Time	Username	Problem	Language	Result	Execution time	Memory
95190		easrui	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	17 ms	2452 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 = d+1;
        }
        else{
            u = u-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;
}

Compilation message (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: 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