제출 #263638

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
263638		Nucleist	Linear Garden (IOI08_linear_garden)	C++14	65 / 100	1591 ms	29800 KiB

linear_garden

//Self-control leads to consistency.
#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define EPS 0.000001
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
void setIO(string s) {
  ios_base::sync_with_stdio(0); cin.tie(0); 
  freopen((s+".in").c_str(),"r",stdin);
  freopen((s+".out").c_str(),"w",stdout);
}
ll n,m;
map<pair<dos,dos>,ll>dp,ans1;
ve hed;
ll ans=0;
int main()
{
  //flash;
  cin>>n;
  cin>>m;
  string in;
  cin>>in;
  ll dif=0;
  ll low=0;
  ll high=0;
  ll rank=0;
  for (ll i = 0; i < sz(in); ++i)
  {
    if(in[i]=='P' && abs(dif-high+1)<=2 && abs(dif-low+1)<=2 && abs(dif+1)<=2){
      //rank=(rank+dp[{{i,max(high,dif+1)},{min(low,dif+1),dif+1}}])%m;
      ans1[{{i,max(high,dif+1)},{min(low,dif+1),dif+1}}]=1;
    }
    if(in[i]=='L'){
      dif++;
      high=max(high,dif);
      low=min(low,dif);
    }
    else {
      dif--;
      low=min(low,dif);
      high=max(high,dif);
    }
  }
  for (ll index = n-1; index >= 0; index--)
  {
    for (ll high = -2; high <= 2; ++high)
    {
      for (ll low = -2; low <= 2; ++low)
      {
        for (ll cur = -2; cur <= 2; ++cur)
        {
          ll ans=0;
          if(index==n-1){dp[{{index,high},{low,cur}}]=1;continue;}
          if(abs(cur-high+1)<=2 && abs(cur-low+1)<=2 && abs(cur+1)<=2){
            ll sol=cur+1;
            ans=(ans+dp[{{index+1,max(high,sol)},{min(low,sol),sol}}])%m;
          }
          if(abs(cur-high-1)<=2 && abs(cur-low-1)<=2 && abs(cur-1)<=2){
            ll sol=cur-1;
            ans=(ans+dp[{{index+1,max(high,sol)},{min(low,sol),sol}}])%m;
          }
          dp[{{index,high},{low,cur}}]=ans;
          if(ans1.find({{index,high},{low,cur}})!=ans1.end()){
            ans1[{{index,high},{low,cur}}]=ans;
          }
        }
      }
    } 
    auto k=dp;
    for(auto it:dp){
      if(it.first.first.first==index+1)k.erase(it.first);
    }
    dp=k;
  }
  dif=0;
  low=0;
  high=0;
  rank=0;
  for (ll i = 0; i < sz(in); ++i)
  {
    if(in[i]=='P' && abs(dif-high+1)<=2 && abs(dif-low+1)<=2 && abs(dif+1)<=2){
      rank=(rank+ans1[{{i,max(high,dif+1)},{min(low,dif+1),dif+1}}])%m;
      //ans[{{i,max(high,dif+1)},{min(low,dif+1),dif+1}}]=1;
    }
    if(in[i]=='L'){
      dif++;
      high=max(high,dif);
      low=min(low,dif);
    }
    else {
      dif--;
      low=min(low,dif);
      high=max(high,dif);
    }
  }
  cout<<(rank+1)%m;
  return 0;
}

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

linear_garden.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("O3")
      | 
linear_garden.cpp:6: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("unroll-loops")
      | 
linear_garden.cpp: In function 'void setIO(std::string)':
linear_garden.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   28 |   freopen((s+".in").c_str(),"r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
linear_garden.cpp:29:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   29 |   freopen((s+".out").c_str(),"w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• 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: 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