Submission #782573
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr) #define all(x) (x).begin(),(x).end() #define mp make_pair #define pb push_back #define fi first #define se second int dp[301][301][301]={0}; int main() { int X,Y,n; scanf(" %d %d %d", &X, &Y, &n); vector<int> t(n),h(n); rep(i,n) scanf(" %d %d", &t[i],&h[i]); rep(i,n) { rep(x,X+1)rep(y,Y+1) { dp[i+1][x][y]=dp[i][x][y]; int s=x+y+t[i]; if(s>X+Y) continue; //できるだけスペシャルチケットを使う量を抑える int by=min(Y,y+t[i]-1); int bx=s-by; if(bx<=X) { dp[i+1][x][y]=max(dp[i+1][x][y],dp[i][bx][by]+h[i]); } } } int ans=0; rep(i,X+1)rep(j,Y+1) ans=max(ans,dp[n][i][j]); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 最高のトッピングにしような |
User | imulan |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1073 Byte |
Status | AC |
Exec Time | 343 ms |
Memory | 106992 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:18:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf(" %d %d %d", &X, &Y, &n); ^ ./Main.cpp:20:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] rep(i,n) scanf(" %d %d", &t[i],&h[i]); ^
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, subtask0-sample03.txt, subtask0-sample04.txt |
Subtask1 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask0-sample04.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 |
Subtask2 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask0-sample04.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, 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, subtask2-21.txt, subtask2-22.txt, subtask2-23.txt, subtask2-24.txt, subtask2-25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 28 ms | 804 KB |
subtask0-sample02.txt | AC | 27 ms | 808 KB |
subtask0-sample03.txt | AC | 27 ms | 924 KB |
subtask0-sample04.txt | AC | 26 ms | 924 KB |
subtask1-01.txt | AC | 26 ms | 920 KB |
subtask1-02.txt | AC | 26 ms | 1052 KB |
subtask1-03.txt | AC | 25 ms | 1036 KB |
subtask1-04.txt | AC | 26 ms | 1052 KB |
subtask1-05.txt | AC | 26 ms | 920 KB |
subtask1-06.txt | AC | 27 ms | 1772 KB |
subtask1-07.txt | AC | 26 ms | 1268 KB |
subtask1-08.txt | AC | 26 ms | 1056 KB |
subtask1-09.txt | AC | 28 ms | 2028 KB |
subtask1-10.txt | AC | 27 ms | 1384 KB |
subtask1-11.txt | AC | 27 ms | 1692 KB |
subtask1-12.txt | AC | 27 ms | 1944 KB |
subtask1-13.txt | AC | 28 ms | 2544 KB |
subtask1-14.txt | AC | 25 ms | 916 KB |
subtask1-15.txt | AC | 26 ms | 1176 KB |
subtask1-16.txt | AC | 26 ms | 1176 KB |
subtask1-17.txt | AC | 32 ms | 3944 KB |
subtask1-18.txt | AC | 29 ms | 4008 KB |
subtask1-19.txt | AC | 32 ms | 3944 KB |
subtask1-20.txt | AC | 31 ms | 3996 KB |
subtask1-21.txt | AC | 32 ms | 3940 KB |
subtask1-22.txt | AC | 32 ms | 3940 KB |
subtask1-23.txt | AC | 33 ms | 3936 KB |
subtask1-24.txt | AC | 30 ms | 3920 KB |
subtask1-25.txt | AC | 33 ms | 3936 KB |
subtask2-01.txt | AC | 32 ms | 3424 KB |
subtask2-02.txt | AC | 32 ms | 3940 KB |
subtask2-03.txt | AC | 26 ms | 1896 KB |
subtask2-04.txt | AC | 65 ms | 19568 KB |
subtask2-05.txt | AC | 61 ms | 19684 KB |
subtask2-06.txt | AC | 61 ms | 13892 KB |
subtask2-07.txt | AC | 44 ms | 11116 KB |
subtask2-08.txt | AC | 89 ms | 25572 KB |
subtask2-09.txt | AC | 76 ms | 31212 KB |
subtask2-10.txt | AC | 96 ms | 44400 KB |
subtask2-11.txt | AC | 52 ms | 9416 KB |
subtask2-12.txt | AC | 73 ms | 19952 KB |
subtask2-13.txt | AC | 200 ms | 90352 KB |
subtask2-14.txt | AC | 334 ms | 106988 KB |
subtask2-15.txt | AC | 214 ms | 106980 KB |
subtask2-16.txt | AC | 192 ms | 106988 KB |
subtask2-17.txt | AC | 193 ms | 106988 KB |
subtask2-18.txt | AC | 32 ms | 2712 KB |
subtask2-19.txt | AC | 28 ms | 2668 KB |
subtask2-20.txt | AC | 282 ms | 106992 KB |
subtask2-21.txt | AC | 343 ms | 106988 KB |
subtask2-22.txt | AC | 192 ms | 106988 KB |
subtask2-23.txt | AC | 224 ms | 106984 KB |
subtask2-24.txt | AC | 299 ms | 106988 KB |
subtask2-25.txt | AC | 306 ms | 106984 KB |