Submission #3773729


Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.rbegin(), v.rend());//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n,m;
  int dp[110][110][110];
  cin >> n >> m;
  REP(i,n){
      int a,b,c,w;
      cin >> a >> b >> c >> w;
      dp[a][b][c] = max(dp[a][b][c],w);
  }
  REP(i,101) REP(j,101) REP(k,101){
      dp[i+1][j][k] = max(dp[i][j][k],dp[i+1][j][k]);
      dp[i][j+1][k] = max(dp[i][j][k],dp[i][j+1][k]);
      dp[i][j][k+1] = max(dp[i][j][k],dp[i][j][k+1]);
  }
  REP(i,m){
      int x,y,z;
      cin >> x >> y >> z;
      cout << dp[x][y][z] << endl;
  }
}

Submission Info

Submission Time
Task C - Optimal Recommendations
User Bondo416
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1159 Byte
Status AC
Exec Time 112 ms
Memory 5760 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 24
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 111 ms 5632 KB
10-random-01.txt AC 7 ms 5120 KB
10-random-02.txt AC 68 ms 5760 KB
10-random-03.txt AC 82 ms 5504 KB
10-random-04.txt AC 27 ms 5120 KB
20-absW-00.txt AC 109 ms 5248 KB
20-absW-01.txt AC 6 ms 5120 KB
20-absW-02.txt AC 46 ms 5120 KB
20-absW-03.txt AC 94 ms 5248 KB
20-absW-04.txt AC 36 ms 5120 KB
30-balance-00.txt AC 111 ms 5632 KB
30-balance-01.txt AC 6 ms 5120 KB
30-balance-02.txt AC 40 ms 5248 KB
30-balance-03.txt AC 49 ms 5632 KB
30-balance-04.txt AC 87 ms 5504 KB
40-limit_dim-00.txt AC 110 ms 5632 KB
40-limit_dim-01.txt AC 112 ms 5632 KB
40-limit_dim-02.txt AC 111 ms 5632 KB
40-limit_dim-03.txt AC 111 ms 5632 KB
40-limit_dim-04.txt AC 111 ms 5632 KB
40-limit_dim-05.txt AC 112 ms 5632 KB
40-limit_dim-06.txt AC 112 ms 5632 KB
Corner1.txt AC 7 ms 5120 KB
Sample1.txt AC 6 ms 5120 KB