답안 #786498

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
786498	2023-07-18T08:27:00 Z	eltu0815	Sightseeing in Kyoto (JOI22_kyoto)	C++14	40 / 100	599 ms	67648 KB

kyoto

#include <bits/stdc++.h>
#define MAX 500005
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define inf (1987654321)
 
using namespace std;    
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
int n, m, q;
int a[100005], b[100005];
ll dp[2005][2005];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= m; ++i) cin >> b[i];
    
    vector<int> row, col;
    for(int i = 1, p = inf; i <= n; ++i) if(p > a[i]) row.push_back(i), p = a[i];
    for(int i = 1, p = inf; i <= m; ++i) if(p > b[i]) col.push_back(i), p = b[i];
    
    int rmx = row.back(), cmx = col.back();
    for(int i = n, p = inf; i >= rmx; --i) if(p > a[i]) row.push_back(i), p = a[i];
    for(int i = m, p = inf; i >= cmx; --i) if(p > b[i]) col.push_back(i), p = b[i];
    sort(row.begin(), row.end()); row.erase(unique(row.begin(), row.end()), row.end());
    sort(col.begin(), col.end()); col.erase(unique(col.begin(), col.end()), col.end());
    
    for(int i = 0; i < (int)col.size(); ++i) dp[0][i] = (ll)a[row[0]] * (col[i] - 1);
    for(int i = 1; i < (int)row.size(); ++i) {
        for(int j = 0; j < (int)col.size(); ++j) {
            if(j == 0) dp[i][0] = (ll)b[col[0]] * (row[i] - 1);
            else {
                dp[i][j] = INF;
                dp[i][j] = min(dp[i][j], dp[i - 1][j] + (ll)b[col[j]] * (row[i] - row[i - 1]));
                dp[i][j] = min(dp[i][j], dp[i][j - 1] + (ll)a[row[i]] * (col[j] - col[j - 1]));
            }
        }
    }
    cout << dp[row.size() - 1][col.size() - 1];
    return 0;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	8 ms	12116 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	7 ms	12156 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	0 ms	340 KB	Output is correct
28	Correct	0 ms	340 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	2 ms	3924 KB	Output is correct
4	Correct	5 ms	2132 KB	Output is correct
5	Correct	6 ms	2512 KB	Output is correct
6	Correct	2 ms	468 KB	Output is correct
7	Correct	11 ms	1096 KB	Output is correct
8	Correct	11 ms	1164 KB	Output is correct
9	Correct	12 ms	3432 KB	Output is correct
10	Correct	12 ms	3340 KB	Output is correct
11	Correct	40 ms	32476 KB	Output is correct
12	Correct	15 ms	3796 KB	Output is correct
13	Correct	12 ms	3860 KB	Output is correct
14	Correct	31 ms	31932 KB	Output is correct
15	Correct	12 ms	1108 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct

Subtask #3
0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	8 ms	12116 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	7 ms	12156 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	0 ms	340 KB	Output is correct
28	Correct	0 ms	340 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	2 ms	3924 KB	Output is correct
32	Correct	5 ms	2132 KB	Output is correct
33	Correct	6 ms	2512 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	11 ms	1096 KB	Output is correct
36	Correct	11 ms	1164 KB	Output is correct
37	Correct	12 ms	3432 KB	Output is correct
38	Correct	12 ms	3340 KB	Output is correct
39	Correct	40 ms	32476 KB	Output is correct
40	Correct	15 ms	3796 KB	Output is correct
41	Correct	12 ms	3860 KB	Output is correct
42	Correct	31 ms	31932 KB	Output is correct
43	Correct	12 ms	1108 KB	Output is correct
44	Correct	0 ms	340 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	0 ms	340 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	0 ms	340 KB	Output is correct
50	Correct	0 ms	340 KB	Output is correct
51	Correct	0 ms	340 KB	Output is correct
52	Correct	1 ms	340 KB	Output is correct
53	Correct	0 ms	340 KB	Output is correct
54	Correct	1 ms	340 KB	Output is correct
55	Correct	8 ms	724 KB	Output is correct
56	Correct	1 ms	340 KB	Output is correct
57	Correct	1 ms	852 KB	Output is correct
58	Correct	3 ms	1364 KB	Output is correct
59	Correct	16 ms	1120 KB	Output is correct
60	Correct	17 ms	1176 KB	Output is correct
61	Correct	18 ms	4032 KB	Output is correct
62	Correct	18 ms	4288 KB	Output is correct
63	Runtime error	599 ms	67648 KB	Execution killed with signal 11
64	Halted	0 ms	0 KB	-

답안 #786498

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 30.0 / 30.0

Subtask #3 0 / 60.0

Subtask #1
10.0 / 10.0

Subtask #2
30.0 / 30.0

Subtask #3
0 / 60.0