Submission #3212322


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for(int i=(b)-1; i>=(a); --i)

#define DEBUG(x) cout<<#x<<": "<<x<<'\n'
#define DEBUG_VEC(v) cout<<#v<<":";REP(i, v.size())cout<<' '<<v[i];cout<<'\n'
#define ALL(a) (a).begin(), (a).end()

#define CHMIN(a, b) a=min((a), (b))
#define CHMAX(a, b) a=max((a), (b))

const ll MOD=1000000007ll;
// const ll MOD=998244353ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

const double EPS=1e-11;
#define EQ0(x) (abs((x))<EPS)
#define EQ(a, b) (abs((a)-(b))<EPS)

int dp[114][114][114];

int main(){
	// ios::sync_with_stdio(false);
	// cin.tie(0);
	int n, m, a, b, c, w, x, y, z;
	cin>>n>>m;
	REP(i, n){
		// cin>>a>>b>>c>>w;
		scanf("%d%d%d%d", &a, &b, &c, &w);
		dp[a][b][c]=max(dp[a][b][c], w);
	}
	REP(i, 101){
		REP(j, 101){
			REP(k, 101){
				if(i>0){
					dp[i][j][k]=max(dp[i][j][k], dp[i-1][j][k]);
				}
				if(j>0){
					dp[i][j][k]=max(dp[i][j][k], dp[i][j-1][k]);
				}
				if(k>0){
					dp[i][j][k]=max(dp[i][j][k], dp[i][j][k-1]);
				}
			}
		}
	}
	REP(i, m){
		cin>>x>>y>>z;
		// cout<<dp[x][y][z]<<'\n';
		printf("%d\n", dp[x][y][z]);
	}
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", &a, &b, &c, &w);
                                    ^

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 137 ms 5760 KB
10-random-01.txt AC 6 ms 5248 KB
10-random-02.txt AC 87 ms 5632 KB
10-random-03.txt AC 107 ms 5632 KB
10-random-04.txt AC 30 ms 5248 KB
20-absW-00.txt AC 135 ms 5504 KB
20-absW-01.txt AC 6 ms 5248 KB
20-absW-02.txt AC 56 ms 5376 KB
20-absW-03.txt AC 120 ms 5376 KB
20-absW-04.txt AC 44 ms 5376 KB
30-balance-00.txt AC 137 ms 5760 KB
30-balance-01.txt AC 6 ms 5248 KB
30-balance-02.txt AC 48 ms 5376 KB
30-balance-03.txt AC 59 ms 5376 KB
30-balance-04.txt AC 112 ms 5632 KB
40-limit_dim-00.txt AC 144 ms 5760 KB
40-limit_dim-01.txt AC 142 ms 5760 KB
40-limit_dim-02.txt AC 140 ms 5760 KB
40-limit_dim-03.txt AC 140 ms 5760 KB
40-limit_dim-04.txt AC 142 ms 5760 KB
40-limit_dim-05.txt AC 137 ms 5760 KB
40-limit_dim-06.txt AC 137 ms 5760 KB
Corner1.txt AC 6 ms 5248 KB
Sample1.txt AC 6 ms 5248 KB