oj.uz

Submission #588811

# Submission time Handle Problem Language Result Execution time Memory
588811 2022-07-04T05:42:46 Z 반딧불(#8402) Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
 9 ms 12244 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void simplify(ll* arr, ll* narr, int &sz, ll* loc){
    int pnt = min_element(arr+1, arr+sz+1) - arr;
    int rn = 1;
    narr[1] = arr[1], loc[1] = 1;
    for(int i=2; i<=pnt; i++){
        if(narr[rn] > arr[i]){
            narr[++rn] = arr[i];
            loc[rn] = i;
        }
    }
    vector<pair<int, int> > vec (1, make_pair(arr[sz], sz));
    for(int i=sz-1; i>=pnt; i--){
        if(vec.back().first > arr[i]){
            vec.push_back(make_pair(arr[i], i));
        }
    }
    reverse(vec.begin(), vec.end());
    for(int i=1; i<(int)vec.size(); i++){
        narr[++rn] = vec[i].first;
        loc[rn] = vec[i].second;
    }

    if(rn == 1){
        narr[++rn] = arr[sz];
        loc[rn] = sz;
    }
    sz = rn;
}

int n, m;
ll ta[100002], tb[100002];
ll a[100002], b[100002];
ll al[100002], bl[100002];
ll dist[2002][2002];

int main(){
    scanf("%d %d", &n, &m);
    for(int i=1; i<=n; i++) scanf("%lld", &ta[i]);
    for(int i=1; i<=m; i++) scanf("%lld", &tb[i]);
    simplify(ta, a, n, al);
    simplify(tb, b, m, bl);
    for(int i=1; i<=n; i++) for(int j=1; j<=m; j++) dist[i][j] = 1e18;
    dist[1][1] = 0;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            dist[i][j+1] = min(dist[i][j+1], dist[i][j] + a[i] * (bl[j+1]-bl[j]));
            dist[i+1][j] = min(dist[i+1][j], dist[i][j] + b[j] * (al[i+1]-al[i]));
        }
    }
    printf("%lld", dist[n][m]);
}

Compilation message

kyoto.cpp: In function 'int main()':
kyoto.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
kyoto.cpp:44:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     for(int i=1; i<=n; i++) scanf("%lld", &ta[i]);
      |                             ~~~~~^~~~~~~~~~~~~~~~
kyoto.cpp:45:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     for(int i=1; i<=m; i++) scanf("%lld", &tb[i]);
      |                             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory 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 0 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 0 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 9 ms 12244 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 9 ms 12244 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 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 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 0 ms 340 KB Output is correct
27 Incorrect 0 ms 340 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 3 ms 3924 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 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 0 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 0 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 9 ms 12244 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 9 ms 12244 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 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 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 0 ms 340 KB Output is correct
27 Incorrect 0 ms 340 KB Output isn't correct
28 Halted 0 ms 0 KB -