結果
| 問題 |
No.3056 Disconnected Coloring
|
| ユーザー |
 fuppy_kyopro
|
| 提出日時 | 2025-03-14 21:44:26 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,207 bytes |
| コンパイル時間 | 2,901 ms |
| コンパイル使用メモリ | 210,216 KB |
| 実行使用メモリ | 12,788 KB |
| 最終ジャッジ日時 | 2025-03-14 21:45:16 |
| 合計ジャッジ時間 | 35,343 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 13 WA * 18 RE * 3 |
ソースコード
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
// #include <atcoder/all>
#include <atcoder/segtree>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
// #define _GLIBCXX_DEBUG
#ifdef LOCAL
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
cerr << " " << v[iiiiiiii]; \
cerr << endl;
#define DEBUG_MAT(v) \
cerr << #v << endl; \
for (int iv = 0; iv < v.size(); iv++) { \
for (int jv = 0; jv < v[iv].size(); jv++) { \
cerr << v[iv][jv] << " "; \
} \
cerr << endl; \
}
#else
#define DEBUG(x) ;
#define DEBUG_VEC(v) ;
#define DEBUG_MAT(v) ;
#endif
typedef long long ll;
// #define int ll
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U>
T ceil_div(T a, U b) {
return (a + b - 1) / b;
}
template <class T>
T safe_mul(T a, T b) {
if (a == 0 || b == 0) return 0;
if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max();
return a * b;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
vector<int> gen_perm(int n) {
vector<int> ret(n);
iota(all(ret), 0);
return ret;
}
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
Setup_io() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(25);
cerr << fixed << setprecision(25);
}
} setup_io;
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
// #define mp make_pair
struct dice {
mt19937 mt;
dice() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
// [0, x)の一様乱数
ll operator()(ll x) { return this->operator()(0, x); }
// [x, y)の一様乱数
ll operator()(ll x, ll y) {
uniform_int_distribution<ll> dist(x, y - 1);
return dist(mt);
}
vl operator()(int n, ll x, ll y) {
vl res(n);
for (int i = 0; i < n; i++)
res[i] = this->operator()(x, y);
return res;
}
} rnd;
std::random_device seed_gen;
std::mt19937 engine(seed_gen());
class UnionFind {
private:
vi par_;
vi ran_;
vi num_;
vi edge_num_;
public:
int n;
int g; // group
UnionFind(int _n) {
n = _n;
g = n;
par_.resize(n);
ran_.resize(n);
num_.resize(n);
edge_num_.resize(n);
for (int i = 0; i < n; i++) {
par_[i] = i;
ran_[i] = 0;
num_[i] = 1;
edge_num_[i] = 0;
}
}
int find(int x) {
if (par_[x] == x) {
return x;
} else {
return par_[x] = find(par_[x]);
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
int numsum = num_[x] + num_[y];
int edge_numsum = edge_num_[x] + edge_num_[y];
if (x == y) {
edge_num_[x]++;
return;
}
if (ran_[x] < ran_[y]) {
par_[x] = y;
} else {
par_[y] = x;
if (ran_[x] == ran_[y]) {
ran_[x]++;
}
}
num_[x] = num_[y] = numsum;
edge_num_[x] = edge_num_[y] = edge_numsum + 1;
g--;
}
bool same(int x, int y) {
return find(x) == find(y);
}
int num(int x) {
return num_[find(x)];
}
int edge_num(int x) {
return edge_num_[find(x)];
}
};
auto start_time = chrono::system_clock::now();
signed main() {
int n, m;
cin >> n >> m;
vector<pii> es;
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
es.push_back({a, b});
}
if (m % 2 == 1) {
cout << -1 << endl;
return 0;
}
for (auto [u, v] : es) {
if (u == 0 && v == n - 1) {
cout << 1 << endl;
return 0;
}
}
vi perm = gen_perm(m);
while (true) {
double sec = chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now() - start_time).count();
if (sec > 1900) {
cout << -1 << endl;
return 0;
}
shuffle(all(perm), engine);
UnionFind uf1(n), uf2(n);
rep(i, m) {
auto [u, v] = es[perm[i]];
if (i % 2 == 0) {
uf1.unite(u, v);
} else {
uf2.unite(u, v);
}
}
if (uf1.same(0, n - 1) || uf2.same(0, n - 1)) {
continue;
}
vi is_red(n);
rep(i, m) {
if (i % 2 == 0) {
is_red[perm[i]] = 1;
}
}
rep(i, m) {
if (is_red[i]) {
cout << "R";
} else {
cout << "B";
}
}
cout << endl;
return 0;
}
cout << -1 << endl;
}