oj.uz

Submission #400830

# Submission time Handle Problem Language Result Execution time Memory
400830 2021-05-08T18:01:42 Z kshitij_sodani Shortcut (IOI16_shortcut) C++14
Compilation error
 0 ms 0 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
//#define endl '\n'
 
#include "shortcut.h"
//vector<pair<llo,llo>> adj[1000001];
llo dist[6001][6001];
vector<pair<llo,llo>> adj[1000001];
void dfs(llo no,llo par=-1,llo no2=-1,llo lev=0){
	dist[no2][no]=lev;
	for(auto j:adj[no]){
		if(j.a!=par){
			dfs(j.a,no,no2,lev+j.b);
		}
	}
}
long long find_shortcut(int n, std::vector<int> aa, std::vector<int> bb, int cc)
{
	for(int i=0;i<n-1;i++){
		adj[i].pb({i+1,aa[i]});
		adj[i+1].pb({i,aa[i]});
	}
	for(int i=0;i<n;i++){
		adj[i].pb({n+i,bb[i]});
		adj[n+i].pb({i,bb[i]});
	}
	for(int i=0;i<2*n;i++){
		dfs(i,-1,i);
	}
	/*for(int i=0;i<2*n;i++){
		for(int j=0;j<2*n;j++){
			cout<<dist[i][j]<<",";
		}
		cout<<endl;
	}*/
	llo ans=1e18;
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			llo ma=0;
			llo ind=j;
		//	llo su=0;
			//llo su2=0;
			//llo su3=dist[i][j];
			vector<pair<int,int>> ss;
			for(int k=i;k<=j;k++){
				/*if(k>0){
					su+=aa[k];
				}*/
 
				while(ind>i){
					if(dist[k][i]+dist[ind-1][j]+cc<=dist[k][ind-1]){
						ind--;
					}
					else{
						break;
					}
				}
				ss.pb({i,ind});
 
				//ma=max(ma,eval(i,ind));
				if(ind>i){
					ss.pb({i,ind-1});
					//ma=max(ma,eval(ind,i));
				}
			}
			//if(cc<=dist[i][j]){
				llo ma3=0;
				for(int k=i;k>=0;k--){
					ma3=max(ma3,dist[k+n][i]);
				}
				llo ma4=0;
				for(int k=j;k<n;k++){
					ma4=max(ma4,dist[k+n][j]);
				}
				ma=max(ma,ma3+ma4+min(cc,dist[i][j]));
			//}
			/*llo ma2=0;
			for(int k=i;k<=j;k++){
				llo xx=min(dist[i][k]+cc,dist[k][j]);
				ma2=max(ma2,xx+bb[k]);
			}
			for(int k=j;k<n;k++){
				ma=max(ma,dist[k][j]+bb[k]+ma2);
			}
			ma2=0;
			for(int k=j;k>=i;k--){
				llo xx=min(dist[k][j]+cc,dist[k][i]);
				ma2=max(ma2,xx+bb[k]);
			}
			for(int k=i;k>=0;k--){
				ma=max(ma,bb[k]+ma2+dist[k][i]);
			}*/
			//if(cc<=su3){
			for(int k=0;k<=i;k++){
				for(int l=j;l<n;l++){
					k+=n;
					l+=n;
					ma=max(ma,min(dist[k][l],min(dist[k][i]+cc+dist[j][l],dist[k][j]+cc+dist[i][l])));
					k-=n;
					l-=n;				
				}
			}
		//}
			for(int k=0;k<=i;k++){
				for(int l=j;l<n;l++){
					k+=n;
					l+=n;
					ma=max(ma,min(dist[k][l],min(dist[k][i]+cc+dist[j][l],dist[k][j]+cc+dist[i][l])));
					k-=n;
					l-=n;				}
			}
			for(int k=i;k<=j;k++){
				for(int l=j;l<n;l++){
					k+=n;
					l+=n;
					ma=max(ma,min(dist[k][l],min(dist[k][i]+cc+dist[j][l],dist[k][j]+cc+dist[i][l])));
					k-=n;
					l-=n;
				}
			}
			for(int k=i;k<=j;k++){
				for(int l=0;l<=i;l++){
					k+=n;
					l+=n;
					ma=max(ma,min(dist[k][l],min(dist[k][i]+cc+dist[j][l],dist[k][j]+cc+dist[i][l])));
					k-=n;
					l-=n;
				}
			}
			for(auto kk:ss){
				int k=kk.a+n;
				int l=kk.b+n;
				ma=max(ma,min(dist[k][l],min(dist[k][i]+cc+dist[j][l],dist[k][j]+cc+dist[i][l])));
			}
			for(int k=i;k<=j;k++){
				for(int l=k;l<=j;l++){
					k+=n;
					l+=n;
					ma=max(ma,min(dist[k][l],min(dist[k][i]+cc+dist[j][l],dist[k][j]+cc+dist[i][l])));
					k-=n;
					l-=n;
				}
			}
			for(int k=0;k<=i;k++){
				for(int l=k;l<=i;l++){
					k+=n;
					l+=n;
					ma=max(ma,min(dist[k][l],min(dist[k][i]+cc+dist[j][l],dist[k][j]+cc+dist[i][l])));
					k-=n;
					l-=n;
				}
			}
			for(int k=j;k<n;k++){
				for(int l=k;l<n;l++){
					k+=n;
					l+=n;
					ma=max(ma,min(dist[k][l],min(dist[k][i]+cc+dist[j][l],dist[k][j]+cc+dist[i][l])));
					k-=n;
					l-=n;
				}
			}
 
 
			/*for(int k=n;k<2*n;k++){
				for(int l=k;l<2*n;l++){
					ma=max(ma,min(dist[k][l],min(dist[k][i]+cc+dist[j][l],dist[k][j]+cc+dist[i][l])));		
					
				}
			}*/
			/*if(ma==0){
				cout<<i<<":"<<j<<endl;
			}*/
			ans=min(ans,ma);
		}
	}
 
 
 
 
    return ans;
}

Compilation message

shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:81:40: error: no matching function for call to 'min(int&, llo&)'
   81 |     ma=max(ma,ma3+ma4+min(cc,dist[i][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 shortcut.cpp:2:
/usr/include/c++/9/bits/stl_algobase.h:198:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  198 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:198:5: note:   template argument deduction/substitution failed:
shortcut.cpp:81:40: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'llo' {aka 'long long int'})
   81 |     ma=max(ma,ma3+ma4+min(cc,dist[i][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 shortcut.cpp:2:
/usr/include/c++/9/bits/stl_algobase.h:246:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  246 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:246:5: note:   template argument deduction/substitution failed:
shortcut.cpp:81:40: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'llo' {aka 'long long int'})
   81 |     ma=max(ma,ma3+ma4+min(cc,dist[i][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 shortcut.cpp:2:
/usr/include/c++/9/bits/stl_algo.h:3444:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3444 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3444:5: note:   template argument deduction/substitution failed:
shortcut.cpp:81:40: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   81 |     ma=max(ma,ma3+ma4+min(cc,dist[i][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 shortcut.cpp:2:
/usr/include/c++/9/bits/stl_algo.h:3450:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3450 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3450:5: note:   template argument deduction/substitution failed:
shortcut.cpp:81:40: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   81 |     ma=max(ma,ma3+ma4+min(cc,dist[i][j]));
      |                                        ^