Submission #940485

#TimeUsernameProblemLanguageResultExecution timeMemory
940485andrei_boacaSightseeing in Kyoto (JOI22_kyoto)C++17
0 / 100
211 ms308560 KiB
#include <bits/stdc++.h> using namespace std; ofstream fout("date.out"); mt19937 rng(chrono::steady_clock().now().time_since_epoch().count()); typedef long long ll; const ll INF=1e17; ll n,m; ll A[100005],B[100005]; vector<vector<ll>> dp; ll from[10005][10005]; string dig(ll x) { string s; while(x!=0) { s.push_back(char('0'+x%10)); x/=10; } while(s.size()<4) s.push_back('0'); reverse(s.begin(),s.end()); return s; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); vector<ll> lins,cols; ll minA=INF,minB=INF; cin>>n>>m; for(int i=1;i<=n;i++) { //A[i]=A[i-1]+rng()%100+1; cin>>A[i]; minA=min(minA,A[i]); } for(int i=1;i<=m;i++) { //B[i]=B[i-1]+rng()%100+1; cin>>B[i]; minB=min(minB,B[i]); } ll minim=INF; for(int i=n;i>=1;i--) { if(A[i]<minim) { lins.push_back(i); minim=min(minim,A[i]); } } minim=INF; for(int i=m;i>=1;i--) { if(B[i]<minim) { cols.push_back(i); minim=min(minim,B[i]); } } minim=INF; for(int i=1;i<=n;i++) if(A[i]<minim) { lins.push_back(i); minim=A[i]; } minim=INF; for(int i=1;i<=m;i++) if(B[i]<minim) { cols.push_back(i); minim=B[i]; } sort(lins.begin(),lins.end()); sort(cols.begin(),cols.end()); lins.erase(unique(lins.begin(),lins.end()),lins.end()); cols.erase(unique(cols.begin(),cols.end()),cols.end()); dp.clear(); dp.resize(lins.size()); for(int i=0;i<lins.size();i++) dp[i].resize(cols.size()); for(int i=0;i<lins.size();i++) for(int j=0;j<cols.size();j++) if(i!=0||j!=0) { dp[i][j]=INF; if(i>0&&dp[i-1][j]+B[cols[j]]*(lins[i]-lins[i-1])<dp[i][j]) { dp[i][j]=min(dp[i][j],dp[i-1][j]+B[cols[j]]*(lins[i]-lins[i-1])); from[i][j]=1; } if(j>0&&dp[i][j-1]+A[lins[i]]*(cols[j]-cols[j-1])<dp[i][j]) { dp[i][j]=min(dp[i][j],dp[i][j-1]+A[lins[i]]*(cols[j]-cols[j-1])); from[i][j]=2; } } ll ans=dp[(int)lins.size()-1][(int)cols.size()-1]; cout<<ans; int i=(int)lins.size()-1; int j=(int)cols.size()-1; int prv=0; int changes=0; while(i!=0||j!=0) { if(from[i][j]!=prv&&prv!=0) changes++; prv=from[i][j]; if(from[i][j]==1) i--; else j--; } assert(changes<=100); return 0; }

Compilation message (stderr)

kyoto.cpp: In function 'int main()':
kyoto.cpp:82:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for(int i=0;i<lins.size();i++)
      |                 ~^~~~~~~~~~~~
kyoto.cpp:84:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(int i=0;i<lins.size();i++)
      |                 ~^~~~~~~~~~~~
kyoto.cpp:85:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         for(int j=0;j<cols.size();j++)
      |                     ~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...