結果

問題 No.60 魔法少女
ユーザー shimomireshimomire
提出日時 2014-11-09 23:49:27
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 160 ms / 5,000 ms
コード長 5,065 bytes
コンパイル時間 910 ms
コンパイル使用メモリ 121,188 KB
実行使用メモリ 41,820 KB
最終ジャッジ日時 2023-08-30 02:52:01
合計ジャッジ時間 3,582 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 88 ms
40,756 KB
testcase_01 AC 88 ms
40,748 KB
testcase_02 AC 87 ms
40,868 KB
testcase_03 AC 86 ms
40,872 KB
testcase_04 AC 128 ms
41,072 KB
testcase_05 AC 128 ms
41,820 KB
testcase_06 AC 158 ms
41,792 KB
testcase_07 AC 139 ms
41,588 KB
testcase_08 AC 119 ms
41,336 KB
testcase_09 AC 102 ms
41,016 KB
testcase_10 AC 151 ms
41,796 KB
testcase_11 AC 93 ms
40,996 KB
testcase_12 AC 115 ms
41,536 KB
testcase_13 AC 160 ms
41,804 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#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;

using i32=int32_t;using i64=int64_t;using ll =i64;using uint=uint32_t;using ull=uint64_t;
template<typename T> using matrix=vector<vector<T> >;

#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;}
};

//output
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;}
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;}

//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<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;}


class Main{
	public:
	void run(){
		int N,K;cin >> N >> K;
		int D=1050;
		vector<vector<int>> imos2(2*D+1000,vector<int>(2*D+1000));

		vector<tuple<int,int,int>> es(N);
		REP(i,N){
			int x,y,h;cin >> x >> y >> h;
			es[i]=make_tuple(x,y,h);
		}
		REP(i,K){
			int x,y,w,h,d;cin >> x >> y >> w >> h >> d;
			imos2[y+D][x+D]+=d;
			imos2[y+h+1+D][x+D]-=d;
			imos2[y+D][x+w+1+D]-=d;
			imos2[y+h+1+D][x+w+1+D]+=d;
		}

		REP(y,2*D+10){
			FOR(x,1,2*D+10)imos2[y][x]=imos2[y][x]+imos2[y][x-1];
		}
		REP(x,2*D+10){
			FOR(y,1,2*D+10)imos2[y][x]=imos2[y][x]+imos2[y-1][x];
		}

		int res=0;
		REP(i,N){
			int x,y,h;tie(x,y,h)=es[i];
			// cerr << imos2[y+D][x+D]<<endl;
			res+=max(0,h-imos2[y+D][x+D]);
		}
		cout << res <<endl;
	}
};

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