結果

問題 No.1055 牛歩
ユーザー maroon_kurimaroon_kuri
提出日時 2020-05-15 21:58:04
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,833 bytes
コンパイル時間 2,576 ms
コンパイル使用メモリ 216,836 KB
実行使用メモリ 28,272 KB
最終ジャッジ日時 2023-10-19 14:12:17
合計ジャッジ時間 9,270 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 46 ms
28,272 KB
testcase_02 AC 49 ms
13,260 KB
testcase_03 AC 49 ms
13,260 KB
testcase_04 AC 49 ms
13,260 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 32 ms
9,708 KB
testcase_08 WA -
testcase_09 AC 28 ms
8,512 KB
testcase_10 AC 29 ms
8,512 KB
testcase_11 WA -
testcase_12 AC 22 ms
9,416 KB
testcase_13 AC 22 ms
9,416 KB
testcase_14 AC 39 ms
12,248 KB
testcase_15 AC 39 ms
12,248 KB
testcase_16 AC 28 ms
8,820 KB
testcase_17 WA -
testcase_18 AC 28 ms
8,820 KB
testcase_19 WA -
testcase_20 AC 37 ms
10,660 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 55 ms
13,904 KB
testcase_24 AC 56 ms
13,956 KB
testcase_25 AC 49 ms
9,136 KB
testcase_26 AC 89 ms
13,824 KB
testcase_27 AC 88 ms
13,824 KB
testcase_28 AC 88 ms
13,828 KB
testcase_29 AC 60 ms
10,700 KB
testcase_30 AC 88 ms
13,824 KB
testcase_31 AC 8 ms
6,736 KB
testcase_32 AC 7 ms
5,996 KB
testcase_33 AC 9 ms
6,792 KB
testcase_34 AC 7 ms
5,612 KB
testcase_35 AC 10 ms
6,792 KB
testcase_36 AC 9 ms
6,792 KB
testcase_37 AC 8 ms
5,800 KB
testcase_38 AC 8 ms
6,220 KB
testcase_39 AC 3 ms
5,220 KB
testcase_40 AC 3 ms
5,312 KB
testcase_41 AC 3 ms
5,236 KB
testcase_42 AC 3 ms
5,272 KB
testcase_43 AC 4 ms
5,224 KB
testcase_44 AC 4 ms
5,292 KB
testcase_45 AC 4 ms
5,312 KB
testcase_46 AC 3 ms
5,228 KB
testcase_47 AC 4 ms
5,312 KB
testcase_48 AC 2 ms
4,348 KB
testcase_49 AC 2 ms
4,348 KB
testcase_50 AC 2 ms
4,348 KB
testcase_51 AC 2 ms
4,348 KB
testcase_52 AC 2 ms
4,348 KB
testcase_53 AC 2 ms
4,348 KB
testcase_54 AC 2 ms
4,348 KB
testcase_55 AC 3 ms
4,348 KB
testcase_56 AC 2 ms
4,348 KB
testcase_57 AC 2 ms
4,348 KB
testcase_58 AC 2 ms
4,348 KB
testcase_59 AC 2 ms
4,348 KB
testcase_60 AC 2 ms
4,348 KB
testcase_61 AC 2 ms
4,348 KB
testcase_62 AC 2 ms
4,348 KB
testcase_63 AC 2 ms
4,348 KB
testcase_64 AC 2 ms
4,348 KB
testcase_65 AC 2 ms
4,348 KB
testcase_66 AC 2 ms
4,348 KB
testcase_67 AC 2 ms
4,348 KB
testcase_68 AC 2 ms
4,348 KB
testcase_69 AC 2 ms
4,348 KB
testcase_70 AC 2 ms
4,348 KB
testcase_71 AC 2 ms
4,348 KB
testcase_72 WA -
testcase_73 AC 2 ms
4,348 KB
testcase_74 AC 2 ms
4,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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;
}

struct ysp{
	set<pi> s;
	void add(int l,int r){
		s.emplace(l,r);
	}
	bool check(int l,int r){
		auto itr=s.lower_bound(pi(r,inf));
		if(itr==s.bg)return true;
		itr--;
		if(max(l,itr->a)<=min(r,itr->b))return false;
		return true;
	}
};

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int n;cin>>n;
	int m;cin>>m;
	vc<ysp> mrt(n);
	vi a=readvi(m,-1);
	vvc<int> qs(m);
	int q;cin>>q;
	rep(i,q){
		int x;cin>>x;
		x--;
		qs[x].pb(i);
	}
	rep(i,m){
		int nx=si(qs[i])?qs[i][0]:q-1;
		mrt[a[i]].add(0,nx);
	}
	rep(i,m){
		int cur=a[i];
		rep(j,si(qs[i])){
			int x=qs[i][j];
			int y=(j+1<si(qs[i])?qs[i][j+1]:q-1);
			if(cur&&mrt[cur-1].check(x,y)){
				mrt[cur-1].add(x,y);
				cur--;
			}else if(cur+1<n&&mrt[cur+1].check(x,y)){
				mrt[cur+1].add(x,y);
				cur++;
			}else no();
		}
	}
	yes();
}
0