Submission #878533

#TimeUsernameProblemLanguageResultExecution timeMemory
878533cpptowinFactories (JOI14_factories)C++17
Compilation error
0 ms0 KiB
#include"factories.h" #include<bits/stdc++.h> #define fo(i,d,c) for(int i=d;i<=c;i++) #define fod(i,c,d) for(int i=c;i>=d;i--) #define maxn 1000010 #define pb emplace_back #define inf 1000000000 #define pii pair<int,int> #define vii vector<pii> #define vi vector<int> using namespace std; vii ke[maxn]; int par[maxn][20],sz[maxn]; long long d[maxn]; int ind[maxn],head[maxn],cnt = 1; vector<pair<int,pair<long long,int>>> adj[maxn]; void dfs(int u,int parent) { sz[u] = 1; for(auto [v,w] : ke[u]) { if(v == parent) continue; par[v][0] = u; d[v] = d[u] + w; dfs(v,u); sz[u] += sz[v]; } } void hld(int u,int parent) { if(head[cnt] == 0) head[cnt] = u; ind[u] = cnt; int sc = -1,maxx = -1; for(auto [v,w] : ke[u]) if(v != parent) { if(maxx < sz[v]) { maxx = sz[v]; sc = v; } } if(sc != -1) hld(sc,u); for(auto [v,w] : ke[u]) if(v != parent and v != sc) { cnt++; hld(v,u); } } void get(int u,int t) { long long val = d[u]; int uchain,vchain = ind[1]; while(1) { uchain = ind[u]; adj[uchain].push_back({u,val,t}); if(uchain == vchain) return; u = ind[u]; u = par[head[u]][0]; } } void Init(int N,int A[],int B[],int D[]) { fo(i,0,N - 2) { ke[A[i] + 1].pb(B[i] + 1,D[i]); ke[B[i] + 1].pb(A[i] + 1,D[i]); } dfs(1,1); hld(1,1); } long long Query(int S, int X[], int T, int Y[]) { long long ans = 2e18; fo(i,0,S - 1) get(X[i] + 1,0); fo(i,0,T - 1) get(Y[i] + 1,1); fo(i,1,cnt) { long long minn[2]; minn[0] = minn[1] = 2e18; sort(adj[i].begin(),adj[i].end(),[](pair<int,pair<long long,int>> a,pair<int,pair<long long,int>> b) { return d[a.fi] > d[b.fi]; }); for(auto it : adj[i]) { int v = it.fi; int dist = it.se.fi; int t = it.se.se; ans = min(ans,minn[1 - t] - 2 * d[v] + dist); minn[t] = min(minn[t],dist); } adj[i].clear(); } return ans; }

Compilation message (stderr)

factories.cpp: In function 'void get(int, int)':
factories.cpp:56:40: error: no matching function for call to 'std::vector<std::pair<int, std::pair<long long int, int> > >::push_back(<brace-enclosed initializer list>)'
   56 |         adj[uchain].push_back({u,val,t});
      |                                        ^
In file included from /usr/include/c++/10/vector:67,
                 from /usr/include/c++/10/functional:62,
                 from /usr/include/c++/10/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/10/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from factories.cpp:2:
/usr/include/c++/10/bits/stl_vector.h:1187:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<int, std::pair<long long int, int> >; _Alloc = std::allocator<std::pair<int, std::pair<long long int, int> > >; std::vector<_Tp, _Alloc>::value_type = std::pair<int, std::pair<long long int, int> >]'
 1187 |       push_back(const value_type& __x)
      |       ^~~~~~~~~
/usr/include/c++/10/bits/stl_vector.h:1187:35: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type&' {aka 'const std::pair<int, std::pair<long long int, int> >&'}
 1187 |       push_back(const value_type& __x)
      |                 ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_vector.h:1203:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = std::pair<int, std::pair<long long int, int> >; _Alloc = std::allocator<std::pair<int, std::pair<long long int, int> > >; std::vector<_Tp, _Alloc>::value_type = std::pair<int, std::pair<long long int, int> >]'
 1203 |       push_back(value_type&& __x)
      |       ^~~~~~~~~
/usr/include/c++/10/bits/stl_vector.h:1203:30: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::vector<std::pair<int, std::pair<long long int, int> > >::value_type&&' {aka 'std::pair<int, std::pair<long long int, int> >&&'}
 1203 |       push_back(value_type&& __x)
      |                 ~~~~~~~~~~~~~^~~
factories.cpp: In lambda function:
factories.cpp:83:24: error: 'struct std::pair<int, std::pair<long long int, int> >' has no member named 'fi'
   83 |             return d[a.fi] > d[b.fi];
      |                        ^~
factories.cpp:83:34: error: 'struct std::pair<int, std::pair<long long int, int> >' has no member named 'fi'
   83 |             return d[a.fi] > d[b.fi];
      |                                  ^~
factories.cpp: In function 'long long int Query(int, int*, int, int*)':
factories.cpp:87:24: error: 'struct std::pair<int, std::pair<long long int, int> >' has no member named 'fi'
   87 |             int v = it.fi;
      |                        ^~
factories.cpp:88:27: error: 'struct std::pair<int, std::pair<long long int, int> >' has no member named 'se'
   88 |             int dist = it.se.fi;
      |                           ^~
factories.cpp:89:24: error: 'struct std::pair<int, std::pair<long long int, int> >' has no member named 'se'
   89 |             int t = it.se.se;
      |                        ^~
factories.cpp:91:39: error: no matching function for call to 'min(long long int&, int&)'
   91 |             minn[t] = min(minn[t],dist);
      |                                       ^
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 factories.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:
factories.cpp:91:39: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   91 |             minn[t] = min(minn[t],dist);
      |                                       ^
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 factories.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:
factories.cpp:91:39: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   91 |             minn[t] = min(minn[t],dist);
      |                                       ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from factories.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:
factories.cpp:91:39: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   91 |             minn[t] = min(minn[t],dist);
      |                                       ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from factories.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:
factories.cpp:91:39: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   91 |             minn[t] = min(minn[t],dist);
      |                                       ^