結果
| 問題 | No.1640 簡単な色塗り |
| ユーザー |
 kaikey
|
| 提出日時 | 2021-08-06 22:32:34 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 8,444 bytes |
| コンパイル時間 | 2,676 ms |
| コンパイル使用メモリ | 234,444 KB |
| 実行使用メモリ | 46,076 KB |
| 最終ジャッジ日時 | 2024-06-29 15:37:20 |
| 合計ジャッジ時間 | 25,625 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | RE | - |
| testcase_01 | AC | 2 ms
6,940 KB |
| testcase_02 | RE | - |
| testcase_03 | RE | - |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | RE | - |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | AC | 2 ms
6,944 KB |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | AC | 24 ms
7,552 KB |
| testcase_31 | AC | 232 ms
31,768 KB |
| testcase_32 | AC | 176 ms
28,160 KB |
| testcase_33 | AC | 109 ms
20,224 KB |
| testcase_34 | AC | 133 ms
24,320 KB |
| testcase_35 | AC | 102 ms
20,224 KB |
| testcase_36 | AC | 23 ms
7,492 KB |
| testcase_37 | AC | 31 ms
9,216 KB |
| testcase_38 | AC | 199 ms
29,184 KB |
| testcase_39 | AC | 61 ms
14,336 KB |
| testcase_40 | AC | 63 ms
14,720 KB |
| testcase_41 | AC | 151 ms
24,832 KB |
| testcase_42 | AC | 69 ms
16,256 KB |
| testcase_43 | AC | 76 ms
16,512 KB |
| testcase_44 | AC | 78 ms
16,384 KB |
| testcase_45 | AC | 50 ms
13,056 KB |
| testcase_46 | AC | 25 ms
8,064 KB |
| testcase_47 | AC | 15 ms
6,272 KB |
| testcase_48 | AC | 195 ms
29,696 KB |
| testcase_49 | AC | 7 ms
5,376 KB |
| testcase_50 | AC | 2 ms
5,376 KB |
| testcase_51 | RE | - |
| testcase_52 | RE | - |
| testcase_53 | RE | - |
| 07_evil_01.txt | RE | - |
| 07_evil_02.txt | TLE | - |
コンパイルメッセージ
main.cpp:51:72: warning: overflow in conversion from 'double' to 'lint' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
51 | const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e18;
| ^~~~
ソースコード
#include "bits/stdc++.h"
#include <random>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
for (T& in : v) is >> in;
return is;
}
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 (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
F f;
rec(F&& f_) : f(std::forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&... args) const {
return f(*this, std::forward<Args>(args)...);
}
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e18;
lint dx[8] = { -1, 1, 0, 0, 1, -1, 1, -1 }, dy[8] = { 0, 0, 1, -1, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endl; return flag; }
struct Edge {
lint from, to;
string cost;
Edge() {
}
Edge(lint u, lint v, string c) {
cost = c;
from = u;
to = v;
}
bool operator<(const Edge& e) const {
if (SZ(cost) != SZ(e.cost)) return SZ(cost) < SZ(e.cost);
else return cost < e.cost;
}
};
struct WeightedEdge {
lint to;
lint cost;
WeightedEdge(lint v, lint c) {
to = v;
cost = c;
}
bool operator<(const WeightedEdge& e) const {
return cost < e.cost;
}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<plint, plint> qlint;
typedef pair<string, lint> valstr;
struct UnionFind {
public:
UnionFind() : _n(0) {}
UnionFind(int n) : _n(n), parent_or_size(n, -1) {}
int merge(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
int x = leader(a), y = leader(b);
if (x == y) return x;
if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
if (used_count) {
if (count_in_set[x].size() < count_in_set[y].size()) {
std::swap(count_in_set[x], count_in_set[y]);
}
for (auto p : count_in_set[y]) {
count_in_set[x][p.first] += p.second;
}
}
if (set_operate) {
root_values[x] = f(root_values[y], root_values[x]);
}
parent_or_size[x] += parent_or_size[y];
parent_or_size[y] = x;
return x;
}
bool same(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
return leader(a) == leader(b);
}
int leader(int a) {
assert(0 <= a && a < _n);
if (parent_or_size[a] < 0) return a;
return parent_or_size[a] = leader(parent_or_size[a]);
}
int size(int a) {
assert(0 <= a && a < _n);
return -parent_or_size[leader(a)];
}
std::vector<std::vector<int>> groups() {
std::vector<int> leader_buf(_n), group_size(_n);
for (int i = 0; i < _n; i++) {
leader_buf[i] = leader(i);
group_size[leader_buf[i]]++;
}
std::vector<std::vector<int>> result(_n);
for (int i = 0; i < _n; i++) {
result[i].reserve(group_size[i]);
}
for (int i = 0; i < _n; i++) {
result[leader_buf[i]].push_back(i);
}
result.erase(
std::remove_if(result.begin(), result.end(),
[&](const std::vector<int>& v) { return v.empty(); }),
result.end());
return result;
}
//update root calc
//set by set operations
void set_operate_and_value(std::vector<lint> array, function<lint(lint, lint)> _f) {
f = _f;
root_values = array;
set_operate = true;
}
lint get_set_value(int a) {
return root_values[leader(a)];
}
//regist count
void regist_count(int a, int label) {
if (!used_count) {
used_count = true;
count_in_set.assign(_n, std::map<int, int>());
}
count_in_set[leader(a)][label]++;
}
int get_count(int a, int label) {
if (!used_count) return -1;
return count_in_set[leader(a)][label];
}
private:
int _n;
std::vector<int> parent_or_size;
std::vector<std::map<int, int>> count_in_set;
bool used_count = false;
std::vector<lint> root_values;
function<lint(lint, lint)> f;
bool set_operate = false;
};
int main() {
lint N;
cin >> N;
VVl to(N);
UnionFind tree(N);
Vl used(N);
V<plint> arr(N);
map<plint, Vl> edx;
REP(i, N) {
lint u, v;
cin >> u >> v; u--; v--;
to[u].push_back(v);
to[v].push_back(u);
edx[{u, v}].push_back(i);
edx[{v, u}].push_back(i);
if (!tree.same(u, v)) {
tree.merge(u, v);
used[i] = 1;
}
arr[i] = { u, v };
}
Vl cnt(N);
REP(i, N) {
if (used[i]) continue;
cnt[tree.leader(arr[i].first)]++;
}
REP(i, N) {
if (cnt[tree.leader(i)] != 1) {
yn(false);
return 0;
}
used[i] = 0;
}
Vl ans(N), ans_used(N);
REP(i, N) {
auto dfs = [&](auto&& dfs, lint curr, lint prv) -> void {
used[curr] = 1;
for (lint nxt : to[curr]) {
if (used[nxt]) continue;
dfs(dfs, nxt, curr);
if (!edx[{curr, nxt}].empty()) {
if (!ans_used[nxt]) {
ans_used[nxt] = 1;
ans[edx[{curr, nxt}].back()] = nxt + 1;
}
else {
ans_used[curr] = 1;
ans[edx[{curr, nxt}].back()] = curr + 1;
}
edx[{curr, nxt}].pop_back();
edx[{nxt, curr}].pop_back();
}
}
};
if (used[i] == 0) dfs(dfs, i, -1);
}
for (auto p : edx) {
if (SZ(p.second) != 0) {
for (auto v : p.second) {
if (ans_used[p.first.first] == 0) {
ans[v] = p.first.first + 1;
ans_used[p.first.first] = 1;
}
else {
assert(ans_used[p.first.second] == 0);
ans[v] = p.first.second + 1;
ans_used[p.first.second] = 1;
}
}
}
}
yn(true);
REP(i, N) {
cout << ans[i] << endk;
}
}