제출 #1113749

#제출 시각아이디문제언어결과실행 시간메모리
1113749thelegendary08Trains (BOI24_trains)C++17
100 / 100
781 ms356540 KiB
#include<bits/stdc++.h> #define pb push_back #define int long long #define vi vector<int> #define vvi vector<vector<int>> #define pii pair<int, int> #define vpii vector<pair<int, int>> #define vc vector<char> #define vb vector<bool> #define mii map<int,int> #define f0r(i,n) for(int i=0;i<n;i++) #define FOR(i,k,n) for(int i=k;i<n;i++) #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define in(a) int a; cin>>a #define in2(a,b) int a,b; cin>>a>>b #define in3(a,b,c) int a,b,c; cin>>a>>b>>c #define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d #define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];} #define out(a) cout<<a<<'\n' #define out2(a,b) cout<<a<<' '<<b<<'\n' #define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n' #define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n' #define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n' #define dout(a) cout<<a<<' '<<#a<<'\n' #define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n' #define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';} const int leg = 1e9 + 7; const int mod = 998244353; using namespace std; signed main(){ ios::sync_with_stdio(false); cin.tie(NULL); //ifstream cin(".in"); //ofstream cout(".out"); in(n); vpii v; f0r(i,n){ in2(a,b); v.pb({a,b}); } vi dp(n); dp[n-1] = 1; int s = floor(sqrt(n)); vector<vector<vi>> w(s+1, vvi(s+1)); FOR(i, 1, s+1){ w[i][(n - 1) % i].pb(1); } for(int i = n-2; i>=0; i--){ int d = v[i].first; int x = v[i].second; if(v[i].first != 0){ int m = i % d; if(v[i].first <= s){ if(x >= w[d][m].size()){ //out(i); if(w[d][m].size() == 0)dp[i] = 1; else dp[i] = (w[d][m][w[d][m].size() - 1] + 1) % leg; } else{ //dout(i); //out2(w[d][m][w[d][m].size() - 1], w[d][m][w[d][m].size() - 1 - x]); //vout(w[d][m]); int thing = w[d][m][w[d][m].size() - 1] - w[d][m][w[d][m].size() - 1 - x] + 1; if(thing < 0)thing += leg; dp[i] = thing; } } else{ for(int j = i + d; j <= min(n-1, i + d * x); j += d){ dp[i] += dp[j]; dp[i] %= leg; } dp[i]++; dp[i] %= leg; } } else dp[i] = 1; FOR(j, 1, s+1){ if(w[j][i % j].size() > 0)w[j][i % j].pb((w[j][i % j][w[j][i % j].size() - 1] + dp[i]) % leg); else w[j][i % j].pb(dp[i]); } } //vout(dp); out(dp[0]); }

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

Main.cpp: In function 'int main()':
Main.cpp:57:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     if(x >= w[d][m].size()){
      |        ~~^~~~~~~~~~~~~~~~~
#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...