mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

---

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

verify/atcoder/abc/150/f.___test.cpp

• View this file on GitHub
• Last update: 2025-07-01 03:22:56+09:00
• Link: https://atcoder.jp/contests/abc150/tasks/abc150_f

Depends on

• Z Algorithm (string/z_algorithm.hpp)
• template/template.hpp

Code

#define PROBLEM "https://atcoder.jp/contests/abc150/tasks/abc150_f"

#include "./../../../../template/template.hpp"
#include "./../../../../string/z_algorithm.hpp"

void mmrz::solve(){
	int n;
	cin >> n;
	vector<int> a(n), b(n);
	for(auto &x : a)cin >> x;
	for(auto &x : b)cin >> x;
	
	vector<int> c;
	rep(i, n)c.pb(b[i]^b[(i+1)%n]);
	rep(i, n)c.pb(a[i]^a[(i+1)%n]);
	rep(i, n)c.pb(a[i]^a[(i+1)%n]);

	auto z = z_algorithm(c);
	
	rep(i, n){
		if(z[n+i] >= n){
			cout << i << " " << (a[i]^b[0]) << '\n';
		}
	}
}

#line 1 "verify/atcoder/abc/150/f.___test.cpp"
#define PROBLEM "https://atcoder.jp/contests/abc150/tasks/abc150_f"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "string/z_algorithm.hpp"

#line 4 "string/z_algorithm.hpp"

template<typename T>
std::vector<int> z_algorithm(const T &s){
	std::vector<int> z(s.size());
	z[0] = (int)z.size();
	int i = 1, j = 0;
	while(i < (int)z.size()){
		while(i+j < (int)s.size() && s[j] == s[i+j])j++;
		z[i] = j;
		
		if(j == 0){
			i++;
			continue;
		}
		
		int k = 1;
		while(k < j && k + z[k] < j){
			z[i+k] = z[k];
			k++;
		}
		i += k;
		j -= k;
	}
	return z;
}
#line 5 "verify/atcoder/abc/150/f.___test.cpp"

void mmrz::solve(){
	int n;
	cin >> n;
	vector<int> a(n), b(n);
	for(auto &x : a)cin >> x;
	for(auto &x : b)cin >> x;
	
	vector<int> c;
	rep(i, n)c.pb(b[i]^b[(i+1)%n]);
	rep(i, n)c.pb(a[i]^a[(i+1)%n]);
	rep(i, n)c.pb(a[i]^a[(i+1)%n]);

	auto z = z_algorithm(c);
	
	rep(i, n){
		if(z[n+i] >= n){
			cout << i << " " << (a[i]^b[0]) << '\n';
		}
	}
}

Back to top page