제출 #1274538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1274538		sasde	Flooding Wall (BOI24_wall)	C++20	36 / 100	609 ms	472748 KiB

Main

#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#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 int long long
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time   cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e4+5,lg=30,mod=1e9+7,lim=1000;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
 return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,a[N],b[N],po[N],val[2][N][1005],pre[2][N][1005],suf[2][N][1005];
bool M2;
void solve(){
  cin >> node;
  for(int i=1;i<=node;++i)cin >> a[i];
  for(int i=1;i<=node;++i)cin >> b[i];
  po[0]=1;
  for(int i=1;i<=node;++i)po[i]=1LL*po[i-1]*2%mod;
  val[0][0][1]=1;
  for(int i=1;i<=lim;++i){
    pre[0][0][i]=(pre[0][0][i-1]+val[0][0][i])%mod;
  }
  // cout <<pre[0][0][9];
  for(int i=lim;i>=1;--i){
    suf[0][0][i]=(suf[0][0][i+1]+val[0][0][i])%mod;
  }
  for(int i=1;i<=node;++i){
    for(int j=a[i];j<=lim;++j){
        if(j>a[i]){
          val[0][i][j]=(val[0][i][j]+val[0][i-1][j])%mod;
        }
        else{
          // if(i==1)cout<<0<<" "<<i-1<<" "<<j<<'\n';
          val[0][i][j]=(val[0][i][j]+pre[0][i-1][j])%mod;
        }
    }
    for(int j=b[i];j<=lim;++j){
        if(j>b[i]){
          val[0][i][j]=(val[0][i][j]+val[0][i-1][j])%mod;
        }
        else{
            val[0][i][j]=(val[0][i][j]+pre[0][i-1][j])%mod;
        }
    }
    for(int j=1;j<=lim;++j){
      pre[0][i][j]=(pre[0][i][j-1]+val[0][i][j])%mod;
    }
    for(int j=lim;j>=1;--j){
      suf[0][i][j]=(suf[0][i][j+1]+val[0][i][j])%mod;
    }
  }

  val[1][node+1][1]=1;
  for(int i=1;i<=lim;++i){
    pre[1][node+1][i]=pre[1][node+1][i-1]+val[1][node+1][i];
  }
  for(int i=lim;i>=1;--i){
    suf[1][node+1][i]=suf[1][node+1][i+1]+val[1][node+1][i];
  }
  for(int i=node;i>=1;--i){
    for(int j=a[i];j<=lim;++j){
        if(j>a[i]){
          val[1][i][j]=(val[1][i][j]+val[1][i+1][j])%mod;
        }
        else{
          val[1][i][j]=(val[1][i][j]+pre[1][i+1][j])%mod;
        }
    }
    for(int j=b[i];j<=lim;++j){
        if(j>b[i]){
          val[1][i][j]=(val[1][i][j]+val[1][i+1][j])%mod;
        }
        else{
          val[1][i][j]=(val[1][i][j]+pre[1][i+1][j])%mod;
        }
    }
    for(int j=1;j<=lim;++j){
      pre[1][i][j]=(pre[1][i][j-1]+val[1][i][j])%mod;
    }
    for(int j=lim;j>=1;--j){
      suf[1][i][j]=(suf[1][i][j+1]+val[1][i][j])%mod;
    }
  }
  int ans=0;
  for(int i=2;i<node;++i){
    for(int j=a[i]+1;j<=lim;++j)ans=(ans+suf[0][i-1][j]*val[1][i+1][j]%mod*j%mod)%mod;
    for(int j=a[i]+1;j<=lim;++j)ans=(ans+suf[1][i+1][j+1]*val[0][i-1][j]%mod*j%mod)%mod;
    for(int j=b[i]+1;j<=lim;++j)ans=(ans+suf[0][i-1][j]*val[1][i+1][j]%mod*j%mod)%mod;
    for(int j=b[i]+1;j<=lim;++j)ans=(ans+suf[1][i+1][j+1]*val[0][i-1][j]%mod*j%mod)%mod;
      // cout <<a[i]+1<<" "<<suf[0][i-1][3]<<" "<<val[1][i+1][3]<<" "<<suf[1][i+1][3]<<" "<<val[0][i-1][2]<<'\n';
      ans=(ans-a[i]*suf[1][i+1][a[i]+1]%mod*suf[0][i-1][a[i]+1]%mod)%mod;
      ans=(ans-b[i]*suf[1][i+1][b[i]+1]%mod*suf[0][i-1][b[i]+1]%mod)%mod;
  }
  cout << (ans+mod)%mod;
}
main()
{
  srand(time(0));
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    #define task "aws"
    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';
}
look_memory;
look_time;
}

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

Main.cpp:117:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  117 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:125:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |       freopen(task".inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:126:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |       freopen(task".out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 17 / 17
• Subtask 3: 19 / 19
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 30