oj.uz

Submission #940379

# Submission time Handle Problem Language Result Execution time Memory
940379 2024-03-07T08:44:43 Z andrei_boaca Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
 1 ms 604 KB 
#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;
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++)
    {
        cin>>A[i];
        minA=min(minA,A[i]);
    }
    for(int i=1;i<=m;i++)
    {
        cin>>B[i];
        minB=min(minB,B[i]);
    }
    ll minim=INF;
    for(int i=n;i>=1;i--)
    {
        if(A[i]<minim||A[i]==minA||i==1)
        {
            lins.push_back(i);
            minim=min(minim,A[i]);
        }
    }
    minim=INF;
    for(int i=m;i>=1;i--)
    {
        if(B[i]<minim||B[i]==minB||i==1)
        {
            cols.push_back(i);
            minim=min(minim,B[i]);
        }
    }
    reverse(lins.begin(),lins.end());
    reverse(cols.begin(),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][j]=min(dp[i][j],dp[i-1][j]+B[cols[j]]*(lins[i]-lins[i-1]));
                if(j>0)
                    dp[i][j]=min(dp[i][j],dp[i][j-1]+A[lins[i]]*(cols[j]-cols[j-1]));
            }
    ll ans=dp[(int)lins.size()-1][(int)cols.size()-1];
    cout<<ans;
    return 0;
}

Compilation message

kyoto.cpp: In function 'int main()':
kyoto.cpp:63:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for(int i=0;i<lins.size();i++)
      |                 ~^~~~~~~~~~~~
kyoto.cpp:65:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i=0;i<lins.size();i++)
      |                 ~^~~~~~~~~~~~
kyoto.cpp:66:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for(int j=0;j<cols.size();j++)
      |                     ~^~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Incorrect 1 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -