Submission #2216092
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<" ";dump_func(__VA_ARGS__)
typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }
namespace aux { // print tuple
template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }
template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }
#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false
#ifdef VC
#define scanf scanf_s
#endif
const ll mod=1000000007;
int main() {
int n, m;
cin >> n >> m;
ll dp[110][110][110] = {};
for (int i = 0; i < n; i++) {
int a, b, c; ll w;
cin >> a >> b >> c >> w;
dp[a][b][c] = w;
}
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 100; j++) {
for (int k = 0; k <= 100; k++) {
dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]);
dp[i][j + 1][k] = max(dp[i][j + 1][k], dp[i][j][k]);
dp[i][j][k + 1] = max(dp[i][j][k + 1], dp[i][j][k]);
}
}
}
for (int i = 0; i < m; i++) {
int x, y, z;
cin >> x >> y >> z;
cout << dp[x][y][z] << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Optimal Recommendations |
User |
takoyaki |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
4077 Byte |
Status |
WA |
Exec Time |
189 ms |
Memory |
11136 KB |
Judge Result
Set Name |
All |
Score / Max Score |
0 / 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 |
WA |
181 ms |
11136 KB |
10-random-01.txt |
AC |
8 ms |
10624 KB |
10-random-02.txt |
AC |
87 ms |
11008 KB |
10-random-03.txt |
WA |
120 ms |
11008 KB |
10-random-04.txt |
WA |
59 ms |
10752 KB |
20-absW-00.txt |
AC |
161 ms |
10880 KB |
20-absW-01.txt |
AC |
8 ms |
10624 KB |
20-absW-02.txt |
AC |
84 ms |
10752 KB |
20-absW-03.txt |
AC |
130 ms |
10752 KB |
20-absW-04.txt |
AC |
52 ms |
10752 KB |
30-balance-00.txt |
WA |
172 ms |
11136 KB |
30-balance-01.txt |
AC |
8 ms |
10624 KB |
30-balance-02.txt |
AC |
51 ms |
10752 KB |
30-balance-03.txt |
WA |
96 ms |
10752 KB |
30-balance-04.txt |
WA |
115 ms |
11136 KB |
40-limit_dim-00.txt |
WA |
189 ms |
11136 KB |
40-limit_dim-01.txt |
WA |
180 ms |
11136 KB |
40-limit_dim-02.txt |
WA |
181 ms |
11136 KB |
40-limit_dim-03.txt |
WA |
176 ms |
11136 KB |
40-limit_dim-04.txt |
WA |
180 ms |
11136 KB |
40-limit_dim-05.txt |
WA |
178 ms |
11136 KB |
40-limit_dim-06.txt |
WA |
175 ms |
11136 KB |
Corner1.txt |
WA |
8 ms |
10624 KB |
Sample1.txt |
AC |
8 ms |
10624 KB |