oj.uz

Submission #544963

# Submission time Handle Problem Language Result Execution time Memory
544963 2022-04-03T08:35:57 Z leaked Sightseeing in Kyoto (JOI22_kyoto) C++14
10 / 100
 86 ms 81704 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define vec vector
#define pb push_back
#define sz(x) (int)(x).size()
#define pw(x) (1LL<<(x))
#define fast_resp ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ld;
typedef pair<int,ll> pil;
template<class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
const int M=1e9+7;
//const int N=5e5+1;
void add(int &a,int b){
    a+=b;
    if(a>=M) a-=M;
    else if(a<0) a+=M;
}
int mult(int a,int b){
    return 1ll*a*b%M;
}
//int dp[N][26];
const int N=4e3+1;
ll dp[N][N];
signed main(){
    fast_resp;
    int n,m;
    cin>>n>>m;
    vec<int>a(n),b(m);
//    int i=0,j=0;
    for(auto &z : a) cin>>z;
    for(auto &z : b) cin>>z;
    vec<int> p1(n),p2(m);
    vec<int> kx,ky;

    iota(all(p1),0);
    sort(all(p1),[&](int i,int j){return m_p(a[i],i)<m_p(a[j],j);});
    for(int i=0;i<min(n,1000);i++) kx.pb(p1[i]);
    sort(all(p1),[&](int i,int j){return m_p(a[i],-i)<m_p(a[j],-j);});
    for(int i=0;i<min(1000,n);i++) kx.pb(n-i-1);
    for(int i=0;i<min(1000,n);i++) kx.pb(i);

    iota(all(p2),0);
    sort(all(p2),[&](int i,int j){return m_p(b[i],i)<m_p(b[j],j);});
    for(int i=0;i<min(m,1000);i++) ky.pb(p2[i]);
    sort(all(p2),[&](int i,int j){return m_p(b[i],-i)<m_p(b[j],-j);});
    for(int i=0;i<min(m,1000);i++) ky.pb(p2[i]);
    for(int i=0;i<min(1000,m);i++) ky.pb(m-i-1);
    for(int i=0;i<min(1000,m);i++) ky.pb(i);

    sort(all(kx));kx.erase(unique(all(kx)),kx.end());
    sort(all(ky));ky.erase(unique(all(ky)),ky.end());
//    cout<<endl;
//    cout<<0<<' ';
    for(int i=0;i<sz(kx);i++){
        for(int j=0;j<sz(ky);j++){
            if(!i && !j) continue;
            dp[i][j]=1e18;
            if(i) umin(dp[i][j],dp[i-1][j]+1ll*(kx[i]-kx[i-1])*b[ky[j]]);
            if(j) umin(dp[i][j],dp[i][j-1]+1ll*(ky[j]-ky[j-1])*a[kx[i]]);
//            cout<<dp[i][j]-((i&&j)?dp[i-1][j-1]:0)<<' ';
        }
//        cout<<endl;
    }
    cout<<dp[sz(kx)-1][sz(ky)-1];
    return 0;
}
/*

*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 11 ms 12184 KB Output is correct
10 Correct 11 ms 12244 KB Output is correct
11 Correct 11 ms 12260 KB Output is correct
12 Correct 14 ms 12240 KB Output is correct
13 Correct 9 ms 12192 KB Output is correct
14 Correct 11 ms 12180 KB Output is correct
15 Correct 11 ms 12244 KB Output is correct
16 Correct 9 ms 12244 KB Output is correct
17 Correct 8 ms 12244 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 212 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 336 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 4 ms 4692 KB Output is correct
4 Incorrect 86 ms 81704 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 11 ms 12184 KB Output is correct
10 Correct 11 ms 12244 KB Output is correct
11 Correct 11 ms 12260 KB Output is correct
12 Correct 14 ms 12240 KB Output is correct
13 Correct 9 ms 12192 KB Output is correct
14 Correct 11 ms 12180 KB Output is correct
15 Correct 11 ms 12244 KB Output is correct
16 Correct 9 ms 12244 KB Output is correct
17 Correct 8 ms 12244 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 212 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 4 ms 4692 KB Output is correct
32 Incorrect 86 ms 81704 KB Output isn't correct
33 Halted 0 ms 0 KB -