제출 #586815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
586815		MohamedFaresNebili	Wiring (IOI17_wiring)	C++14	0 / 100	1 ms	340 KiB

wiring

#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
 
        using namespace std;
 
        using ll = long long;
        using ii = pair<ll, ll>;
        using vi = vector<int>;
 
        #define ff first
        #define ss second
        #define pb push_back
        #define all(x) (x).begin(), (x).end()
        #define lb lower_bound
 
        const int MOD = 1000 * 1000 * 1000 + 7;
 
        ll DP[201][201];
        ll min_total_length(vector<int> R, vector<int> B) {
            int N = R.size(), M = B.size();
            for(int l = 0; l <= N; l++)
                for(int i = 0; i <= M; i++)
                    DP[l][i] = 1e15 + 7;
            DP[0][0] = 0;
            for(int l = 1; l <= N; l++)
                for(int i = 1; i <= M; i++)
                    DP[l][i] = min({DP[l][i - 1], DP[l - 1][i - 1],
                                   DP[l][i - 1]}) + ll(abs(R[l - 1] - B[i - 1]));
            return DP[N][M];
        }

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45