Submission #1871219
Source Code Expand
#include <bits/stdc++.h> typedef long long int ll; #define FOR(i, a, b) for (ll i = (signed)(a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define EREP(i, n) for (int i = (n)-1; i >= 0; --i) #define MOD 1000000007 #define pb push_back #define INF 93193111451418101 #define MIN -93193111451418101 #define EPS 1e-11 #define tp(a, b, c) make_tuple(a, b, c) #define lb(a, b) lower_bound((a).begin(), (a).end(), (b)) #define ub(a, b) upper_bound((a).begin(), (a).end(), (b)) using namespace std; typedef pair<ll, ll> P; typedef tuple<ll, ll, ll> T; template <typename T> void fill_all(T &arr, const T &v) { arr = v; } template <typename T, typename ARR> void fill_all(ARR &arr, const T &v) { for (auto &i : arr) { fill_all(i, v); } } //------------------変数-----------------------// ll n, m, p, q, r, maxi = 0; vector<P> G[500]; //-------------------関数----------------------// int main() { cin >> n >> m >> p >> q >> r; REP(i, r) { ll x, y, z; cin >> x >> y >> z; x--; y--; G[x].pb(P(y, z)); } REP(i, 1 << n) { if (__builtin_popcount(i) != p) continue; ll cnt = 0, sum[100] = {}; REP(j, 20) { if (!((i >> j) & 1)) continue; for (auto &k : G[j]) { sum[k.first] += k.second; } } sort(sum, sum + 90, greater<ll>()); REP(i, q) cnt += sum[i]; maxi = max(maxi, cnt); } cout << maxi << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - バレンタインデー |
User | keidaroo |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1454 Byte |
Status | AC |
Exec Time | 47 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt |
Subtask1 | subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt, subtask1-27.txt, subtask1-28.txt, subtask1-29.txt, subtask1-30.txt |
Subtask2 | subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt, subtask1-27.txt, subtask1-28.txt, subtask1-29.txt, subtask1-30.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 1 ms | 256 KB |
subtask0-sample02.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | AC | 1 ms | 256 KB |
subtask1-03.txt | AC | 1 ms | 256 KB |
subtask1-04.txt | AC | 1 ms | 256 KB |
subtask1-05.txt | AC | 1 ms | 256 KB |
subtask1-06.txt | AC | 1 ms | 256 KB |
subtask1-07.txt | AC | 1 ms | 256 KB |
subtask1-08.txt | AC | 1 ms | 256 KB |
subtask1-09.txt | AC | 1 ms | 256 KB |
subtask1-10.txt | AC | 1 ms | 256 KB |
subtask1-11.txt | AC | 1 ms | 256 KB |
subtask1-12.txt | AC | 1 ms | 256 KB |
subtask1-13.txt | AC | 1 ms | 256 KB |
subtask1-14.txt | AC | 1 ms | 256 KB |
subtask1-15.txt | AC | 1 ms | 256 KB |
subtask1-16.txt | AC | 1 ms | 256 KB |
subtask1-17.txt | AC | 1 ms | 256 KB |
subtask1-18.txt | AC | 1 ms | 256 KB |
subtask1-19.txt | AC | 1 ms | 256 KB |
subtask1-20.txt | AC | 1 ms | 256 KB |
subtask1-21.txt | AC | 1 ms | 256 KB |
subtask1-22.txt | AC | 1 ms | 256 KB |
subtask1-23.txt | AC | 1 ms | 256 KB |
subtask1-24.txt | AC | 1 ms | 256 KB |
subtask1-25.txt | AC | 1 ms | 256 KB |
subtask1-26.txt | AC | 1 ms | 256 KB |
subtask1-27.txt | AC | 1 ms | 256 KB |
subtask1-28.txt | AC | 1 ms | 256 KB |
subtask1-29.txt | AC | 1 ms | 256 KB |
subtask1-30.txt | AC | 1 ms | 256 KB |
subtask2-01.txt | AC | 1 ms | 256 KB |
subtask2-02.txt | AC | 1 ms | 256 KB |
subtask2-03.txt | AC | 1 ms | 256 KB |
subtask2-04.txt | AC | 1 ms | 256 KB |
subtask2-05.txt | AC | 40 ms | 256 KB |
subtask2-06.txt | AC | 42 ms | 256 KB |
subtask2-07.txt | AC | 42 ms | 256 KB |
subtask2-08.txt | AC | 44 ms | 256 KB |
subtask2-09.txt | AC | 45 ms | 256 KB |
subtask2-10.txt | AC | 46 ms | 256 KB |
subtask2-11.txt | AC | 47 ms | 256 KB |
subtask2-12.txt | AC | 46 ms | 256 KB |
subtask2-13.txt | AC | 45 ms | 384 KB |
subtask2-14.txt | AC | 46 ms | 256 KB |
subtask2-15.txt | AC | 46 ms | 256 KB |
subtask2-16.txt | AC | 46 ms | 256 KB |
subtask2-17.txt | AC | 47 ms | 256 KB |
subtask2-18.txt | AC | 46 ms | 256 KB |
subtask2-19.txt | AC | 45 ms | 256 KB |
subtask2-20.txt | AC | 46 ms | 256 KB |