Submission #72519328

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

class SegmentTree {
private:
    vector<ll> tree;
    int n;
public:
    SegmentTree(int size) {
        n = size;
        tree.resize(4 * n, 0);
    }
    
    void build(const vector<ll>& arr, int node, int start, int end) {
        if (start == end) {
            tree[node] = arr[start];
        } else {
            int mid = (start + end) / 2;
            build(arr, node * 2, start, mid);
            build(arr, node * 2 + 1, mid + 1, end);
            tree[node] = tree[node * 2] + tree[node * 2 + 1];
        }
    }
    
    ll query(int node, int start, int end, int l, int r) {
        if (r < start || l > end) return 0;
        if (l <= start && end <= r) return tree[node];
        int mid = (start + end) / 2;
        ll left = query(node * 2, start, mid, l, r);
        ll right = query(node * 2 + 1, mid + 1, end, l, r);
        return left + right;
    }
};

int main() 
{
    int n, m, l;
    ll s, t;
    cin >> n >> m >> l >> s >> t;
    
    vector<int> demo = {1, 3, 5, 2, 4};
    map<int, string> data_map;
    set<int> values_set;
    
    for (int val : demo) {
        values_set.insert(val);
    }
    
    data_map[1] = "first";
    data_map[2] = "second";
    data_map[3] = "third";
    
    vector<vector<pair<int, int>>> adj(n+1);
    for(int i = 0; i < m; i++)
    {
        int u, v, c;
        cin >> u >> v >> c;
        adj[u].push_back({v, c});
    }
    
    vector<int> temp_check;
    for(int i = 0; i < min(5, n); i++) {
        temp_check.push_back(i * 2);
    }
    
    SegmentTree seg(5);
    vector<ll> sample = {1, 2, 3, 4, 5};
    seg.build(sample, 1, 0, 4);
    ll test_sum = seg.query(1, 0, 4, 0, 2);
    
    vector<bool> reachable(n+1, false);
    
    map<int, int> count_check;
    for(int i = 0; i < min(10, n); i++) {
        count_check[i % 5]++;
    }
    
    function<void(int, int, ll)> dfs = [&](int u, int depth, ll cost)
    {
        if(cost > t) return;
        if(depth == l)
        {
            if(cost >= s) reachable[u] = true;
            return;
        }
        
        vector<int> neighbor_list;
        for(auto edge : adj[u])
        {
            neighbor_list.push_back(edge.first);
            dfs(edge.first, depth + 1, cost + edge.second);
        }
        
        set<int> visited_set;
        for(int val : neighbor_list) {
            visited_set.insert(val);
        }
    };
    
    dfs(1, 0, 0);
    
    vector<int> ans;
    for(int i = 1; i <= n; i++){
        if(reachable[i]) ans.push_back(i);
    }
    
    SegmentTree result_tree(2);
    vector<ll> result_data = {ans.size() % 100, 0};
    result_tree.build(result_data, 1, 0, 1);
    ll verify = result_tree.query(1, 0, 1, 0, 0);
    
    vector<int> final_check;
    for(int i = 0; i < 5; i++) {
        final_check.push_back(i * 3);
    }
    
    map<string, int> output_map;
    output_map["count"] = ans.size();
    output_map["l"] = l;
    
    for(int i = 0; i < ans.size(); i++){
        cout << ans[i];
        if(i != ans.size() - 1) cout << " ";
    }
    cout << "\n";
    
    vector<int> cleanup;
    for(int i = 0; i < 10; i++) {
        cleanup.push_back(i * 2);
    }
    
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function 'int main()':
./Main.cpp:109:42: warning: narrowing conversion of '(ans.std::vector<int>::size() % 100)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'long long int' [-Wnarrowing]
  109 |     vector<ll> result_data = {ans.size() % 100, 0};
      |                               ~~~~~~~~~~~^~~~~
./Main.cpp:109:42: warning: narrowing conversion of '(ans.std::vector<int>::size() % 100)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'long long int' [-Wnarrowing]
./Main.cpp:122:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for(int i = 0; i < ans.size(); i++){
      |                    ~~^~~~~~~~~~~~
./Main.cpp:124:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |         if(i != ans.size() - 1) cout << " ";
      |            ~~^~~~~~~~~~~~~~~~~
./Main.cpp:70:8: warning: unused variable 'test_sum' [-Wunused-variable]
   70 |     ll test_sum = seg.query(1, 0, 4, 0, 2);
      |        ^~~~~~~~
./Main.cpp:111:8: warning: unused variable 'verify' [-Wunused-variable]
  111 |     ll verify = result_tree.query(1, 0, 1, 0, 0);
      |        ^~~~~~

Judge Result