# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994709 | 2024-06-08T04:14:45 Z | salmon | Trains (BOI24_trains) | C++14 | 46 ms | 28848 KB |
#include <bits/stdc++.h> using namespace std; vector<int> v; set<int> sat[100100]; int N; int d,x; vector<pair<int,int>> iv; long long int num[100100]; long long int mod = 1'000'000'007; vector<vector<int>> w; map<int,int> mep; int main(){ scanf(" %d",&N); for(int i = 0; i < N; i++){ scanf(" %d",&d); scanf(" %d",&x); v.push_back(d); iv.push_back({d,x}); num[i] = 0; } for(int i = 0; i < N; i++){ if(iv[i].first != 0){ d = iv[i].first; x = iv[i].second; for(int j = 1; j <= x && j * d + i < N; j++){ sat[j * d + i].insert(d); if(iv[j * d + i].first == d){ x = max(x,j + iv[j * d + i].second); iv[j * d + i] = {0,0}; } } } } num[0] = 1; long long int sum = 1; for(int i = 1; i < N; i++){ for(int j : sat[i]){ num[i] += num[i - j]; } num[i] %= mod; sum = (sum + num[i]) % mod; } printf("%lld",sum); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 5724 KB | Output is correct |
2 | Incorrect | 1 ms | 5608 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 5724 KB | Output is correct |
2 | Incorrect | 1 ms | 5608 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 5724 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 46 ms | 28848 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 5724 KB | Output is correct |
2 | Incorrect | 1 ms | 5608 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |