結果

問題 No.206 数の積集合を求めるクエリ
コンテスト
ユーザー torus711
提出日時 2015-05-10 07:37:05
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
WA  
実行時間 -
コード長 2,960 bytes
コンパイル時間 677 ms
コンパイル使用メモリ 91,756 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-05 21:22:59
合計ジャッジ時間 10,250 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 3 WA * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:76:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   76 |         scanf( "%d %d %d", &L1, &L2, &N );
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:79:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   79 |                 scanf( "%d", A + i );
      |                 ~~~~~^~~~~~~~~~~~~~~
main.cpp:83:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   83 |                 scanf( "%d", B + i );
      |                 ~~~~~^~~~~~~~~~~~~~~
main.cpp:87:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   87 |         scanf( "%d", &Q );
      |         ~~~~~^~~~~~~~~~~~

ソースコード

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

constexpr int W = 64;

int A[ 1 << 17 ], B[ 1 << 17 ];
LL a[ 1 << 11 ], b[ 1 << 11 ];

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

	int L1, L2, N;
	scanf( "%d %d %d", &L1, &L2, &N );
	REP( i, L1 )
	{
		scanf( "%d", A + i );
	}
	REP( i, L2 )
	{
		scanf( "%d", B + i );
	}

	int Q;
	scanf( "%d", &Q );


	REP( i, L1 )
	{
		const int bucket = A[i] / 64;
		a[ bucket ] |= 1 << ( A[i] % 64 );
	}
	REP( i, L2 )
	{
		const int bucket = B[i] / 64;
		b[ bucket ] |= 1 << ( B[i] % 64 );
	}

	REP( iteration, Q )
	{
		int res = 0;
		REP( i, 1 << 11 )
		{
			res += __builtin_popcountll( a[i] & b[i] );
		}
		printf( "%d\n", res );

		for ( int i = ( 1 << 11 ) - 1; 0 < i; --i )
		{
			b[i] <<= 1;
			if ( b[ i - 1 ] < 0 )
			{
				b[i] |= 1;
			}
		}
		b[0] <<= 1;
	}
	fflush( stdin );

	return 0;
}
0