結果
問題 | No.1708 Quality of Contest |
ユーザー | keijak |
提出日時 | 2021-10-15 22:13:37 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 126 ms / 2,000 ms |
コード長 | 3,357 bytes |
コンパイル時間 | 2,348 ms |
コンパイル使用メモリ | 215,604 KB |
実行使用メモリ | 19,384 KB |
最終ジャッジ日時 | 2023-10-17 20:22:56 |
合計ジャッジ時間 | 5,709 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 3 ms
4,348 KB |
testcase_04 | AC | 4 ms
4,348 KB |
testcase_05 | AC | 3 ms
4,348 KB |
testcase_06 | AC | 3 ms
4,348 KB |
testcase_07 | AC | 3 ms
4,348 KB |
testcase_08 | AC | 2 ms
4,348 KB |
testcase_09 | AC | 118 ms
19,384 KB |
testcase_10 | AC | 88 ms
13,920 KB |
testcase_11 | AC | 106 ms
12,000 KB |
testcase_12 | AC | 108 ms
13,004 KB |
testcase_13 | AC | 99 ms
11,140 KB |
testcase_14 | AC | 110 ms
13,588 KB |
testcase_15 | AC | 125 ms
17,100 KB |
testcase_16 | AC | 126 ms
16,764 KB |
testcase_17 | AC | 107 ms
14,032 KB |
testcase_18 | AC | 111 ms
14,324 KB |
testcase_19 | AC | 110 ms
15,332 KB |
testcase_20 | AC | 107 ms
13,848 KB |
testcase_21 | AC | 115 ms
14,668 KB |
testcase_22 | AC | 108 ms
13,664 KB |
testcase_23 | AC | 120 ms
16,876 KB |
testcase_24 | AC | 85 ms
9,732 KB |
testcase_25 | AC | 84 ms
9,732 KB |
ソースコード
#include <bits/stdc++.h> #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template<typename T, typename U> inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template<typename T, typename U> inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template<typename T> inline int ssize(const T &a) { return (int) a.size(); } template<class T> inline std::ostream &print_one(const T &x, char endc) { if constexpr (std::is_same_v<T, bool>) { return std::cout << (x ? "Yes" : "No") << endc; } else { return std::cout << x << endc; } } template<class T> inline std::ostream &print(const T &x) { return print_one(x, '\n'); } template<typename T, typename... Ts> std::ostream &print(const T &head, Ts... tail) { return print_one(head, ' '), print(tail...); } inline std::ostream &print() { return std::cout << '\n'; } template<typename Container> std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template<typename T, typename = void> struct is_iterable : std::false_type {}; template<typename T> struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())), decltype(std::end(std::declval<T>()))>> : std::true_type { }; template<typename T, typename = std::enable_if_t< is_iterable<T>::value && !std::is_same<T, std::string>::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } struct VersatileInput { template<typename T> operator T() const { T x; std::cin >> x; return x; } struct Sized { std::size_t n; template<typename T> operator T() const { T x(n); for (auto &e: x) std::cin >> e; return x; } }; Sized operator()(std::size_t n) const { return {n}; } } const in; inline void check(bool cond, const char *message = "!ERROR!") { if (not cond) throw std::runtime_error(message); } #ifdef MY_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #define cerr if(false)std::cerr #endif using namespace std; auto solve() { const int n = in, m = in, X = in; vector<vector<int>> bmap(m + 1); REP(i, n) { int a = in, b = in; bmap[b].push_back(a); } int K = in; vector<i64> C = in(K); vector<i64> F(n + 1); for (auto c: C) { F[0] += 1; F[c] -= 1; } REP(i, 1, n + 1) { F[i] += F[i - 1]; } vector<i64> vals; REP(b, 1, m + 1) { sort(ALL(bmap[b]), greater{}); if (bmap[b].empty()) continue; bmap[b][0] += X; for (auto z: bmap[b]) { vals.push_back(z); } } sort(ALL(vals), greater{}); i64 ans = 0; REP(i, n) { ans += vals[i] * F[i]; } return ans; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << std::fixed << std::setprecision(18); const int T = 1;//in; REP(t, T) { auto ans = solve(); print(ans); } }