Submission #1794643
Source Code Expand
#pragma region include #include <iostream> #include <iomanip> #include <stdio.h> #include <sstream> #include <algorithm> #include <iterator> #include <cmath> #include <complex> #include <string> #include <cstring> #include <vector> #include <tuple> #include <bitset> #include <queue> #include <complex> #include <set> #include <map> #include <stack> #include <list> #include <fstream> #include <random> //#include <time.h> #include <ctime> #pragma endregion //#include ///////// #define REP(i, x, n) for(int i = x; i < n; ++i) #define rep(i,n) REP(i,0,n) #define ALL(X) X.begin(), X.end() ///////// #pragma region typedef typedef long long LL; typedef long double LD; typedef unsigned long long ULL; typedef std::pair<LL,LL> PLL;// typedef std::pair<int,int> PII;// #pragma endregion //typedef ////定数 const int INF = (int)1e9; const LL MOD = (LL)1e9+7; const LL LINF = (LL)4e18+20; const LD PI = acos(-1.0); const double EPS = 1e-9; ///////// using namespace::std; int fld[101][101][101]; void solve(){ int N,M; cin >> N >> M; for(int i=0;i<=100;++i){ for(int j=0;j<=100;++j){ for(int k=0;k<=100;++k){ fld[i][j][k] = 0; } } } int a,b,c,w; for(int i=0;i<N;++i){ cin>>a>>b>>c>>w; fld[a][b][c] = max(fld[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){ if(i){ fld[i][j][k] = max(fld[i][j][k],fld[i-1][j][k]); } if(j){ fld[i][j][k] = max(fld[i][j][k],fld[i][j-1][k]); } if(k){ fld[i][j][k] = max(fld[i][j][k],fld[i][j][k-1]); } } } } for(int i=0;i<M;++i){ cin>>a>>b>>c; cout << fld[a][b][c] << endl; } } #pragma region main signed main(void){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed;//小数を10進数表示 cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別 solve(); } #pragma endregion //main()
Submission Info
Submission Time | |
---|---|
Task | C - Optimal Recommendations |
User | akarin55 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1997 Byte |
Status | AC |
Exec Time | 109 ms |
Memory | 4736 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 | 4736 KB |
10-random-01.txt | AC | 7 ms | 4224 KB |
10-random-02.txt | AC | 66 ms | 4608 KB |
10-random-03.txt | AC | 82 ms | 4736 KB |
10-random-04.txt | AC | 27 ms | 4352 KB |
20-absW-00.txt | AC | 107 ms | 4480 KB |
20-absW-01.txt | AC | 7 ms | 4224 KB |
20-absW-02.txt | AC | 47 ms | 4352 KB |
20-absW-03.txt | AC | 93 ms | 4480 KB |
20-absW-04.txt | AC | 37 ms | 4352 KB |
30-balance-00.txt | AC | 109 ms | 4736 KB |
30-balance-01.txt | AC | 7 ms | 4224 KB |
30-balance-02.txt | AC | 39 ms | 4480 KB |
30-balance-03.txt | AC | 49 ms | 4480 KB |
30-balance-04.txt | AC | 85 ms | 4736 KB |
40-limit_dim-00.txt | AC | 109 ms | 4736 KB |
40-limit_dim-01.txt | AC | 108 ms | 4736 KB |
40-limit_dim-02.txt | AC | 109 ms | 4736 KB |
40-limit_dim-03.txt | AC | 108 ms | 4736 KB |
40-limit_dim-04.txt | AC | 108 ms | 4736 KB |
40-limit_dim-05.txt | AC | 108 ms | 4736 KB |
40-limit_dim-06.txt | AC | 106 ms | 4736 KB |
Corner1.txt | AC | 7 ms | 4224 KB |
Sample1.txt | AC | 7 ms | 4224 KB |