#637260 (C++11) No.1456 Range Xor

提出ソース

結果

問題	No.1456 Range Xor
ユーザー	leaf_1415
提出日時	2021-03-31 21:17:51
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	62 ms / 2,000 ms
コード長	4,593 bytes
コンパイル時間	917 ms
コンパイル使用メモリ	89,824 KB
実行使用メモリ	8,064 KB
最終ジャッジ日時	2024-05-09 04:38:32
合計ジャッジ時間	3,609 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	17 ms 5,376 KB
testcase_04	AC	22 ms 5,376 KB
testcase_05	AC	41 ms 6,912 KB
testcase_06	AC	18 ms 5,376 KB
testcase_07	AC	50 ms 7,552 KB
testcase_08	AC	33 ms 6,400 KB
testcase_09	AC	19 ms 5,376 KB
testcase_10	AC	25 ms 5,504 KB
testcase_11	AC	10 ms 5,376 KB
testcase_12	AC	5 ms 5,376 KB
testcase_13	AC	18 ms 5,376 KB
testcase_14	AC	10 ms 5,376 KB
testcase_15	AC	14 ms 5,376 KB
testcase_16	AC	24 ms 5,632 KB
testcase_17	AC	25 ms 5,760 KB
testcase_18	AC	7 ms 5,376 KB
testcase_19	AC	28 ms 5,888 KB
testcase_20	AC	26 ms 5,760 KB
testcase_21	AC	18 ms 5,376 KB
testcase_22	AC	13 ms 5,376 KB
testcase_23	AC	16 ms 5,376 KB
testcase_24	AC	8 ms 5,376 KB
testcase_25	AC	16 ms 5,376 KB
testcase_26	AC	28 ms 6,016 KB
testcase_27	AC	23 ms 5,376 KB
testcase_28	AC	13 ms 5,376 KB
testcase_29	AC	62 ms 8,064 KB
testcase_30	AC	28 ms 5,888 KB
testcase_31	AC	12 ms 5,376 KB
testcase_32	AC	10 ms 5,376 KB
testcase_33	AC	17 ms 5,376 KB
testcase_34	AC	35 ms 6,528 KB
testcase_35	AC	21 ms 5,376 KB
testcase_36	AC	29 ms 5,888 KB
testcase_37	AC	57 ms 7,936 KB
testcase_38	AC	9 ms 5,376 KB
testcase_39	AC	17 ms 5,376 KB
testcase_40	AC	39 ms 6,784 KB
testcase_41	AC	2 ms 5,376 KB
testcase_42	AC	6 ms 5,376 KB
testcase_43	AC	2 ms 5,376 KB
testcase_44	AC	2 ms 5,376 KB
testcase_45	AC	2 ms 5,376 KB
testcase_46	AC	2 ms 5,376 KB
testcase_47	AC	2 ms 5,376 KB
testcase_48	AC	2 ms 5,376 KB

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

ソースコード

raw source code

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

const ll mod = 1000000007;
//const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) {
		os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	}
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++;
		if(itr != map_var.end()) os << ",";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t)
{
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}


ll n, k;
ll a[100005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k;
	rep(i, 1, n) cin >> a[i];
	rep(i, 1, n) a[i] ^= a[i-1];
	
	set<ll> S;
	S.insert(0);
	rep(i, 1, n){
		if(S.count(a[i]^k)){
			yes();
			return 0;
		}
		S.insert(a[i]);
	}
	no();
	
	
	return 0;
}

yukicoder

結果

テストケース

ソースコード