提出 #373395

---

ソースコード 拡げる

#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <array>
#include <climits>
#include <bitset>
#include <cassert>
#include <unordered_map>
#include <complex>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;

const int N = 1e5 + 10;
set<int> G[N];

int col[N];

void dfs(int v, int c){
	if (col[v] >= 0){
		assert(col[v] == c);
		return;
	}
	col[v] = c;

	for (auto to : G[v]){
		dfs(to, c ^ 1);
	}
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout.setf(ios::fixed);
	cout.precision(20);

	int t;
	cin >> t;

	vector<string> a(t), sa;
	rep(i, t){
		cin >> a[i];
		sa.push_back(a[i]);
	}

	sort(ALL(sa));
	UNIQUE(sa);

	auto get_id = [&](string &s){
		auto it = lower_bound(ALL(sa), s);
		if (it != sa.end() && s == *it) return (int)(it - sa.begin());
		return -1;
	};

	rep(i, sa.size()){
		auto &s = sa[i];
		rep(j, s.size() - 1){
			swap(s[j], s[j + 1]);
			int to = get_id(s);
			if (i != to && to >= 0){
				G[i].insert(to);
				G[to].insert(i);
			}
			swap(s[j], s[j + 1]);
		}
	}

	MEMSET(col, -1);
	rep(i, sa.size()) if (col[i] < 0) dfs(i, 0);

	rep(i, t){
		cout << col[get_id(a[i])] << '\n';
	}
}

提出情報

ジャッジ結果