Submission #3002391

---

Source Code Expand

//TLE解法
#include <iostream>
using namespace std;

int n, m;
int a[50000], b[50000], c[50000], w[50000];
int x[50000], y[50000], z[50000];

int main() {
	int i, j;
	
	cin >> n >> m;
	for (i = 0; i < n; i++) cin >> a[i] >> b[i] >> c[i] >> w[i];
	for (i = 0; i < m; i++) cin >> x[i] >> y[i] >> z[i];
	
	for (i = 0; i < m; i++) {
		int maxW = 0;
		for (j = 0; j < n; j++) {
			if (x[i] >= a[j] && y[i] >= b[j] && z[i] >= c[j] && maxW < w[j]) {
				maxW = w[j];
			}
		}
		cout << maxW << endl;
	}
	return 0;
}

Submission Info

Judge Result