Submission #1151291

#TimeUsernameProblemLanguageResultExecution timeMemory
1151291sasdeLinear Garden (IOI08_linear_garden)C++20
0 / 100
55 ms131072 KiB
#include<bits/stdc++.h>
#define str string
#define task "strdel"
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
using namespace std;
const int N=1e6+5,lg=20;
int mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
 return u+rd()%(v-u+1);
}
int n,f[N][5][5][5],k,a[N];
string s;
int cc(int i,int cnt,int maxx,int minn,bool ok){
  // cout <<i<<" "<<cnt<<" "<<maxx<<" "<<minn<<'\n';
  if(i>n)return 1;
  if(f[i][cnt][maxx][minn]!=-1)return f[i][cnt][maxx][minn];
  int ans=0;
  int cnt1=cnt+1;
  int maxx1=max(maxx,cnt1);
  int minn1=min(minn,cnt1);
  if(maxx1-minn1<=2&&(ok||a[i]>=1))ans=(ans+cc(i+1,cnt1,maxx1,minn1,ok||a[i]>1))%mod;
   cnt1=cnt-1;
   maxx1=max(maxx,cnt1);
   minn1=min(minn,cnt1);
  if(maxx1-minn1<=2)ans=(ans+cc(i+1,cnt1,maxx1,minn1,ok||a[i]>0))%mod;
  if(ok)f[i][cnt][maxx][minn]=ans;
  return ans;
}
void solve(){
  cin >> n >> mod >> s;
  s=" "+s;
  for(int i=1;i<=n;++i){
    a[i]=(s[i]=='P');
  }
  memset(f,-1,sizeof f);
  cout << cc(1,2,2,2,0);

}
main()
{
  srand(time(0));
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    if(fopen(task".inp","r")){
      freopen(task".inp","r",stdin);
      freopen(task".out","w",stdout);
    }
    int t=1;
 //   cin >> t;
while(t--){
    solve();
    cout<<'\n';
}

}

Compilation message (stderr)

linear_garden.cpp:54:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   54 | main()
      | ^~~~
linear_garden.cpp: In function 'int main()':
linear_garden.cpp:61:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |       freopen(task".inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
linear_garden.cpp:62:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |       freopen(task".out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...