제출 #428931

#제출 시각아이디문제언어결과실행 시간메모리
428931jeqcho전선 연결 (IOI17_wiring)C++17
0 / 100
1 ms332 KiB
#include "wiring.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<pii> vpi; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define F0R(i,b) FOR(i,0,b) #define ROF(i,a,b) for(int i=(b)-1;i>=(a);--i) #define R0F(i,b) ROF(i,0,b) #define all(x) begin(x),end(x) #define sz(x) int(x.size()) #define pb push_back #define rsz resize #define trav(a,x) for(auto&a :x) #define fi first #define se second int const n=200+3; ll dp[n][n]; ll min_total_length(vi r, vi b) { int n=sz(r); int m=sz(b); dp[0][0]=0; FOR(j,1,m+1) { FOR(i,1,n+1) { dp[i][j]=min(dp[i][j-1],min(dp[i-1][j],dp[i-1][j-1])) + (ll)abs(b[j-1]-r[i-1]); } } return dp[n][m]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...