제출 #1033375

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1033375		modwwe	Trains (BOI24_trains)	C++17	100 / 100	184 ms	127520 KiB

Main

//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    int a,b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c,d,e,f;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int kk;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
 ///fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    //  modwwe
    phongbeo();
}
int S=316;
int dp[100002][317];
ib a[100001];
int c[1000001];
int add(int x,int y)
{
     if(x+y>=mod2) x-=mod2;
     if(x+y<0)x+=mod2;
      return x+y;
}
void phongbeo()
{
    cin>>n;
    for(int i=1;i<=n;++i)
    {
         cin>>a[i].a>>a[i].b;
          if(a[i].a!=0)a[i].b=min(a[i].b,(n-i)/a[i].a);
    }
c[1]=1;
    for(int i=1;i<=n;i++)
    {

         for(int j=1;j<=min(S,i);j++)
            dp[i][j]=add(dp[i][j],dp[i-j][j]),
            c[i]=add(c[i],dp[i][j]);
          if(a[i].a!=0){
         if(a[i].a<=S) {
                if(i+a[i].a<=n)dp[i+a[i].a][a[i].a]=add(dp[i+a[i].a][a[i].a],c[i]);
          if(i+a[i].a*(a[i].b+1)<=n)dp[i+a[i].a*(a[i].b+1)][a[i].a]=add(dp[i+a[i].a*(a[i].b+1)][a[i].a],-c[i]);
         }
         else  for(int j=1;j<=a[i].b;j++){
           if(i+j*a[i].a<=n)
          c[i+j*a[i].a]=add(c[i+j*a[i].a],c[i]);}
          }
            s2=add(s2,c[i]);
    }
     cout<<s2;
}

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

Main.cpp:20:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   20 | const int inf=1e18;
      |               ^~~~
Main.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main()
      | ^~~~

• Subtask 1: 8 / 8
• Subtask 2: 13 / 13
• Subtask 3: 16 / 16
• Subtask 4: 34 / 34
• Subtask 5: 29 / 29