DMOJ · dwite12c1p4

Trick or Tree'ing

This C++ solution uses string processing for DMOJ dwite12c1p4 Trick or Tree'ing. Read the reasoning, inspect the code, or try your own test case below.

dwite12c1p4Graphs & treesString processingC++38 lines
Solution227of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

String processing

Trick or Tree'ing matches the serialized tree expression and required candies/roads totals.

Graphs & trees

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

4_Trick_or_Tree_ing.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t = 5;
        while (t--) {
            string s; getline(cin, s);
            int cnt = 0;
            for (int i = 0, j = 0; i < s.size(); i++) {
                j = i;
                string cur = "";
                while (j < s.size() && isdigit(s[j])) {
                    cur += s[j];
                    j++;
                    i = j - 1;
                }
                if (!cur.empty()) cnt += stoi(cur);
            }
            int open = 0, depth = 0, max_depth = 0;
            for (char c : s) {
                if (c == '(') {
                    open++;
                    depth++;
                    max_depth = max(max_depth, depth);
                } else if (c == ')') {
                    depth--;
                }
            }
            int edges = 2 * open;
            int roads = 2 * edges - max_depth;
            cout << roads << " " << cnt << '\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.