# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515964 | Joo | Journey (NOI18_journey) | C++17 | 1 ms | 588 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4+10;
int n, M, H, dp[N][410];
vector<pair<int, int>> G[N];
inline void add(int &a, int b){
if(a + b >= 500000001) a = 500000001;
else a += b;
}
int main(void){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> M >> H;
for(int i = 0; i < n-1; i++){
for(int j = 0; j < H; j++){
int v, mn; cin >> v >> mn;
G[i].emplace_back(v, mn);
}
}
dp[0][0] = 1;
for(int u = 0; u < n-1; u++){
for(int m = 1; m < M; m++){
add(dp[u][m], dp[u][m-1]);
}
for(auto [v, mn] : G[u]){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |