Submission #2474091
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> #include <string> #include <climits> #include <tuple> using namespace std; typedef long long ll; typedef pair<int,int> P; typedef tuple<int,int,int,int> T; int main(){ int n,m; cin>>n>>m; T corp[50000]; int x[50000],y[50000],z[50000]; int dp[101][101][101]; for(int i=0;i<101;i++)for(int j=0;j<101;j++)for(int k=0;k<101;k++)dp[i][j][k]=0; for(int i=0;i<n;i++){ int a,b,c,d; cin>>a>>b>>c>>d; corp[i]=T(a,b,c,d); dp[a][b][c]=max(dp[a][b][c],d); } for(int i=0;i<101;i++){ for(int j=0;j<101;j++){ for(int k=0;k<101;k++){ dp[i][j][k]=max(dp[i][j][(k==0)? k:k-1],max(dp[i][j][k],max(dp[(i==0)? i:i-1][j][k],dp[i][(j==0)?j:j-1][k]))); } } } for(int i=0;i<m;i++){ int x,y,z; cin>>x>>y>>z; cout<<dp[x][y][z]<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Optimal Recommendations |
User | yokofu |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1200 Byte |
Status | AC |
Exec Time | 188 ms |
Memory | 5504 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 10-random-00.txt, 10-random-01.txt, 10-random-02.txt, 10-random-03.txt, 10-random-04.txt, 20-absW-00.txt, 20-absW-01.txt, 20-absW-02.txt, 20-absW-03.txt, 20-absW-04.txt, 30-balance-00.txt, 30-balance-01.txt, 30-balance-02.txt, 30-balance-03.txt, 30-balance-04.txt, 40-limit_dim-00.txt, 40-limit_dim-01.txt, 40-limit_dim-02.txt, 40-limit_dim-03.txt, 40-limit_dim-04.txt, 40-limit_dim-05.txt, 40-limit_dim-06.txt, Corner1.txt, Sample1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
10-random-00.txt | AC | 184 ms | 5504 KB |
10-random-01.txt | AC | 5 ms | 4992 KB |
10-random-02.txt | AC | 86 ms | 5376 KB |
10-random-03.txt | AC | 120 ms | 5504 KB |
10-random-04.txt | AC | 61 ms | 5120 KB |
20-absW-00.txt | AC | 169 ms | 5248 KB |
20-absW-01.txt | AC | 5 ms | 4992 KB |
20-absW-02.txt | AC | 86 ms | 5120 KB |
20-absW-03.txt | AC | 138 ms | 5248 KB |
20-absW-04.txt | AC | 52 ms | 5120 KB |
30-balance-00.txt | AC | 178 ms | 5504 KB |
30-balance-01.txt | AC | 5 ms | 4992 KB |
30-balance-02.txt | AC | 49 ms | 5248 KB |
30-balance-03.txt | AC | 100 ms | 5248 KB |
30-balance-04.txt | AC | 113 ms | 5504 KB |
40-limit_dim-00.txt | AC | 188 ms | 5504 KB |
40-limit_dim-01.txt | AC | 185 ms | 5504 KB |
40-limit_dim-02.txt | AC | 186 ms | 5504 KB |
40-limit_dim-03.txt | AC | 181 ms | 5504 KB |
40-limit_dim-04.txt | AC | 187 ms | 5504 KB |
40-limit_dim-05.txt | AC | 182 ms | 5504 KB |
40-limit_dim-06.txt | AC | 182 ms | 5504 KB |
Corner1.txt | AC | 5 ms | 4992 KB |
Sample1.txt | AC | 5 ms | 4992 KB |