oj.uz

Submission #786478

# Submission time Handle Problem Language Result Execution time Memory
786478 2023-07-18T08:15:39 Z eltu0815 Sightseeing in Kyoto (JOI22_kyoto) C++14
40 / 100
 612 ms 69604 KB 
#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];
int mna[1005], mxa[1005];
int mnb[1005], mxb[1005];
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];
    for(int i = n, p = inf; i >= 1; --i) if(p > a[i]) row.push_back(i), p = a[i];
    for(int i = m, p = inf; i >= 1; --i) if(p > b[i]) col.push_back(i), p = b[i];
    sort(row.begin(), row.end());
    sort(col.begin(), 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 1 ms 340 KB Output is correct
8 Correct 1 ms 328 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 488 KB Output is correct
13 Correct 7 ms 12184 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 7 ms 12204 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 3 ms 3916 KB Output is correct
4 Correct 6 ms 2504 KB Output is correct
5 Correct 6 ms 2772 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 12 ms 1848 KB Output is correct
8 Correct 12 ms 1860 KB Output is correct
9 Correct 12 ms 4164 KB Output is correct
10 Correct 12 ms 4180 KB Output is correct
11 Correct 32 ms 33172 KB Output is correct
12 Correct 13 ms 4564 KB Output is correct
13 Correct 13 ms 4556 KB Output is correct
14 Correct 42 ms 32720 KB Output is correct
15 Correct 12 ms 2004 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 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 1 ms 328 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 1 ms 340 KB Output is correct
8 Correct 1 ms 328 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 488 KB Output is correct
13 Correct 7 ms 12184 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 7 ms 12204 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 328 KB Output is correct
31 Correct 3 ms 3916 KB Output is correct
32 Correct 6 ms 2504 KB Output is correct
33 Correct 6 ms 2772 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 12 ms 1848 KB Output is correct
36 Correct 12 ms 1860 KB Output is correct
37 Correct 12 ms 4164 KB Output is correct
38 Correct 12 ms 4180 KB Output is correct
39 Correct 32 ms 33172 KB Output is correct
40 Correct 13 ms 4564 KB Output is correct
41 Correct 13 ms 4556 KB Output is correct
42 Correct 42 ms 32720 KB Output is correct
43 Correct 12 ms 2004 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 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 1 ms 328 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 8 ms 1544 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 976 KB Output is correct
58 Correct 3 ms 1748 KB Output is correct
59 Correct 18 ms 3028 KB Output is correct
60 Correct 19 ms 3076 KB Output is correct
61 Correct 19 ms 5968 KB Output is correct
62 Correct 22 ms 6220 KB Output is correct
63 Runtime error 612 ms 69604 KB Execution killed with signal 11
64 Halted 0 ms 0 KB -