| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 997890 |
2024-06-13T04:56:59 Z |
imarn |
Trains (BOI24_trains) |
C++14 |
|
260 ms |
8648 KB |
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int blc=351,inf=1e9+7;
ll sum[351][351]{0};
priority_queue<pair<int,ll>,vector<pair<int,ll>>,greater<pair<int,ll>>>pq[blc][blc];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;cin>>n;pii g[n+1];ll dp[n]={0};dp[0]=1;
for(int i=0;i<n;i++)cin>>g[i].f>>g[i].s;ll ans=0;
for(int i=0;i<n;i++){
for(int j=1;j<blc;j++){
while(!pq[i%j][j].empty()&&pq[i%j][j].top().f<i)sum[i%j][j]-=pq[i%j][j].top().s,pq[i%j][j].pop(),sum[i%j][j]%=inf;
}
for(int j=1;j<blc;j++){
dp[i]+=sum[i%j][j];dp[i]%=inf;
}
if(g[i].f>=blc){int cur=i;
for(int j=1;j<=g[i].s;j++){
cur+=g[i].f;if(cur>=n)break;
dp[cur]+=dp[i];dp[cur]%=inf;
}
}
else if(g[i].f!=0){
pq[i%g[i].f][g[i].f].push({i+g[i].f*g[i].s,dp[i]});
sum[i%g[i].f][g[i].f]+=dp[i];sum[i%g[i].f][g[i].f]%=inf;
}ans+=dp[i];ans%=inf;
}cout<<(ans%inf+inf)%inf;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 8 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 9 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 10 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
4696 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 8 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 9 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 10 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
4696 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4696 KB |
Output is correct |
| 2 |
Correct |
17 ms |
5056 KB |
Output is correct |
| 3 |
Correct |
12 ms |
4956 KB |
Output is correct |
| 4 |
Correct |
24 ms |
5096 KB |
Output is correct |
| 5 |
Correct |
227 ms |
5924 KB |
Output is correct |
| 6 |
Correct |
255 ms |
8396 KB |
Output is correct |
| 7 |
Correct |
251 ms |
8648 KB |
Output is correct |
| 8 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 9 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 10 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 11 |
Correct |
25 ms |
5216 KB |
Output is correct |
| 12 |
Correct |
260 ms |
8416 KB |
Output is correct |
| 13 |
Correct |
1 ms |
4696 KB |
Output is correct |
| 14 |
Correct |
26 ms |
5212 KB |
Output is correct |
| 15 |
Correct |
257 ms |
8372 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
123 ms |
6008 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 8 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 9 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 10 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
4696 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
