oj.uz

답안 #566974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566974 2022-05-23T06:58:57 Z zaneyu Sightseeing in Kyoto (JOI22_kyoto) C++14
40 / 100
 1466 ms 151852 KB 
/*input
4 6
454863204 543362989 866044086 813602010
71574269 17945210 688720933 392135202 38174709 168241720
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int pf[maxn];
int a[maxn],b[maxn];
ll dp[3005][3005];
int main(){
    int n,m;
    cin>>n>>m;
    pf[0]=INF;
    REP1(i,n) cin>>a[i],pf[i]=min(pf[i-1],a[i]);
    int sf=INF;
    vector<int> v;
    for(int i=n;i>=1;i--){
        if(a[i]<sf or a[i]<pf[i-1]){
            v.pb(i);
        }
        MNTO(sf,a[i]);
    }
    pf[0]=INF;
    REP1(i,m) cin>>b[i],pf[i]=min(pf[i-1],b[i]);
    sf=INF;
    vector<int> v2;
    for(int i=m;i>=1;i--){
        if(b[i]<sf or b[i]<pf[i-1]){
            v2.pb(i);
        }
        MNTO(sf,b[i]);
    }
    reverse(ALL(v)),reverse(ALL(v2));
    REP(i,sz(v)){
        REP(j,sz(v2)){
            if(!i and !j){
                dp[i][j]=0;
                continue;
            }
            dp[i][j]=INF64;
            if(i) MNTO(dp[i][j],dp[i-1][j]+1LL*(v[i]-v[i-1])*b[v2[j]]);
            if(j) MNTO(dp[i][j],dp[i][j-1]+1LL*(v2[j]-v2[j-1])*a[v[i]]);
        }
    }
    cout<<dp[sz(v)-1][sz(v2)-1];
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 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 11 ms 12096 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 12192 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 3924 KB Output is correct
4 Correct 22 ms 2388 KB Output is correct
5 Correct 16 ms 3324 KB Output is correct
6 Correct 8 ms 572 KB Output is correct
7 Correct 41 ms 1488 KB Output is correct
8 Correct 42 ms 2212 KB Output is correct
9 Correct 45 ms 4560 KB Output is correct
10 Correct 55 ms 4420 KB Output is correct
11 Correct 73 ms 41424 KB Output is correct
12 Correct 46 ms 4904 KB Output is correct
13 Correct 62 ms 4928 KB Output is correct
14 Correct 73 ms 40816 KB Output is correct
15 Correct 49 ms 2376 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 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 1 ms 308 KB Output is correct

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 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 11 ms 12096 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 12192 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 4 ms 3924 KB Output is correct
32 Correct 22 ms 2388 KB Output is correct
33 Correct 16 ms 3324 KB Output is correct
34 Correct 8 ms 572 KB Output is correct
35 Correct 41 ms 1488 KB Output is correct
36 Correct 42 ms 2212 KB Output is correct
37 Correct 45 ms 4560 KB Output is correct
38 Correct 55 ms 4420 KB Output is correct
39 Correct 73 ms 41424 KB Output is correct
40 Correct 46 ms 4904 KB Output is correct
41 Correct 62 ms 4928 KB Output is correct
42 Correct 73 ms 40816 KB Output is correct
43 Correct 49 ms 2376 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 312 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 308 KB Output is correct
55 Correct 34 ms 1768 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 4 ms 980 KB Output is correct
58 Correct 12 ms 1748 KB Output is correct
59 Correct 78 ms 3400 KB Output is correct
60 Correct 101 ms 3152 KB Output is correct
61 Correct 93 ms 6064 KB Output is correct
62 Correct 101 ms 6376 KB Output is correct
63 Runtime error 1466 ms 151852 KB Execution killed with signal 11
64 Halted 0 ms 0 KB -