DMOJ · wc18c3j4

WC '18 Contest 3 J4 - Leveling Up

This C++ solution uses sorting & greedy for DMOJ wc18c3j4 WC '18 Contest 3 J4 - Leveling Up. Read the reasoning, inspect the code, or try your own test case below.

wc18c3j4Data structuresSorting & greedyC++35 lines
Solution128of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Sorting & greedy

Leveling Up ordering and reachability process match the sorted-position and deque simulation.

Data structures

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

leveling_up.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        int n; cin >> n;
        int s, l; cin >> s >> l;
        queue<pair<int, int>> q;
        stack<pair<int, int>> st;
        vector<tuple<int, int, int>> v;
        for(int i = 0; i < n; i++){
            int p, m, g; cin >> p >> m >> g;
            v.emplace_back(p, m, g);
        }
        sort(v.begin(), v.end());
        for(int i = 0; i < v.size(); i++){
            auto[x, y, z] = v[i];
            if(x > s) q.push({y, z});
            else st.push({y, z});
        }
        while((!st.empty() && st.top().first <= l) || (!q.empty() && q.front().first <= l)){
            if(!q.empty() && q.front().first <= l){
                l += q.front().second;
                q.pop();
            } 
            if(!st.empty() && st.top().first <= l){
                l += st.top().second;
                st.pop();
            }
        }
        cout << l << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.