제출 #1033647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1033647		BuiDucManh123	Trains (BOI24_trains)	C++14	21 / 100	2137 ms	825256 KiB

Main

#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define taskname ""
using namespace std;
const int mod=1e9+7;
ll n,i,a[200009],d[200009],x[200009],f[350][350],ans[200009],res,j,block;
map<ll,int>add[350];
int main() {
	if (fopen(taskname".inp","r")) {
		freopen(taskname".inp","r",stdin);
		freopen(taskname".out","w",stdout);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>d[i]>>x[i];
    }ans[1]=1;
    block=sqrt(n);
    for(i=1;i<=n;i++){
        for(j=1;j<block;j++){
            f[j][i%j]+=add[j][i];
            f[j][i%j]%=mod;
            f[j][i%j]=(f[j][i%j]+mod)%mod;
            ans[i]+=f[j][i%j];
            ans[i]%=mod;
        }
        if(d[i]>=block){
            if(d[i]>0){
                for(j=i+d[i];j<=min(n,i+d[i]*x[i]);j+=d[i]){
                    ans[j]+=ans[i];
                    ans[j]%=mod;
                }
            }
        }else{
            if(d[i]>0){
                f[d[i]][i%d[i]]+=ans[i];
                f[d[i]][i%d[i]]%=mod;
                add[d[i]][i+d[i]*(x[i]+1)]-=ans[i];
                add[d[i]][i+d[i]*(x[i]+1)]%=mod;
            }
        }
    }for(i=1;i<=n;i++) res+=ans[i],res%=mod;;
    cout<<(res+mod)%mod;
	return 0;
}

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

Main.cpp: In function 'int main()':
Main.cpp:16:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   freopen(taskname".inp","r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:17:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |   freopen(taskname".out","w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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