oj.uz

답안 #430612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430612 2021-06-16T17:12:06 Z fskarica 전선 연결 (IOI17_wiring) C++14
7 / 100
 34 ms 5172 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAX = 210;
long long dp[MAX][MAX];
int n, m;

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    n = r.size();
    m = b.size();

    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= m; j++) {
            dp[i][j] = 1e18;
        }
    }
    dp[0][0] = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            dp[i][j] = min(dp[i][j], dp[i - 1][j]);
            dp[i][j] = min(dp[i][j], dp[i][j - 1]);
            dp[i][j] = min(dp[i][j], dp[i - 1][j - 1]);

            dp[i][j] += abs(r[i - 1] - b[j - 1]);
        }
    }

//    for (int i = 0; i <= n; i++) {
//        for (int j = 0; j <= m; j++) {
//            if (dp[i][j] == 1e9) {
//                cout << "- ";
//            }
//            else {
//                cout << dp[i][j] << " ";
//            }
//        }
//        cout << "\n";
//    }

    return dp[n][m];
}

//int main() {
//    cin >> n >> m;
//
//    vector <int> a;
//    vector <int> b;
//
//    int x;
//    for (int i = 0; i < n; i++) {
//        cin >> x;
//        a.push_back(x);
//    }
//
//    for (int i = 0; i < m; i++) {
//        cin >> x;
//        b.push_back(x);
//    }
//
//    cout << min_total_length(a, b) << "\n";
//
//    return 0;
//}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 556 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 556 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Runtime error 23 ms 4300 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Runtime error 34 ms 5060 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 26 ms 5172 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 556 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 556 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Runtime error 23 ms 4300 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -