제출 #219836

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

linear_garden

#include <bits/stdc++.h> 
 
using namespace std ; 
const int N = 5e5 + 7 ; 
long long n , mod , ans ; 
string s ; 
 
int mv2[2] = {0 , 1} , mv1[2] = {1 , 0} ; 
 
long long add (long long a , long long b){
    return (a%mod + b%mod + mod) %mod ; 
}
 
int dp[N][2][2][2];

int smart(int i , bool l , bool d , bool b, int val){
    if(dp[i][l][d][b]!=-1)return dp[i][l][d][b] ; 
    if(i > n)return 0 ; 
    if(i==n){
        return 1 ; 
    }
    int ret = 0 ; 
    ret= add( ret , smart(i+1 , !l , 0 , d , val* 10 + 1-l) )  ; 
    if(!b){
        if(d){
            ret= add(ret , smart(i+2 , !l , 1 , 0 , (val*10 + 1- l)*10  + 1-l  )  ) ; 
        }else{
            ret= add( ret , smart(i+2 , !l , 1 ,0 , (val*10 + 1-l) * 10 + 1-l  ) )  ; 
        }       
    }
    return dp[i][l][d][b] = ret ; 
}
int smart_solve(int i , int l , int d , int b){
    if(!l)b =1  ; 
    int ret = smart(i , l , d , b , 0); 
    return ret ;
}

int main(){
    memset(dp , -1 , sizeof dp) ; 
    ios_base::sync_with_stdio(0) ; 
    cin.tie(0) ; 
    //freopen("in.in" , "r" , stdin) ; 
    cin>>n>>mod ; 
    cin>> s ; 
 
    int l = 1 ; 
    int d = 0 ; 
    int bad = 0 ; 
    int val = 0 ; 
    for(int i = 0 ;i < n;i++){
        if(s[i] == 'L'){
            l = 0 ;     
            val = val*10 + l ; 
        }else{  
            val = val * 10 + 1 ;
            int cant = 0 ; 
            if(i > 1){
                if(s[i-1]=='L' && s[i-2] == 'L'){
                    cant = 1 ; 
                }
            }
            if(cant)continue ; 
            if(i > 1 && l==1)d = 1 ; 
            ans=add (ans , smart_solve(i , l , d , !l ) );
            l = 1 ; 
        }
    }
    cout<<add(ans , 1); 
    return 0 ; 
}

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

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:49:9: warning: unused variable 'bad' [-Wunused-variable]
     int bad = 0 ; 
         ^~~

• 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