Submission #671635

#	Time	Username	Problem	Language	Result	Execution time	Memory
671635		shrimb	Race (IOI11_race)	C++17	Compilation error	0 ms	0 KiB

race

#include "race.h"
#include <bits/stdc++.h>
using namespace std;

vector<pair<int,int>>adj[200001];
int dsu[200001],sz[200001];
map<long long,int> store[200001];
long long sum[200001];
long long ans = INT_MAX, K;

int Find(int x){
    if(dsu[x] == x) return x;
    else return dsu[x] = Find(dsu[x]);
}

void Unite(int a, int b, long long cur_k, int cur_depth){
    a = Find(a); b = Find(b);
    if(sz[a] > sz[b]) swap(a,b);
    sz[b] += sz[a];
    dsu[a] = b;
    for(auto s: store[a]){
        if(store[b].count(cur_k - s.first)){
            ans = min(ans, (long long)s.second - cur_depth + store[b][cur_k - s.first] - cur_depth);
        }
    }
    for(auto s: store[a]){
        if(!store[b].count(s.first) or store[b][s.first] > s.second){
            store[b][s.first] = s.second;
        }
    }
}
void dfs(int x, int par, int depth){
    for(auto s: adj[x]){
        if(s.first != par){
            sum[s.first] = s.second + sum[x];
            dfs(s.first, x, depth + 1);
        }
    }
    map<long long,int>p;
    p[sum[x]] = depth;
    store[x] = p;
    for(auto s: adj[x]){
        if(s.first != par){
            Unite(x, s.first, 2 * sum[x] + K, depth);
        }
    }
    int b = Find(x);
    if(store[b].count(sum[x] + K) != 0) ans = min(ans, store[b][sum[x] + K]  - depth);
}
signed best_path(signed n, signed k, signed h[][2], signed l[]){
    ans = INT_MAX;
    for(int i = 0; i < n - 1; i++){
        h[i][0]++; h[i][1]++;
        adj[h[i][0]].push_back({h[i][1], l[i]});
        adj[h[i][1]].push_back({h[i][0], l[i]});
    }
    K = k;
    dfs(1, 0, 1);

    if(ans == INT_MAX) ans = -1;
  return ans;
}

Compilation message (stderr)

race.cpp: In function 'void dfs(int, int, int)':
race.cpp:48:85: error: no matching function for call to 'min(long long int&, std::map<long long int, int>::mapped_type)'
   48 |     if(store[b].count(sum[x] + K) != 0) ans = min(ans, store[b][sum[x] + K]  - depth);
      |                                                                                     ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from race.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  230 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:230:5: note:   template argument deduction/substitution failed:
race.cpp:48:85: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'std::map<long long int, int>::mapped_type' {aka 'int'})
   48 |     if(store[b].count(sum[x] + K) != 0) ans = min(ans, store[b][sum[x] + K]  - depth);
      |                                                                                     ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from race.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  278 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:278:5: note:   template argument deduction/substitution failed:
race.cpp:48:85: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'std::map<long long int, int>::mapped_type' {aka 'int'})
   48 |     if(store[b].count(sum[x] + K) != 0) ans = min(ans, store[b][sum[x] + K]  - depth);
      |                                                                                     ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from race.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3468:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3468 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3468:5: note:   template argument deduction/substitution failed:
race.cpp:48:85: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   48 |     if(store[b].count(sum[x] + K) != 0) ans = min(ans, store[b][sum[x] + K]  - depth);
      |                                                                                     ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from race.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3474:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3474 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3474:5: note:   template argument deduction/substitution failed:
race.cpp:48:85: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   48 |     if(store[b].count(sum[x] + K) != 0) ans = min(ans, store[b][sum[x] + K]  - depth);
      |                                                                                     ^