oj.uz

답안 #544960

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544960 2022-04-03T08:27:48 Z leaked Sightseeing in Kyoto (JOI22_kyoto) C++14
10 / 100
 8 ms 8160 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=1e3+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;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(!i && !j) continue;
            dp[i][j]=1e18;
            if(i) umin(dp[i][j],dp[i-1][j]+b[j]);
            if(j) umin(dp[i][j],dp[i][j-1]+a[i]);
        }
    }
    cout<<dp[n-1][m-1];
    return 0;
}
/*

*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 2248 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 8 ms 8160 KB Output is correct
10 Correct 8 ms 8148 KB Output is correct
11 Correct 8 ms 8148 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 6 ms 8148 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 8 ms 8148 KB Output is correct
16 Correct 6 ms 8148 KB Output is correct
17 Correct 6 ms 8152 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 328 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 332 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 2 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 2248 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 8 ms 8160 KB Output is correct
10 Correct 8 ms 8148 KB Output is correct
11 Correct 8 ms 8148 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 6 ms 8148 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 8 ms 8148 KB Output is correct
16 Correct 6 ms 8148 KB Output is correct
17 Correct 6 ms 8152 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 328 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 332 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Incorrect 2 ms 2644 KB Output isn't correct
32 Halted 0 ms 0 KB -