답안 #932614

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
932614	2024-02-23T23:31:55 Z	Ice_man	Sightseeing in Kyoto (JOI22_kyoto)	C++14	10 / 100	6 ms	8352 KB

kyoto

#include <iostream>
#include <chrono>

#define maxn 1005
#define maxlog 20
#define INF 1000000010
#define LINF 1000000000000000005
#define endl '\n'
#define pb(x) push_back(x)
#define X first
#define Y second
#define control cout<<"passed"<<endl;

#pragma GCC optimize("O3" , "Ofast" , "unroll-loops" , "fast-math")
#pragma GCC target("avx2")

using namespace std;

std::chrono::high_resolution_clock::time_point startT, currT;
constexpr double TIME_MULT = 1;

double timePassed()
{
    using namespace std::chrono;
    currT = high_resolution_clock::now();
    double time = duration_cast<duration<double>>(currT - startT).count();
    return time * TIME_MULT;
}


int n, m;

int a[maxn], b[maxn];
long long dp[maxn][maxn];

void read()
{
    cin >> n >> m;

    for(int i = 1; i <= n; i++)
        cin >> a[i];

    for(int i = 1; i <= m; i++)
        cin >> b[i];
}

void calc_dp()
{
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
        {
            if(i == 1 && j == 1)
            {
                dp[i][j] = 0;
                continue;
            }

            if(i == 1)
            {
                dp[i][j] = dp[i][j - 1] + a[i];
                continue;
            }

            if(j == 1)
            {
                dp[i][j] = dp[i - 1][j] + b[j];
                continue;
            }

            dp[i][j] = min(dp[i][j - 1] + a[i] , dp[i - 1][j] + b[j]);

        }

    cout << dp[n][m] << endl;
}




int main()
{

    /**#ifdef ONLINE_JUDGE
        freopen("taxi.in", "r", stdin);
        freopen("taxi.out", "w", stdout);
    #endif*/

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    startT = std::chrono::high_resolution_clock::now();

    read();
    calc_dp();


    return 0;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	5 ms	8352 KB	Output is correct
10	Correct	5 ms	8284 KB	Output is correct
11	Correct	5 ms	8284 KB	Output is correct
12	Correct	5 ms	8284 KB	Output is correct
13	Correct	5 ms	8284 KB	Output is correct
14	Correct	5 ms	8284 KB	Output is correct
15	Correct	5 ms	8284 KB	Output is correct
16	Correct	6 ms	8156 KB	Output is correct
17	Correct	6 ms	8284 KB	Output is correct
18	Correct	0 ms	460 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	460 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	2 ms	4700 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	5 ms	8352 KB	Output is correct
10	Correct	5 ms	8284 KB	Output is correct
11	Correct	5 ms	8284 KB	Output is correct
12	Correct	5 ms	8284 KB	Output is correct
13	Correct	5 ms	8284 KB	Output is correct
14	Correct	5 ms	8284 KB	Output is correct
15	Correct	5 ms	8284 KB	Output is correct
16	Correct	6 ms	8156 KB	Output is correct
17	Correct	6 ms	8284 KB	Output is correct
18	Correct	0 ms	460 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	460 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Incorrect	2 ms	4700 KB	Output isn't correct
32	Halted	0 ms	0 KB	-