Submission #3767819
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define ll1 1ll
#define ONE 1ll
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using pii = pair<int, int>;
// template<class T> ostream &operator<<(ostream &os,T &t){dump(t);return os;}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T> void printvv(const vector<vector<T>> &v) {
cerr << endl;
rep(i, 0, v.size()) rep(j, 0, v[i].size()) {
if (typeid(v[i][j]).name() == typeid(INF).name() and v[i][j] == INF) {
cerr << "INF";
} else
cerr << v[i][j];
cerr << (j == v[i].size() - 1 ? '\n' : ' ');
}
cerr << endl;
}
/*
typedef __int128_t Int;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 parse(string &s) {
__int128 ret = 0;
for (int i = 0; i < s.length(); i++)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
*/
#ifndef _DEBUG
#define printvv(...)
#endif
void YES(bool f) { cout << (f ? "YES" : "NO") << endl; }
void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main(signed argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N, M;
cin >> N >> M;
int job[101][101][101];
memset(job, 0, sizeof(job));
rep(i, 0, N) {
int a, b, c, w;
cin >> a >> b >> c >> w;
chmax(job[a][b][c], w);
}
rep(i, 0, 101) {
rep(j, 0, 101) {
rep(k, 0, 101) {
if (i - 1 >= 0)
chmax(job[i][j][k], job[i - 1][j][k]);
if (j - 1 >= 0)
chmax(job[i][j][k], job[i][j - 1][k]);
if (k - 1 >= 0)
chmax(job[i][j][k], job[i][j][k - 1]);
}
}
}
loop(M) {
int x, y, z;
cin >> x >> y >> z;
cout << job[x][y][z] << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Optimal Recommendations |
User |
norma |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
3270 Byte |
Status |
AC |
Exec Time |
113 ms |
Memory |
8832 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 |
109 ms |
8832 KB |
10-random-01.txt |
AC |
6 ms |
8320 KB |
10-random-02.txt |
AC |
67 ms |
8704 KB |
10-random-03.txt |
AC |
85 ms |
8704 KB |
10-random-04.txt |
AC |
26 ms |
8320 KB |
20-absW-00.txt |
AC |
112 ms |
8448 KB |
20-absW-01.txt |
AC |
6 ms |
8320 KB |
20-absW-02.txt |
AC |
49 ms |
8320 KB |
20-absW-03.txt |
AC |
95 ms |
8448 KB |
20-absW-04.txt |
AC |
37 ms |
8320 KB |
30-balance-00.txt |
AC |
113 ms |
8832 KB |
30-balance-01.txt |
AC |
6 ms |
8320 KB |
30-balance-02.txt |
AC |
37 ms |
8448 KB |
30-balance-03.txt |
AC |
47 ms |
8448 KB |
30-balance-04.txt |
AC |
86 ms |
8704 KB |
40-limit_dim-00.txt |
AC |
111 ms |
8832 KB |
40-limit_dim-01.txt |
AC |
112 ms |
8832 KB |
40-limit_dim-02.txt |
AC |
109 ms |
8832 KB |
40-limit_dim-03.txt |
AC |
111 ms |
8832 KB |
40-limit_dim-04.txt |
AC |
111 ms |
8832 KB |
40-limit_dim-05.txt |
AC |
112 ms |
8832 KB |
40-limit_dim-06.txt |
AC |
108 ms |
8832 KB |
Corner1.txt |
AC |
6 ms |
8320 KB |
Sample1.txt |
AC |
6 ms |
8320 KB |