제출 #738613

#제출 시각아이디문제언어결과실행 시간메모리
738613Nelt전선 연결 (IOI17_wiring)C++17
7 / 100
161 ms262144 KiB
#pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx,avx2,fma") #include "wiring.h" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> /* DEFINES */ #define S second #define F first #define ll long long #define ull unsigned long long #define ld long double #define npos ULLONG_MAX #define INF LLONG_MAX #define vv(a) vector<a> #define pp(a, b) pair<a, b> #define pq(a) priority_queue<a> #define qq(a) queue<a> #define ss(a) set<a> #define mm(a, b) map<a, b> #define ump(a, b) unordered_map<a, b> #define sync \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define elif else if #define endl "\n" #define allc(a) begin(a), end(a) #define all(a) a, a + sizeof(a) / sizeof(a[0]) #define pb push_back #define logi(a) __lg(a) #define sqrt(a) sqrtl(a) #define mpr make_pair #define ins insert using namespace std; using namespace __gnu_pbds; using namespace __cxx11; typedef char chr; typedef basic_string<chr> str; template <typename T, typename key = less<T>> using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll min_total_length(std::vector<int> a, std::vector<int> b) { ll ans = 0, n = a.size(), m = b.size(); pp(ll, ll) c[n + m + 1]; a.ins(a.begin(), 0); b.ins(b.begin(), 0); for (ll i = 1; i <= n; i++) c[i] = mpr(a[i], 0); for (ll i = 1; i <= m; i++) c[i + n] = mpr(b[i], 1); sort(all(c)); ll dp[n + 1][m + 1]; for (ll i = 0; i <= n; i++) dp[i][0] = 1e18; for (ll i = 0; i <= m; i++) dp[0][i] = 1e18; dp[0][0] = 0; for (ll i = 1; i <= n; i++) for (ll j = 1; j <= m; j++) dp[i][j] = min({dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]}) + abs(a[i] - b[j]); return dp[n][m]; }

컴파일 시 표준 에러 (stderr) 메시지

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:47:5: warning: unused variable 'ans' [-Wunused-variable]
   47 |  ll ans = 0, n = a.size(), m = b.size();
      |     ^~~
#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...