Submission #406704

#TimeUsernameProblemLanguageResultExecution timeMemory
406704Kevin_Zhang_TWWiring (IOI17_wiring)C++17
0 / 100
1 ms204 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define pb emplace_back #define AI(i) begin(i), end(i) template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); } template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); } #ifdef KEV #define DE(args...) kout("[ " + string(#args) + " ] = ", args) void kout() { cerr << endl; } template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); } template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; } #else #define DE(...) 0 #define debug(...) 0 #endif const int MAX_N = 300010; const ll inf = 1ll << 55; #include "wiring.h" long long min_total_length(std::vector<int> r, std::vector<int> b) { priority_queue<ll, vector<ll>, greater<ll>> pq[2]; vector<pair<int,int>> all; for (int x : r) all.pb(x, 0); for (int x : b) all.pb(x, 1); sort(AI(all)); ll res = 0, mx[2]{-inf, -inf}; for (auto [x, c] : all) { ll ma = -mx[c^1]; if (pq[c^1].size() && pq[c^1].top() < ma) { ma = pq[c^1].top(); pq[c^1].pop(); } ll cost = x + ma; DE(x, c, ma, cost); res += cost; pq[c].emplace( -cost -x ); mx[c] = x; } return res; }

Compilation message (stderr)

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
wiring.cpp:40:3: note: in expansion of macro 'DE'
   40 |   DE(x, c, ma, cost);
      |   ^~
#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...