#1186115 (C++23(gnu拡張gcc16)) No.3709 Unknown Treasure

• 問題: No.3709 Unknown Treasure
• ユーザー: torus711
• 提出日時: 2026-09-11 21:36:10
• 言語: C++23(gnu拡張gcc16) (gcc 16.1.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 76 ms / 2,000 ms
• コード長: 5,661 bytes
• コンパイル時間: 1,589 ms
• コンパイル使用メモリ: 242,284 KB
• 実行使用メモリ: 34,944 KB
• 最終ジャッジ日時: 2026-09-11 21:36:36
• 合計ジャッジ時間: 4,369 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_0

ファイルパターン	結果
sample	AC * 3
other	AC * 36

ソースコード

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <ranges>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VLL = vector< long long >;
using VVLL = vector< vector< long long > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< VT< T > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using WG = std::vector< std::vector< std::pair< int, T > > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T = int > using OSI = ostream_iterator< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T, typename V >
auto make_vector( const int n, const V &v )
{
	return vector< T >( n, v );
}
template < typename T, typename... TS >
auto make_vector( const int n, TS... ts )
{
	return vector< decltype( make_vector< T >( forward< TS >( ts )...) ) >( n, make_vector< T >( forward< TS >( ts )... ) );
}
template < typename T, typename V >
auto make_vector0()
{
	return vector< T >();
}
template < typename T, typename... TS >
auto make_vector0( const int n, TS... ts )
{
	return vector< decltype( make_vector0< T >( forward< TS >( ts )...) ) >( n, make_vector0< T >( forward< TS >( ts )... ) );
}

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
template < typename C, typename F > void EACH( C &c, const F &&f ) { std::for_each( std::begin( c ), std::end( c ), f ); }
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )

#define MAP_PRED( c ) transform( begin( c ), end( c ), begin( c ), bind( minus< int >(), _1, 1 ) );

#define SZ( v ) ( (int)( v ).size() )
#define EXISTS( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

inline std::string YES( const bool l ){ return l ? "YES" : "Yes"; }
inline std::string NO( const bool l ){ return l ? "NO" : "No"; }
inline std::string YESNO( const bool f, const bool l = false ){ return f ? YES( l ) : NO( l ); }
constexpr char LF = '\n';

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

// いもす法による区間加算クエリ
// 加算 O( 1 )
// 集計 O( HW )
class Imos2d
{
private:
	const int H, W;
	vector< vector<int> > board, csum;
	bool solved;

public:
	Imos2d( const int h, const int w ) : H( h ), W( w ), board( H + 1, vector<int>( W + 1 ) ) {}

	void add( const int y1, const int x1, const int y2, const int x2, const int value )
	{
		board[ y1 ][ x1 ] += value;
		board[ y1 ][ x2 ] -= value;
		board[ y2 ][ x1 ] -= value;
		board[ y2 ][ x2 ] += value;

		solved = false;

		return;
	}

	int getValue( const int y, const int x )
	{
		if ( !solved )
		{
			solve();
		}
		return csum[y][x];
	}

private:
	void solve()
	{
		csum = board;

		for ( auto &row : csum )
		{
			partial_sum( row.begin(), row.end(), row.begin() );
		}

		for ( int i = 0; i < H; i++ )
		{
			for ( int j = 0; j <= W; j++ )
			{
				csum[ i + 1 ][j] += csum[i][j];
			}
		}

		solved = true;

		return;
	}
};
// imos2d( H, W )
// add( y1, x1, y2, x2, value ) : 半開区間
// getvalue( y, x )

int main()
{
	cin.tie( nullptr );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, H, W, N );
	
	Imos2d imos( H, W );
	REP( N )
	{
		IN( int, r1, c1, r2, c2 );
		--r1, --c1;

		imos.add( r1, c1, r2, c2, 1 );
	}

	int res = 0;
	REP( i, H )
	{
		REP( j, W )
		{
			res += imos.getValue( i, j ) == 0;
		}
	}
	cout << res << endl;

	return 0;
}