제출 #691011

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
691011		Ahmed57	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	317 ms	14124 KiB

linear_garden

#include <bits/stdc++.h>

using namespace std;
int n,m;
int main(){
    cin>>n>>m;
    string s;cin>>s;
    int cnt = 2;
    int num = 1;
    int ma =0,mi = 0;
    int mm[n],nn[n],cc[n];
    for(int i = 0;i<s.size();i++){
        cc[i] = cnt;
        mm[i] = ma;
        nn[i] = mi;
        if(s[i]=='P')cnt++;
        else cnt--;
        ma = max(ma,cnt-2);
        mi = max(mi,2-cnt);
    }
    int dp[2][5][3][3];
    for(int i = 0;i<5;i++){
        for(int j = 0;j<3;j++){
            for(int k = 0;k<3;k++)dp[n%2][i][j][k] = 1;
        }
    }
    for(int i = n-1;i>=0;i--){
        if(s[i]=='P'){
            int ne = cc[i]-1;
            int r = 2+mm[i];
            int l = 2-nn[i];
            if(abs(ne-r)<=2&&abs(ne-l)<=2){
                int nma = max(mm[i],ne-2);
                int nmi = max(nn[i],2-ne);
                num+=dp[!(i%2)][ne][nma][nmi];
                num%=m;
            }
        }
        for(int j = 0;j<5;j++){
            for(int k = 0;k<3;k++){
                for(int e = 0;e<3;e++){
    int c1 = 0;
    {
        int ne = j+1;
        int r = 2+k;
        int l = 2-e;
        if(abs(ne-r)<=2&&abs(ne-l)<=2){
            int nma = max(k,ne-2);
            int nmi = max(e,2-ne);
            c1+=dp[!(i%2)][ne][nma][nmi];
            c1%=m;
        }
    }
    {
        int ne = j-1;
        int r = 2+k;
        int l = 2-e;
        if(abs(ne-r)<=2&&abs(ne-l)<=2){
            int nma = max(k,ne-2);
            int nmi = max(e,2-ne);
            c1+=dp[!(i%2)][ne][nma][nmi];
            c1%=m;
        }
    }
    dp[i%2][j][k][e] = c1;
                }
            }
        }
    }
    cout<<num<<"\n";
}

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

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:12:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     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