Submission #291483

#TimeUsernameProblemLanguageResultExecution timeMemory
291483khangalDreaming (IOI13_dreaming)C++14
Compilation error
0 ms0 KiB
#include<bits/stdc++.h> #include "dreaming.h" #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; typedef long long ll; typedef double db; typedef pair<ll,ll> pl; typedef vector<ll> vl; typedef vector<vl> vvl; #define po pop_back #define pb push_back #define mk make_pair #define mt make_tuple #define lw lower_bound #define up upper_bound #define ff first #define ss second #define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0); #define MOD 1000000007 #define MAX 1e18 #define MIN -1e18 #define rep(i,a,b) for(ll i=a;i<=b;i++) #define per(i,a,b) for(ll i=b;i>=a;i--) #define con continue #define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout); #define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628 #define read(x) scanf("%lld",&x); #define print(x) printf("%lld ",x); #define endl '\n'; typedef tree<ll , null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_multi_set; typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; // template< typename T> // using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; int n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b,c[1234567],d[1<<20],k,i,j,l,r,h,a,w,x,y,z,t; bool used[1234567]; pair<int,int> p[1234567]; vector<pl> v[1234567],vec,vv1,vv2; // string s1,s; // int sz[1234567],par[1234567]; int tr[5234567],par[1234567]; ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123]; map<ll,ll> mp; pl dfs(int x , int p){ used[x] = 1; pl res = {0, x}; for(auto &u : v[x]) { if(u.ss == p) continue; pl pp = dfs(u.ss , x); res = max(res , pl(pp.ff + u.ff , pp.ss)); } c[x] = res.ff; par[x] = p; return res; } int travelTime(int N, int M, int L, int A[], int B[], int T[]) { for (int i = 0; i < M; ++i) { v[A[i]].pb({T[i], B[i]}); v[B[i]].pb({T[i], A[i]}); } vector<int> vec; int ans, diametr = 0; for (int i = 0; i < N; ++i) { if(used[i]) continue; pl p = dfs(dfs(i , -1).ss, -1); int x = p.ss, mn = p.ff; for(int j = x; j >= 0; j = par[j]) mn = min(mn, max(c[j], p.ff - c[j])); vec.pb(mn); diametr = max(diametr, p.ff); } sort(vec.rbegin(), vec.rend()); if (vec.size() > 2) { ans = L + vec[0] + vec[1]; for(int i = 2; i < vec.size(); i++) ans = max(ans, L + L + vec[1] + vec[i]); } else if(vec.size() == 2) ans = L + vec[0] + vec[1]; else ans = 0; ans = max(ans, diametr); return ans; }

Compilation message (stderr)

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:68:78: error: no matching function for call to 'max(int&, long long int)'
   68 |         for(int j = x; j >= 0; j = par[j]) mn = min(mn, max(c[j], p.ff - c[j]));
      |                                                                              ^
In file included from /usr/include/c++/9/bits/char_traits.h:39,
                 from /usr/include/c++/9/ios:40,
                 from /usr/include/c++/9/istream:38,
                 from /usr/include/c++/9/sstream:38,
                 from /usr/include/c++/9/complex:45,
                 from /usr/include/c++/9/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:54,
                 from dreaming.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:222:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  222 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:222:5: note:   template argument deduction/substitution failed:
dreaming.cpp:68:78: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   68 |         for(int j = x; j >= 0; j = par[j]) mn = min(mn, max(c[j], p.ff - c[j]));
      |                                                                              ^
In file included from /usr/include/c++/9/bits/char_traits.h:39,
                 from /usr/include/c++/9/ios:40,
                 from /usr/include/c++/9/istream:38,
                 from /usr/include/c++/9/sstream:38,
                 from /usr/include/c++/9/complex:45,
                 from /usr/include/c++/9/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:54,
                 from dreaming.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:268:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  268 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:268:5: note:   template argument deduction/substitution failed:
dreaming.cpp:68:78: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   68 |         for(int j = x; j >= 0; j = par[j]) mn = min(mn, max(c[j], p.ff - c[j]));
      |                                                                              ^
In file included from /usr/include/c++/9/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
                 from dreaming.cpp:1:
/usr/include/c++/9/bits/stl_algo.h:3456:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3456 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3456:5: note:   template argument deduction/substitution failed:
dreaming.cpp:68:78: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   68 |         for(int j = x; j >= 0; j = par[j]) mn = min(mn, max(c[j], p.ff - c[j]));
      |                                                                              ^
In file included from /usr/include/c++/9/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
                 from dreaming.cpp:1:
/usr/include/c++/9/bits/stl_algo.h:3462:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3462 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3462:5: note:   template argument deduction/substitution failed:
dreaming.cpp:68:78: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   68 |         for(int j = x; j >= 0; j = par[j]) mn = min(mn, max(c[j], p.ff - c[j]));
      |                                                                              ^
dreaming.cpp:70:36: error: no matching function for call to 'max(int&, long long int&)'
   70 |         diametr = max(diametr, p.ff);
      |                                    ^
In file included from /usr/include/c++/9/bits/char_traits.h:39,
                 from /usr/include/c++/9/ios:40,
                 from /usr/include/c++/9/istream:38,
                 from /usr/include/c++/9/sstream:38,
                 from /usr/include/c++/9/complex:45,
                 from /usr/include/c++/9/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:54,
                 from dreaming.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:222:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  222 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:222:5: note:   template argument deduction/substitution failed:
dreaming.cpp:70:36: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   70 |         diametr = max(diametr, p.ff);
      |                                    ^
In file included from /usr/include/c++/9/bits/char_traits.h:39,
                 from /usr/include/c++/9/ios:40,
                 from /usr/include/c++/9/istream:38,
                 from /usr/include/c++/9/sstream:38,
                 from /usr/include/c++/9/complex:45,
                 from /usr/include/c++/9/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:54,
                 from dreaming.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:268:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  268 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:268:5: note:   template argument deduction/substitution failed:
dreaming.cpp:70:36: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   70 |         diametr = max(diametr, p.ff);
      |                                    ^
In file included from /usr/include/c++/9/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
                 from dreaming.cpp:1:
/usr/include/c++/9/bits/stl_algo.h:3456:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3456 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3456:5: note:   template argument deduction/substitution failed:
dreaming.cpp:70:36: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   70 |         diametr = max(diametr, p.ff);
      |                                    ^
In file included from /usr/include/c++/9/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
                 from dreaming.cpp:1:
/usr/include/c++/9/bits/stl_algo.h:3462:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3462 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3462:5: note:   template argument deduction/substitution failed:
dreaming.cpp:70:36: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   70 |         diametr = max(diametr, p.ff);
      |                                    ^
dreaming.cpp:75:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |         for(int i = 2; i < vec.size(); i++) ans = max(ans, L + L + vec[1] + vec[i]);
      |                        ~~^~~~~~~~~~~~