Submission #520860
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<vector<int> > dp(n); vector<int> dpm(n, -1); REP(i, 0, n) { dp[i] = vector<int>(n, -1); } REP(i, 0, n) { REP(j, 0, n) { int ma = -1; REP(k, 0, i) { if (ms[k].e > ms[i].s) { continue; } if (j == 0) { if (dpm[k] >= 0) { ma = max(ma, dpm[k] + h[0]); } } else { if (ms[k].m == ms[i].m && dp[k][j - 1] >= 0) { ma = max(ma, dp[k][j - 1] + h[j]); } } } if (j == 0) { ma = max(ma, h[0]); } dp[i][j] = ma; dpm[i] = max(dpm[i], ma); } } 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]; } assert (n <= 1000); 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 | 1473 Byte |
Status | RE |
Exec Time | 1224 ms |
Memory | 5124 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 | 44 ms | 1300 KB |
sample_02.txt | AC | 38 ms | 1308 KB |
subtask1_01.txt | RE | 308 ms | 1348 KB |
subtask1_02.txt | AC | 42 ms | 1384 KB |
subtask1_03.txt | RE | 296 ms | 1212 KB |
subtask1_04.txt | RE | 294 ms | 1208 KB |
subtask1_05.txt | AC | 1224 ms | 5124 KB |
subtask1_06.txt | RE | 294 ms | 1200 KB |
subtask1_07.txt | AC | 97 ms | 1672 KB |
subtask1_08.txt | RE | 285 ms | 1192 KB |
subtask1_09.txt | AC | 148 ms | 1928 KB |
subtask1_10.txt | RE | 290 ms | 1204 KB |
subtask1_11.txt | AC | 149 ms | 1932 KB |
subtask1_12.txt | RE | 290 ms | 1192 KB |
subtask1_13.txt | RE | 289 ms | 1208 KB |
subtask1_14.txt | RE | 289 ms | 1204 KB |
subtask1_15.txt | RE | 291 ms | 1216 KB |
subtask1_16.txt | RE | 291 ms | 1220 KB |
subtask1_17.txt | RE | 291 ms | 1216 KB |
subtask1_18.txt | RE | 285 ms | 1212 KB |
subtask1_19.txt | RE | 294 ms | 1216 KB |
subtask1_20.txt | RE | 297 ms | 1220 KB |
subtask1_21.txt | RE | 287 ms | 1216 KB |
subtask1_22.txt | RE | 299 ms | 1216 KB |
subtask1_23.txt | RE | 294 ms | 1216 KB |
subtask1_24.txt | RE | 294 ms | 1264 KB |
subtask1_25.txt | RE | 286 ms | 1224 KB |
subtask1_26.txt | RE | 298 ms | 1228 KB |
subtask1_27.txt | RE | 287 ms | 1220 KB |
subtask1_28.txt | RE | 291 ms | 1212 KB |
subtask1_29.txt | RE | 302 ms | 1220 KB |
subtask1_30.txt | RE | 292 ms | 1216 KB |
subtask1_31.txt | RE | 315 ms | 1224 KB |
subtask1_32.txt | RE | 311 ms | 1220 KB |
subtask1_33.txt | RE | 300 ms | 1216 KB |
subtask1_34.txt | RE | 290 ms | 1220 KB |
subtask1_35.txt | RE | 293 ms | 1220 KB |
subtask1_36.txt | RE | 296 ms | 1220 KB |
subtask1_37.txt | RE | 287 ms | 1280 KB |
subtask1_38.txt | RE | 296 ms | 1208 KB |
subtask1_39.txt | RE | 289 ms | 1224 KB |
subtask1_40.txt | RE | 291 ms | 1216 KB |
subtask1_41.txt | RE | 293 ms | 1228 KB |
subtask1_42.txt | RE | 288 ms | 1220 KB |
subtask1_43.txt | RE | 294 ms | 1224 KB |
subtask1_44.txt | RE | 288 ms | 1212 KB |
subtask1_45.txt | RE | 291 ms | 1224 KB |
subtask1_46.txt | RE | 289 ms | 1220 KB |
subtask1_47.txt | RE | 288 ms | 1220 KB |
subtask1_48.txt | RE | 291 ms | 1284 KB |
subtask1_49.txt | RE | 294 ms | 1216 KB |
subtask1_50.txt | RE | 290 ms | 1212 KB |
subtask1_51.txt | RE | 289 ms | 1224 KB |
subtask1_52.txt | RE | 288 ms | 1212 KB |
subtask1_53.txt | RE | 286 ms | 1220 KB |
subtask1_54.txt | RE | 287 ms | 1220 KB |
subtask1_55.txt | RE | 291 ms | 1220 KB |
subtask1_56.txt | RE | 299 ms | 1224 KB |
subtask1_57.txt | RE | 299 ms | 1220 KB |
subtask1_58.txt | RE | 294 ms | 1212 KB |
subtask1_59.txt | RE | 295 ms | 1216 KB |