oj.uz

Submission #567045

# Submission time Handle Problem Language Result Execution time Memory
567045 2022-05-23T07:35:51 Z tqbfjotld Sightseeing in Kyoto (JOI22_kyoto) C++14
10 / 100
 2000 ms 171316 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int INF = 999999999999999999LL;

int arr1[100005];
int arr2[100005];

struct node{
    int s,e;
    pair<int,int> v;
    node *l,*r;
    node (int _s, int _e, bool arr){
        s = _s; e = _e;
        if (s==e){
            v = make_pair((arr?arr1:arr2)[s],arr?s:-s);
        }
        if (s!=e){
            l = new node(s,(s+e)/2,arr);
            r = new node((s+e)/2+1,e,arr);
            v = min(l->v,r->v);
        }
    }
    pair<int,int> qu(int a, int b){
        if (a<=s && e<=b){
            return v;
        }
        if (b<=(s+e)/2){
            return l->qu(a,b);
        }
        if (a>(s+e)/2){
            return r->qu(a,b);
        }
        return min(l->qu(a,b),r->qu(a,b));
    }
}*r1,*r2;

map<pair<int,int>,int> m1,m2;

int recl(int a, int b){
    //printf("call recl %lld %lld\n",a,b);
    if (a==0) return arr1[0]*b;
    if (b==0) return arr2[0]*a;
    if (m1.count({a,b})) return m1[{a,b}];
    auto opt1 = r1->qu(0,a-1);
    auto opt2 = r2->qu(0,b-1);
    return m1[{a,b}] = min(recl(opt1.second,b)+arr2[b]*(a-opt1.second),recl(a,-opt2.second)+arr1[a]*(b+opt2.second));
}

int n,m;

int recr(int a, int b){
    //printf("call recr %lld %lld\n",a,b);
    if (a==n-1) return arr1[n-1]*(m-1-b);
    if (b==m-1) return arr2[m-1]*(n-1-a);
    if (m2.count({a,b})) return m2[{a,b}];
    auto opt1 = r1->qu(a+1,n-1);
    auto opt2 = r2->qu(b+1,m-1);
    return m2[{a,b}] = min(recr(opt1.second,b)+arr2[b]*(opt1.second-a),recr(a,-opt2.second)+arr1[a]*(-opt2.second-b));
}

 main(){

    scanf("%lld%lld",&n,&m);
    for (int x = 0; x<n; x++){
        scanf("%lld",&arr1[x]);
    }
    for (int x = 0; x<m; x++){
        scanf("%lld",&arr2[x]);
    }
    r1 = new node(0,n-1,true);
    r2 = new node(0,m-1,false);
    auto i1 = r1->qu(0,n-1);
    auto i2 = r2->qu(0,m-1);
    int ans = recl(i1.second,-i2.second)+recr(i1.second,-i2.second);
    printf("%lld",ans);
}

Compilation message

kyoto.cpp:63:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 |  main(){
      |  ^~~~
kyoto.cpp: In function 'int main()':
kyoto.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     scanf("%lld%lld",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
kyoto.cpp:67:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |         scanf("%lld",&arr1[x]);
      |         ~~~~~^~~~~~~~~~~~~~~~~
kyoto.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         scanf("%lld",&arr2[x]);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 208 ms 22924 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 296 ms 28812 KB Output is correct
17 Correct 1 ms 576 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 133 ms 13808 KB Output is correct
4 Correct 30 ms 12876 KB Output is correct
5 Correct 455 ms 44304 KB Output is correct
6 Correct 7 ms 4752 KB Output is correct
7 Correct 40 ms 27628 KB Output is correct
8 Correct 39 ms 27004 KB Output is correct
9 Correct 94 ms 31200 KB Output is correct
10 Correct 79 ms 30996 KB Output is correct
11 Execution timed out 2033 ms 171316 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 208 ms 22924 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 296 ms 28812 KB Output is correct
17 Correct 1 ms 576 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 133 ms 13808 KB Output is correct
32 Correct 30 ms 12876 KB Output is correct
33 Correct 455 ms 44304 KB Output is correct
34 Correct 7 ms 4752 KB Output is correct
35 Correct 40 ms 27628 KB Output is correct
36 Correct 39 ms 27004 KB Output is correct
37 Correct 94 ms 31200 KB Output is correct
38 Correct 79 ms 30996 KB Output is correct
39 Execution timed out 2033 ms 171316 KB Time limit exceeded
40 Halted 0 ms 0 KB -