#26786 (C++11) No.202 1円玉投げ

• 問題: No.202 1円玉投げ
• ユーザー: hirokazu1020
• 提出日時: 2015-05-15 05:36:15
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 304 ms / 5,000 ms
• コード長: 3,505 bytes
• コンパイル時間: 620 ms
• コンパイル使用メモリ: 78,548 KB
• 実行使用メモリ: 37,972 KB
• 最終ジャッジ日時: 2023-08-23 22:50:24
• 合計ジャッジ時間: 5,154 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	86 ms; 11,172 KB
testcase_01	AC	304 ms; 37,972 KB
testcase_02	AC	5 ms; 8,524 KB
testcase_03	AC	5 ms; 8,804 KB
testcase_04	AC	5 ms; 8,512 KB
testcase_05	AC	13 ms; 10,312 KB
testcase_06	AC	219 ms; 28,704 KB
testcase_07	AC	258 ms; 30,672 KB
testcase_08	AC	267 ms; 30,784 KB
testcase_09	AC	121 ms; 22,160 KB
testcase_10	AC	43 ms; 14,828 KB
testcase_11	AC	94 ms; 19,960 KB
testcase_12	AC	98 ms; 20,248 KB
testcase_13	AC	48 ms; 15,320 KB
testcase_14	AC	15 ms; 10,548 KB
testcase_15	AC	112 ms; 21,784 KB
testcase_16	AC	78 ms; 13,128 KB
testcase_17	AC	72 ms; 11,084 KB
testcase_18	AC	72 ms; 11,088 KB
testcase_19	AC	105 ms; 21,080 KB
testcase_20	AC	183 ms; 26,940 KB
testcase_21	AC	107 ms; 21,000 KB
testcase_22	AC	6 ms; 8,596 KB
testcase_23	AC	5 ms; 8,556 KB
testcase_24	AC	6 ms; 8,824 KB
testcase_25	AC	6 ms; 8,524 KB
testcase_26	AC	6 ms; 8,956 KB
testcase_27	AC	6 ms; 8,880 KB
testcase_28	AC	6 ms; 8,544 KB
testcase_29	AC	6 ms; 8,540 KB
testcase_30	AC	6 ms; 8,820 KB
testcase_31	AC	5 ms; 8,588 KB
testcase_32	AC	6 ms; 8,820 KB
testcase_33	AC	6 ms; 8,616 KB
testcase_34	AC	6 ms; 8,692 KB
testcase_35	AC	73 ms; 11,268 KB
testcase_36	AC	76 ms; 11,008 KB
testcase_37	AC	270 ms; 32,044 KB
testcase_38	AC	79 ms; 11,268 KB
testcase_39	AC	5 ms; 8,556 KB
testcase_40	AC	5 ms; 8,524 KB

ソースコード

#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())


int highest_pop(unsigned int b){
#ifdef __GNUC__
	return 31-__builtin_clz(b);
#else 
	int res=0;
	for(int i=4;i>=0;i--){
		int shift=1<<i;
		if(b>>shift){
			b>>=shift;
			res|=shift;
		}
	}
	return res;
#endif
}

template<int U=30> 
class Set{
	unsigned int summary;
	Set<U-5> *ch[1<<5];
	static int low_bits(unsigned int a){
		return a&((1<<U-5)-1);
	}
	static int high_bits(unsigned int a){
		return a>>(U-5);
	}
	static int index(unsigned int high,unsigned int low){
		return high<<U-5|low;
	}
public:
	Set():summary(0){
		for(int i=0;i<(1<<5);i++)ch[i]=NULL;
	}
	~Set(){clear();}
	void clear(){
		summary=0;
		for(int i=0;i<(1<<5);i++){
			if(ch[i])delete ch[i];
			ch[i]=NULL;
		}
	}
	void insert(int v){
		int high=high_bits(v);
		summary|=1<<high;
		if(!ch[high])ch[high]=new Set<U-5>();
		ch[high]->insert(low_bits(v));
	}
	bool erase(int v){
		int high=high_bits(v);
		if(!ch[high])return true;
		if(!ch[high]->erase(low_bits(v))){
			delete ch[high];
			ch[high]=NULL;			
			return summary&=~(1<<high);
		}
		return true;
	}
	int nextvalue(int v)const{
		int high=high_bits(v);
		int low=low_bits(v);
		int a;
		if(ch[high] && (a=ch[high]->nextvalue(low))!=-1){
			return index(high,a);
		}else{
			high=summary&~((1<<high)-1)&~(1<<high);
			if(!high)return -1;
			high=highest_pop(high&-high);
			return index(high,ch[high]->min());
		}
	}
	int prevvalue(int v)const{
		int high=high_bits(v);
		int low=low_bits(v);
		int a;
		if(ch[high] && (a=ch[high]->prevvalue(low))!=-1){
			return index(high,a);
		}else{
			high=summary&((1<<high)-1);
			if(!high)return -1;
			high=highest_pop(high);
			return index(high,ch[high]->max());
		}
	}
	int min()const{
		if(!summary)return -1;
		int high=highest_pop(summary&-summary);
		return index(high,ch[high]->min());
	}
	int max()const{
		if(!summary)return -1;
		int high=highest_pop(summary);
		return index(high,ch[high]->max());
	}
	bool member(int v)const{
		int high=high_bits(v);
		return ch[high] && ch[high]->member(low_bits(v));
	}
};


template<> 
class Set<5>{
	unsigned int summary;
public:
	Set():summary(0){}
	void clear(){summary=0;}
	void insert(int v){
		summary|=1<<v;
	}
	bool erase(int v){
		return summary&=~(1<<v);
	}
	int nextvalue(int v)const{
		int a=summary&~((1<<v)-1)&~(1<<v);
		if(!a)return -1;
		return highest_pop(a&-a);
	}
	int prevvalue(int v)const{
		int a=summary&((1<<v)-1);
		if(!a)return -1;
		return highest_pop(a);
	}
	int min()const{
		if(!summary)return -1;
		return highest_pop(summary&-summary);
	}
	int max()const{
		if(!summary)return -1;
		return highest_pop(summary);
	}
	bool member(int v)const{
		return summary>>v&1;
	}
};




Set<15> xset[20021];


int main(){
	int n,ans=0;
	cin>>n;
	rep(i,n){
		bool hit=false;
		int x,y;
		cin>>x>>y;
		for(int a=max(0,y-20);!hit&&a<y+20;a++){
			int b;
			b=xset[a].nextvalue(x);
			if(b!=-1&&(a-y)*(a-y)+(b-x)*(b-x)<20*20)hit=true;
			b=xset[a].prevvalue(x+1);
			if(b!=-1&&(a-y)*(a-y)+(b-x)*(b-x)<20*20)hit=true;
		}
		if(!hit){
			xset[y].insert(x);
			ans++;
		}
	}
	cout<<ans<<endl;
	return 0;
}