結果

問題 No.190 Dry Wet Moist
ユーザー torus711torus711
提出日時 2015-04-22 01:15:08
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 156 ms / 2,000 ms
コード長 3,229 bytes
コンパイル時間 889 ms
コンパイル使用メモリ 109,288 KB
実行使用メモリ 15,612 KB
最終ジャッジ日時 2023-09-18 07:14:47
合計ジャッジ時間 3,306 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 1 ms
4,380 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 58 ms
8,732 KB
testcase_13 AC 70 ms
9,672 KB
testcase_14 AC 56 ms
8,348 KB
testcase_15 AC 77 ms
10,116 KB
testcase_16 AC 98 ms
11,568 KB
testcase_17 AC 13 ms
4,452 KB
testcase_18 AC 45 ms
7,580 KB
testcase_19 AC 96 ms
11,604 KB
testcase_20 AC 68 ms
9,504 KB
testcase_21 AC 9 ms
4,380 KB
testcase_22 AC 114 ms
10,060 KB
testcase_23 AC 156 ms
15,612 KB
testcase_24 AC 139 ms
14,396 KB
testcase_25 AC 2 ms
4,380 KB
testcase_26 AC 1 ms
4,380 KB
testcase_27 AC 85 ms
10,532 KB
testcase_28 AC 38 ms
7,144 KB
testcase_29 AC 51 ms
7,828 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#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 <limits>
#include <numeric>
#include <utility>
#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 VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< 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; }
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 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 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) ( c ).begin(), ( c ).end()
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + p, ( c ).end()

#define SZ( v ) ( (int)( v ).size() )
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

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

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

int solve1( VI as )
{
	const int N = SZ( as );

	VI plus, other;
	FOR( a, as )
	{
		( a <= 0 ? other : plus ).PB( a );
	}

	sort( ALL( plus ), greater< int >() );
	sort( ALL( other ) );

// 	DUMP( plus );
// 	DUMP( other );

	int res = 0;
	VI used( SZ( plus ) );
	for ( int i = 0, j = 0; i < SZ( plus ) && j < SZ( other ); ++i, ++j )
	{
		while ( j < SZ( other ) && plus[i] + other[j] <= 0 ) ++j;
		if ( plus[i] + other[j] <= 0 || SZ( other ) <= j )
		{
			break;
		}

		++res;
		used[i] = true;
	}

	return res + count( ALL( used ), false ) / 2;
}

int solve2( const VI &as )
{
	map< int, int > counts;
	for_each( ALL( as ), [&]( const int a ){ ++counts[a]; } );

	int res = 0;
	FOR( p, counts )
	{
		if ( 0 <= p.fst )
		{
			break;
		}

		res += min( p.snd, counts[ -p.fst ] );
	}
	return res + counts[0] / 2;;
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int N;
	cin >> N;

	VI as( 2 * N );
	cin >> as;

	VI bs;
	transform( ALL( as ), BI( bs ), negate< int >() );

	cout << solve1( bs ) << ' ' << solve1( as ) << ' ' << solve2( as ) << endl;

	return 0;
}
0