Submission #1443089

---

Source Code Expand

#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<random>
#include<unordered_set>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const int mod=1000000007;
const int big=1e16+10;
const long double pai=3.141592653589793238462643383279;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
int main(void){
	static int kyu[101][101][101]={0};
	int i,j,k,n,m;cin>>n>>m;
	for(i=0;i<n;i++){
		int a,b,c,w;cin>>a>>b>>c>>w;
		maxeq(kyu[a][b][c],w);
	}
	for(i=1;i<=100;i++){
		for(j=1;j<=100;j++){
			for(k=1;k<=100;k++){
				maxeq(kyu[i][j][k],max(max(kyu[i][j][k-1],kyu[i][j-1][k]),kyu[i-1][j][k]));
			}
		}
	}
	for(i=0;i<m;i++){
		int x,y,z;cin>>x>>y>>z;
		cout<<kyu[x][y][z]<<endl;
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp:28:20: warning: overflow in implicit constant conversion [-Woverflow]
 const int big=1e16+10;
                    ^

Judge Result