Submission #3783373


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>

using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
#define vunique(v) unique(v.begin(), v.end())
#define mp make_pair
#define ts(x) to_string(x)
#define rep(i, a, b) for(int i = (int)a; i < (int)b; i++)
#define repm(i, a, b) for(int i = (int)a; i > (int)b; i--)
#define bit(a) bitset<8>(a)
#define des_priority_queue priority_queue<int, vector<int>, greater<int> >
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1e18;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, M;
	cin >> N >> M;
	int a[N], b[N], c[N], w[N], x[M], y[M], z[M];
	rep(i, 0, N) cin >> a[i] >> b[i] >> c[i] >> w[i];
	rep(i, 0, M) cin >> x[i] >> y[i] >> z[i];

	int dp[101][101][101];
	memset(dp, 0, sizeof(dp));

	rep(i, 0, 101) rep(j, 0, 101) rep(k, 0, 101) {
		rep(idx, 0, N) {
			if(a[idx] <= i and b[idx] <= j and c[idx] <= k) {
				dp[i][j][k] = max(dp[i][j][k], w[idx]);
			}
		}
	}

	rep(i, 0, M) cout << dp[x[i]][y[i]][z[i]] << endl;

	
}

Submission Info

Submission Time
Task C - Optimal Recommendations
User tsutarou10
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1366 Byte
Status TLE
Exec Time 2104 ms
Memory 7296 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 5
TLE × 19
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 TLE 2104 ms 5632 KB
10-random-01.txt AC 5 ms 4224 KB
10-random-02.txt TLE 2103 ms 4736 KB
10-random-03.txt TLE 2103 ms 4992 KB
10-random-04.txt TLE 2103 ms 4992 KB
20-absW-00.txt TLE 2103 ms 5632 KB
20-absW-01.txt AC 5 ms 4224 KB
20-absW-02.txt TLE 2103 ms 7296 KB
20-absW-03.txt TLE 2103 ms 5248 KB
20-absW-04.txt TLE 2103 ms 4608 KB
30-balance-00.txt TLE 2103 ms 5632 KB
30-balance-01.txt AC 5 ms 4224 KB
30-balance-02.txt TLE 2103 ms 4480 KB
30-balance-03.txt TLE 2103 ms 5248 KB
30-balance-04.txt TLE 2103 ms 4864 KB
40-limit_dim-00.txt TLE 2103 ms 5632 KB
40-limit_dim-01.txt TLE 2103 ms 5632 KB
40-limit_dim-02.txt TLE 2103 ms 5632 KB
40-limit_dim-03.txt TLE 2103 ms 5632 KB
40-limit_dim-04.txt TLE 2103 ms 5632 KB
40-limit_dim-05.txt TLE 2103 ms 5632 KB
40-limit_dim-06.txt TLE 2103 ms 5632 KB
Corner1.txt AC 7 ms 4224 KB
Sample1.txt AC 8 ms 4224 KB