oj.uz

Submission #246911

# Submission time Handle Problem Language Result Execution time Memory
246911 2020-07-10T14:14:37 Z ritikpatel05 Journey (NOI18_journey) C++17
100 / 100
 270 ms 40052 KB 
/*
	Author: Ritik Patel
*/
 
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& STL DEBUGGER &&&&&&&&&&&&&&&&&&&&&&&&&&&
 
// #define _GLIBCXX_DEBUG       // Iterator safety; out-of-bounds access for Containers, etc.
// #pragma GCC optimize "trapv" // abort() on (signed) integer overflow.
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& LIBRARIES &&&&&&&&&&&&&&&&&&&&&&&&&&&
 
#include <bits/stdc++.h>
using namespace std;
 
/*#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
template<typename T, typename V = __gnu_pbds::null_type>
using ordered_set = __gnu_pbds::tree<T, V, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>; 
*/
//find_by_order()->returns an iterator to the k-th largest element(0-based indexing)
//order_of_key()->Number of items that are strictly smaller than our item
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& DEFINES &&&&&&&&&&&&&&&&&&&&&&&&&&&
 
#define int long long int
// #define ll long long int
#define all(i) i.begin(), i.end()
#define sz(a) (int)a.size()
 
// #define ld long double
// const ld PI  = 3.141592;
const int dx4[4] = {0, 1, 0, -1};
const int dy4[4] = {-1, 0, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dy8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& DEBUG &&&&&&&&&&&&&&&&&&&&&&&&&&&
 
#define XOX
vector<string> vec_splitter(string s) {
    for(char& c: s) c = c == ','?  ' ': c;
    stringstream ss; ss << s;
    vector<string> res;
    for(string z; ss >> z; res.push_back(z));
    return res;
}
 
void debug_out(vector<string> __attribute__ ((unused)) args, __attribute__ ((unused)) int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
    if(idx > 0) cerr << ", ";
    stringstream ss; ss << H;
    cerr << args[idx] << " = " << ss.str();
    debug_out(args, idx + 1, T...);
}
 
#ifdef XOX
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __VA_ARGS__)
#else
#define debug(...) 42
#endif
 
 
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& CODE &&&&&&&&&&&&&&&&&&&&&&&&&&&

int N, M, H;
const int MAXN = 1e4 + 5;
vector<pair<int, int>> v[MAXN];
const int MX = 5e8 + 1;

int memo[MAXN][405];

int dp(int u, int hours){
    if(hours < 0) return 0;
    if(u == 0 and hours == 0){
        return 1;
    }
    auto &res = memo[u][hours];
    if(res != -1){
        return res;
    }
    res = 0;
    for(auto &to: v[u]){
        if(to.first >= u){
            continue;
        }
        res += dp(to.first, hours - to.second);
        if(res > MX){
            break;
        }
    }
    if(u != N - 1){
        res += dp(u, hours - 1);
    }
    if(res > MX){
        res = MX;
    }
    return res;
}

void solve(){
    memset(memo, -1, sizeof(memo));
    cin >> N >> M >> H;
    for(int i = 0; i + 1 < N; ++i){
        for(int j = 0; j < H; ++j){
            int x, y; cin >> x >> y;
            v[x].push_back({i, y});
        }
    }
    for(int i = 0; i < M; ++i){
        cout << dp(N - 1, i) << " ";
    }
    cout << '\n';
}
 
 
 
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr); 
    int T = 1; 
    // cin >> T;
    for(int i = 1; i <= T; ++i){
        // brute();
        solve();
    }
    return 0;
}
 
/*
Sample inp
*/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 32256 KB Output is correct
2 Correct 22 ms 32256 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 32256 KB Output is correct
2 Correct 22 ms 32256 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 32256 KB Output is correct
2 Correct 22 ms 32256 KB Output is correct
3 Correct 22 ms 32256 KB Output is correct
4 Correct 22 ms 32256 KB Output is correct
5 Correct 23 ms 32504 KB Output is correct
6 Correct 22 ms 32384 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 32256 KB Output is correct
2 Correct 22 ms 32256 KB Output is correct
3 Correct 22 ms 32256 KB Output is correct
4 Correct 22 ms 32256 KB Output is correct
5 Correct 23 ms 32504 KB Output is correct
6 Correct 22 ms 32384 KB Output is correct
7 Correct 128 ms 40052 KB Output is correct
8 Correct 270 ms 37112 KB Output is correct
9 Correct 41 ms 32896 KB Output is correct
10 Correct 55 ms 35192 KB Output is correct