#515968 (C++17) No.1121 Social Distancing in Cinema

提出ソース

結果

問題	No.1121 Social Distancing in Cinema
ユーザー	maroon_kuri
提出日時	2020-07-22 21:37:37
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,877 bytes
コンパイル時間	2,559 ms
コンパイル使用メモリ	212,624 KB
実行使用メモリ	5,908 KB
最終ジャッジ日時	2023-09-04 16:14:31
合計ジャッジ時間	13,452 ms
ジャッジサーバーID （参考情報）	judge12 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	81 ms 4,484 KB
testcase_01	AC	81 ms 4,384 KB
testcase_02	AC	80 ms 4,416 KB
testcase_03	AC	81 ms 4,428 KB
testcase_04	AC	81 ms 4,484 KB
testcase_05	AC	81 ms 4,384 KB
testcase_06	AC	81 ms 4,448 KB
testcase_07	AC	81 ms 4,468 KB
testcase_08	AC	81 ms 4,492 KB
testcase_09	AC	80 ms 4,528 KB
testcase_10	AC	81 ms 4,384 KB
testcase_11	AC	81 ms 4,436 KB
testcase_12	AC	81 ms 4,492 KB
testcase_13	AC	81 ms 4,384 KB
testcase_14	AC	81 ms 4,488 KB
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	82 ms 4,528 KB
testcase_21	AC	81 ms 4,516 KB
testcase_22	AC	81 ms 4,568 KB
testcase_23	AC	82 ms 4,592 KB
testcase_24	AC	81 ms 4,424 KB
testcase_25	WA	-
testcase_26	WA	-
testcase_27	AC	81 ms 4,444 KB
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	AC	82 ms 4,488 KB
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	AC	81 ms 4,556 KB
testcase_48	AC	81 ms 4,508 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
//#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

int mex(vi x){
	mkuni(x);
	rep(i,si(x))if(i!=x[i])return i;
	return si(x);
}

const int vmax=510;
int col[vmax][vmax];
int buf[vmax];

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int s=0;
	
	vc<pi> z;
	rep(x,11)rng(y,-10,11)if(pi(x,y)>pi(0,0)&&sq(x)+sq(y)<=100)z.eb(x,y);
	one(buf);
	int cur=0;
	per(i,vmax)per(j,vmax){
		for(auto xy:z){
			int x=i+xy.a,y=j+xy.b;
			if(x<vmax&&inc(0,y,vmax-1)){
				buf[col[x][y]]=cur;
			}
		}
		rep(k,vmax)if(buf[k]!=cur){
			col[i][j]=k;
			break;
		}
		chmax(s,col[i][j]+1);
		cur++;
	}
	
	int n;cin>>n;
	vvc<int> idx(s);
	rep(i,n){
		int x,y;cin>>x>>y;
		x--;y--;
		idx[col[x][y]].pb(i);
		//cerr<<x<<" "<<y<<" "<<col[x][y]<<endl;
	}
	int mx=0;
	rep(i,s)chmax(mx,si(idx[i]));
	rep(i,s)if(si(idx[i])==mx){
		print(si(idx[i]));
		for(auto&v:idx[i])v++;
		print(idx[i]);
		return 0;
	}
	assert(0);
}

yukicoder

結果

テストケース

ソースコード