제출 #928957

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928957		De3b0o	Sightseeing in Kyoto (JOI22_kyoto)	C++14	10 / 100	4 ms	8284 KiB

kyoto

#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define er erase
#define pb push_back
#define ppb pop_back()
#define ph push
#define pp pop()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "YES" << "\n";
#define no cout << "NO" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007

using namespace std;

ll fp(ll x , ll y)
{
    if(y==0)
        return 1;
    ll z = fp(x,y/2);
    if(y&1)
        return z*z*x;
    else
        return z*z;
}

ll grid[1009][1009];

int main()
{
    d3
    ll h , w;
    cin >> h >> w;
    ll a[h];
    ll b[w];
    for(int i = 0 ; h>i ; i++)
        cin >> a[i];
    for(int i = 0 ; w>i ; i++)
        cin >> b[i];
    grid[0][0]=0;
    for(int i = 1 ; h>i ; i++)
        grid[i][0]=i*b[0];
    for(int i = 1 ; w>i ; i++)
        grid[0][i]=i*a[0];
    for(int i = 1 ; h>i ; i++)
        for(int j = 1 ; w>j ; j++)
            grid[i][j]=min(grid[i-1][j]+b[j],grid[i][j-1]+a[i]);
    cout << grid[h-1][w-1];
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 30
• Subtask 3: 0 / 60