Submission #520881
Source Code Expand
#include <algorithm> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> #include <iostream> #include <map> #include <set> #include <string> #include <vector> #define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++) using namespace std; typedef long long int ll; const int DEBUG = 0; struct mov { int m, s, e; }; istream &operator>>(istream &os, mov &m) { os >> m.m >> m.s >> m.e; return os; } bool mov_cmp(const mov &m1, const mov &m2) { return m1.s < m2.s; } int solve(vector<int> &h, vector<mov> &ms) { int n = h.size(); vector<map<int, int> > dp(n); vector<int> dpm(n, -1); REP(i, 0, n) { dp[i] = map<int, int>(); } REP(i, 0, n) { vector<bool> vis(n + 1); dp[i][1] = h[0]; for (int k = i - 1; k >= 0; --k) { if (vis[ms[k].m]) { continue; } vis[ms[k].m] = true; if (ms[k].e > ms[i].s) { continue; } if (ms[k].m != ms[i].m && dpm[k] >= 0) { dp[i][1] = max(dp[i][1], dpm[k] + h[0]); } else { for (map<int, int>::iterator it = dp[k].begin(); it != dp[k].end(); ++it) { dp[i][it->first + 1] = max(dp[i][it->first + 1], it->second + h[it->first]); } } } for (map<int, int>::iterator it = dp[i].begin(); it != dp[i].end(); ++it) { dpm[i] = max(dpm[i], it->second); } } int ma = 0; REP(i, 0, n) { ma = max(ma, dpm[i]); } return ma; } int main(void) { int n; cin >> n; vector<int> h(n); vector<mov> ms(n); REP(i, 0, n) { cin >> h[i]; } REP(i, 0, n) { cin >> ms[i]; } sort(ms.begin(), ms.end(), mov_cmp); cout << solve(h, ms) << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 映画の連続視聴 |
User | kobae964 |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 1641 Byte |
Status | WA |
Exec Time | 74 ms |
Memory | 2576 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 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, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt, subtask1_43.txt, subtask1_44.txt, subtask1_45.txt, subtask1_46.txt, subtask1_47.txt, subtask1_48.txt, subtask1_49.txt, subtask1_50.txt, subtask1_51.txt, subtask1_52.txt, subtask1_53.txt, subtask1_54.txt, subtask1_55.txt, subtask1_56.txt, subtask1_57.txt, subtask1_58.txt, subtask1_59.txt, sample_01.txt, sample_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 29 ms | 1172 KB |
sample_02.txt | AC | 29 ms | 1048 KB |
subtask1_01.txt | WA | 47 ms | 1940 KB |
subtask1_02.txt | AC | 31 ms | 1144 KB |
subtask1_03.txt | WA | 44 ms | 1928 KB |
subtask1_04.txt | WA | 59 ms | 2192 KB |
subtask1_05.txt | WA | 41 ms | 1684 KB |
subtask1_06.txt | WA | 55 ms | 2056 KB |
subtask1_07.txt | AC | 32 ms | 1272 KB |
subtask1_08.txt | WA | 45 ms | 1796 KB |
subtask1_09.txt | AC | 34 ms | 1408 KB |
subtask1_10.txt | WA | 53 ms | 2056 KB |
subtask1_11.txt | WA | 35 ms | 1296 KB |
subtask1_12.txt | WA | 44 ms | 1812 KB |
subtask1_13.txt | WA | 49 ms | 1936 KB |
subtask1_14.txt | WA | 63 ms | 2184 KB |
subtask1_15.txt | WA | 72 ms | 2308 KB |
subtask1_16.txt | WA | 73 ms | 2568 KB |
subtask1_17.txt | WA | 71 ms | 2440 KB |
subtask1_18.txt | WA | 72 ms | 2440 KB |
subtask1_19.txt | WA | 72 ms | 2428 KB |
subtask1_20.txt | WA | 67 ms | 1552 KB |
subtask1_21.txt | WA | 65 ms | 1536 KB |
subtask1_22.txt | WA | 64 ms | 1676 KB |
subtask1_23.txt | WA | 64 ms | 1548 KB |
subtask1_24.txt | WA | 64 ms | 1552 KB |
subtask1_25.txt | WA | 66 ms | 1664 KB |
subtask1_26.txt | WA | 65 ms | 1548 KB |
subtask1_27.txt | WA | 66 ms | 1548 KB |
subtask1_28.txt | WA | 64 ms | 1552 KB |
subtask1_29.txt | WA | 65 ms | 1548 KB |
subtask1_30.txt | WA | 67 ms | 1668 KB |
subtask1_31.txt | WA | 66 ms | 1668 KB |
subtask1_32.txt | WA | 69 ms | 1668 KB |
subtask1_33.txt | WA | 65 ms | 1664 KB |
subtask1_34.txt | WA | 65 ms | 1548 KB |
subtask1_35.txt | WA | 65 ms | 1544 KB |
subtask1_36.txt | WA | 64 ms | 1548 KB |
subtask1_37.txt | WA | 65 ms | 1556 KB |
subtask1_38.txt | WA | 65 ms | 1548 KB |
subtask1_39.txt | WA | 62 ms | 1552 KB |
subtask1_40.txt | WA | 70 ms | 2436 KB |
subtask1_41.txt | WA | 73 ms | 2440 KB |
subtask1_42.txt | WA | 73 ms | 2444 KB |
subtask1_43.txt | WA | 73 ms | 2572 KB |
subtask1_44.txt | WA | 72 ms | 2452 KB |
subtask1_45.txt | WA | 71 ms | 2448 KB |
subtask1_46.txt | WA | 72 ms | 2576 KB |
subtask1_47.txt | WA | 71 ms | 2576 KB |
subtask1_48.txt | WA | 72 ms | 2448 KB |
subtask1_49.txt | WA | 72 ms | 2448 KB |
subtask1_50.txt | WA | 72 ms | 2448 KB |
subtask1_51.txt | WA | 70 ms | 2448 KB |
subtask1_52.txt | WA | 71 ms | 2560 KB |
subtask1_53.txt | WA | 72 ms | 2560 KB |
subtask1_54.txt | WA | 71 ms | 2440 KB |
subtask1_55.txt | WA | 71 ms | 2324 KB |
subtask1_56.txt | WA | 72 ms | 2452 KB |
subtask1_57.txt | WA | 72 ms | 2444 KB |
subtask1_58.txt | WA | 72 ms | 2300 KB |
subtask1_59.txt | WA | 74 ms | 2568 KB |