Submission #2152047
Source Code Expand
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])
#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) for(auto tt=x.begin();tt!=x.end();tt++){if(tt!=x.begin())cout<<" ";cout<<(*tt);}cout<<endl
#define ALL(obj) (obj).begin(),(obj).end()
#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
cin>>head;
CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
template <class T = ll>
T IN(){T x;cin>>x;return (x);}
template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
seco.resize(head);
VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
VECCIN(head);
VT2(move(tail)...);
}
template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
seco[head]=IN();
VT3(head,move(tail)...);
}
#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace boost::multiprecision; // cpp_int
#define P pair<int,int>
#define V vector<int>
#define M map<int,int>
#define S set<int>
#define PQ priority_queue<int>
#define PQG priority_queue<int,V,greater<int>>
#define pb(a) push_back(a)
#define mp make_pair
int main(){
CIN(n,m);VC2(n,a,b,c,w);VC2(m,x,y,z);
//dp[i][j][k]:技術i語学jコミュkの人が手に入れられる最も高い年収
vector<vector<V>> dp(101,vector<V>(101,V(101,0)));
REP(i,n)dp[a[i]][b[i]][c[i]]=max(dp[a[i]][b[i]][c[i]],w[i]);
REP(i,101)REP(j,101)REP(k,101){
if(i!=100)dp[i+1][j][k]=max(dp[i][j][k],dp[i+1][j][k]);
if(j!=100)dp[i][j+1][k]=max(dp[i][j][k],dp[i][j+1][k]);
if(k!=100)dp[i][j][k+1]=max(dp[i][j][k],dp[i][j][k+1]);
}
REP(i,m)
COUT(dp[x[i]][y[i]][z[i]]);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Optimal Recommendations |
User |
shibh308 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
3333 Byte |
Status |
AC |
Exec Time |
171 ms |
Memory |
6528 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 |
159 ms |
6528 KB |
10-random-01.txt |
AC |
9 ms |
4736 KB |
10-random-02.txt |
AC |
81 ms |
5504 KB |
10-random-03.txt |
AC |
110 ms |
5760 KB |
10-random-04.txt |
AC |
56 ms |
5376 KB |
20-absW-00.txt |
AC |
150 ms |
6272 KB |
20-absW-01.txt |
AC |
9 ms |
4736 KB |
20-absW-02.txt |
AC |
77 ms |
5632 KB |
20-absW-03.txt |
AC |
122 ms |
5760 KB |
20-absW-04.txt |
AC |
49 ms |
5120 KB |
30-balance-00.txt |
AC |
159 ms |
6528 KB |
30-balance-01.txt |
AC |
9 ms |
4736 KB |
30-balance-02.txt |
AC |
49 ms |
5120 KB |
30-balance-03.txt |
AC |
89 ms |
5760 KB |
30-balance-04.txt |
AC |
109 ms |
5760 KB |
40-limit_dim-00.txt |
AC |
171 ms |
6528 KB |
40-limit_dim-01.txt |
AC |
164 ms |
6528 KB |
40-limit_dim-02.txt |
AC |
164 ms |
6528 KB |
40-limit_dim-03.txt |
AC |
163 ms |
6528 KB |
40-limit_dim-04.txt |
AC |
165 ms |
6528 KB |
40-limit_dim-05.txt |
AC |
161 ms |
6528 KB |
40-limit_dim-06.txt |
AC |
162 ms |
6528 KB |
Corner1.txt |
AC |
9 ms |
4736 KB |
Sample1.txt |
AC |
9 ms |
4736 KB |