#15500 (C++11) No.165 四角で囲え！

提出ソース

結果

問題	No.165 四角で囲え！
ユーザー	shimomire
提出日時	2015-03-13 00:36:50
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	958 ms / 5,000 ms
コード長	8,001 bytes
コンパイル時間	1,292 ms
コンパイル使用メモリ	131,168 KB
実行使用メモリ	8,320 KB
最終ジャッジ日時	2024-06-07 18:59:12
合計ジャッジ時間	11,146 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	502 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	629 ms 6,944 KB
testcase_06	AC	120 ms 6,944 KB
testcase_07	AC	1 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,948 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	283 ms 6,944 KB
testcase_12	AC	124 ms 6,940 KB
testcase_13	AC	120 ms 6,940 KB
testcase_14	AC	80 ms 6,940 KB
testcase_15	AC	93 ms 6,940 KB
testcase_16	AC	935 ms 8,064 KB
testcase_17	AC	929 ms 8,192 KB
testcase_18	AC	931 ms 8,192 KB
testcase_19	AC	958 ms 8,320 KB
testcase_20	AC	943 ms 8,192 KB
testcase_21	AC	947 ms 8,320 KB
testcase_22	AC	940 ms 8,320 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define ALL(c) (begin(c)),(end(c))
#define REP(i,n) FOR(i,0,n)
#define REPr(i,n) FORr(i,0,n)
#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)
#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())
//debug
#define DUMP(x)  cerr << #x << " = " << (x)
#define LINE()    cerr<< " (L" << __LINE__ << ")"

class range {
private:
	struct Iter{
		int v;
		int operator*(){return v;}
		bool operator!=(Iter& itr) {return v < itr.v;}
		void operator++() {++v;}
	};
	Iter i, n;
public:
	range(int n) : i({0}), n({n}) {}
	range(int i, int n) : i({i}), n({n}) {}
	Iter& begin() {return i;}
	Iter& end() {return n;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){is>>p.first>>p.second;return is;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){is >> get<0>(t);return is;}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){is >> get<0>(t) >> get<1>(t);return is;}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){is >>get<0>(t)>>get<1>(t)>>get<2>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4,typename T5> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t) >> get<6>(t);return is;}
template<typename T> istream& operator >> (istream& is,vector<T>& as){REP(i,as.size())is >>as[i];return is;}

//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){os<<p.first<<" "<<p.second;return os;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){os << get<0>(t);return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){os << get<0>(t)<<" "<<get<1>(t);return os;}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t)<<" "<<get<6>(t);return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){REP(i,as.size()){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){REP(i,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}

//input
char tmp[1000];
#define nextInt(n) scanf("%d",&n)
#define nextLong(n) scanf("%lld",&n) //I64d
#define nextDouble(n) scanf("%lf",&n) 
#define nextChar(n) scanf("%c",&n)
#define nextString(n) scanf("%s",tmp);n=tmp

// values
template<typename T> T INF(){assert(false);};
template<> int INF<int>(){return 1<<28;};
template<> ll INF<ll>(){return 1LL<<58;};
template<> double INF<double>(){return 1e16;};
template<> long double INF<long double>(){return 1e16;};

template<class T> T EPS(){assert(false);};
template<> int EPS<int>(){return 1;};
template<> ll EPS<ll>(){return 1LL;};
template<> double EPS<double>(){return 1e-8;};
template<> long double EPS<long double>(){return 1e-8;};

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}



template<typename T> class Monoid{
public:
	virtual T e()=0,c(T,T)=0;
};template<typename T> class Group:public virtual Monoid<T>{
public:
	virtual T inv(T)=0;
};
template <typename T> using CommutativeGroup = Group<T>;

template<typename T> class PlusGroup:public Group<T>{
public:
	T e(){return 0;}
	T c(T a,T b){return a+b;}
	T inv(T a){return -a;}
	static PlusGroup<T>& i(){static PlusGroup<T> i;return i;}
};


template<typename T> class CumulativeSum{
public:
	const int size;Group<T>& g;
	vector<T> dat;
	CumulativeSum(vector<T>& as,Group<T>& g):size(as.size()),g(g){
		dat=vector<T>(size+1,g.e());
		for(int i:range(1,size+1))dat[i] =g.c(dat[i-1],as[i-1]);
	}
	T sum(int a,int b){// [a,b)
		return g.c(dat[b],g.inv(dat[a]));
	}
};

// imos 2D
// init O(HW), set O(∞), get O(1), query O(1)
template<typename T> class CumulativeSum2D{
public:
	int Y,X;vector<vector<T>> bit;Group<T>& g;
	CumulativeSum2D(vector<vector<T>>& as,Group<T>& g):Y(as.size()),X(as[0].size()),g(g){
		bit =vector<vector<T>>(Y+1,vector<T>(X+1));
		for(int y:range(1,Y+1))for(int x:range(1,X+1))bit[y][x] = g.c(g.c(g.c(bit[y-1][x],bit[y][x-1]),g.inv(bit[y-1][x-1])),as[y-1][x-1]);
	}
	T sum(int y1,int x1,int y2,int x2){//[x1,x2)×[y1,y2)
		return g.c(g.c(bit[y2][x2],bit[y1][x1]), g.inv(g.c(bit[y1][x2],bit[y2][x1])));
	}
};



class Main{
	public:

	void run(){
		int N;ll B;cin >> N >> B;
		vector<ll> xs(N),ys(N),ps(N);
		for(int i:range(N))cin >> xs[i] >>ys[i] >> ps[i];

		map<ll,int> xmap,ymap;
		for(int i:range(N))xmap[xs[i]]=0;
		for(int i:range(N))ymap[ys[i]]=0;

		{int i=0;for(pair<ll,int> p:xmap)xmap[p.first]=i++;}
		{int i=0;for(pair<ll,int> p:ymap)ymap[p.first]=i++;}

		vector<vector<ll>> pvs(ymap.size(),vector<ll>(xmap.size()));
		vector<vector<ll>> cvs(ymap.size(),vector<ll>(xmap.size()));

		for(int i:range(N)){
			pvs[ymap[ys[i]]][xmap[xs[i]]]=ps[i];
			cvs[ymap[ys[i]]][xmap[xs[i]]]++;
		}

		CumulativeSum2D<ll> pimos(pvs,PlusGroup<ll>::i()),cimos(cvs,PlusGroup<ll>::i());

		ll Mv=-1;
		for(int yl:range(ymap.size()))for(int yr:range(yl+1,ymap.size()+1)){
			int xl=0,xr=1;
			while(xl < xmap.size()){
				if(pimos.sum(yl,xl, yr, xr)<=B) Mv=max(Mv,cimos.sum(yl, xl, yr, xr));

				if(xr<xmap.size() && pimos.sum(yl,xl, yr, xr)<=B){
					xr++;
				}else{
					xl++;
				}
			}
		}
		cout << Mv <<endl;
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}

yukicoder

結果

テストケース

ソースコード