結果
| 問題 | No.3508 OR Mapping |
| コンテスト | |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2026-04-18 00:39:47 |
| 言語 | C++17 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 9,805 bytes |
| 記録 | |
| コンパイル時間 | 2,897 ms |
| コンパイル使用メモリ | 236,092 KB |
| 実行使用メモリ | 169,692 KB |
| 最終ジャッジ日時 | 2026-04-18 00:41:57 |
| 合計ジャッジ時間 | 25,919 ms |
|
ジャッジサーバーID （参考情報） |
judge3_1 / judge2_1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 RE * 1 |
| other | AC * 47 RE * 18 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))
using i64 = int64_t;
using i128 = __int128_t;
using ll = long long;
using ul = unsigned long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<long long>;
using vull = vector<unsigned long long>;
using vc = vector<char>;
using vst = vector<string>;
using vd = vector<double>;
using vld = vector<long double>;
using P = pair<long long, long long>;
template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
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 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U>
void inGraph(vector<vector<T>> &G, U n, U m, bool directed = true, bool zero_index = true){
G.resize(n);
for(int i = 0; i < m; i++){
int a, b;
cin >> a >> b;
if(!zero_index) a--, b--;
G[a].push_back(b);
if(!directed) G[b].push_back(a);
}
}
template <typename T>
long long binary_search(long long ok, long long ng, T check){
while(abs(ok - ng) > 1){
long long mid = (ok + ng) / 2;
if(check(mid)) ok = mid;
else ng = mid;
}
return ok;
}
template <typename T>
long double binary_search_real(long double ok, long double ng, T check, int iter = 100){
for(int i = 0; i < iter; ++i){
long double mid = (ok + ng) / 2;
if(check(mid)) ok = mid;
else ng = mid;
}
return ok;
}
long long trisum(long long a, long long b){
if(a > b) return 0;
long long res = ((b - a + 1) * (a + b)) / 2;
return res;
}
template <typename T>
T intpow(T x, int n){
T ret = 1;
while(n > 0) {
if(n & 1) (ret *= x);
(x *= x);
n >>= 1;
}
return ret;
}
template <typename T>
T getDivision(T a, T b){
if(b == 0) return -1;
if(a >= 0 && b > 0){
return a / b;
} else if(a < 0 && b > 0){
return a / b - (a % b != 0);
} else if(a >= 0 && b < 0){
return a / b;
} else{
return a / b + (a % b != 0);
}
}
template <typename T>
T getReminder(T a, T b){
if(b == 0) return -1;
if(a >= 0 && b > 0){
return a % b;
} else if(a < 0 && b > 0){
return ((a % b) + b) % b;
} else if(a >= 0 && b < 0){
return a % b;
} else{
return (abs(b) - abs(a % b)) % b;
}
}
template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; ((cout << ' ' << b), ...); cout << '\n'; }
void fout(){ cout << endl; }
template<class T, class... Ts> void fout(const T &a, const Ts&... b){ cout << a; ((cout << ' ' << b), ...); cout << endl; }
void debug(){ cerr << '\n'; }
template<class T, class... Ts> void debug(const T &a, const Ts&... b){ cerr << a; ((cout << ' ' << b), ...); cerr << '\n'; }
struct SCC{
int siz;
std::vector<std::vector<int>> G, G_reverse, G_compress;
std::vector<bool> check;
std::vector<int> memo, id;
std::vector<int> s;
std::vector<std::vector<int>> result;
SCC(const int N) : siz(N), G(N), G_reverse(N), check(N), id(N){ }
void add_edge(int u, int v){
assert(0 <= u && u < siz);
assert(0 <= v && v < siz);
G[u].emplace_back(v);
}
void build(){
for(int i = 0; i < siz; ++i){
for(const auto &x : G[i]){
G_reverse[x].emplace_back(i);
}
}
for(int i = 0; i < siz; ++i){
if(!check[i]){
dfs(G, i);
}
}
reverse(memo.begin(), memo.end());
for(int i = 0; i < siz; ++i) check[i] = false;
for(const auto &x : memo){
if(!check[x]){
s = {};
dfs2(G_reverse, x);
for(const auto &y : s){
id[y] = (int) result.size();
}
result.emplace_back(s);
}
}
G_compress.resize(result.size());
for(int i = 0; i < siz; ++i){
for(const auto &x : G[i]){
if(id[i] != id[x]){
G_compress[id[i]].emplace_back(id[x]);
}
}
}
}
void dfs(const std::vector<std::vector<int>> &G, int curr){
check[curr] = true;
for(const auto &x : G[curr]){
if(check[x]){
continue;
}
dfs(G, x);
}
memo.emplace_back(curr);
}
void dfs2(const std::vector<std::vector<int>> &G, int curr){
s.emplace_back(curr);
check[curr] = true;
for(const auto &x : G[curr]){
if(check[x]){
continue;
}
dfs2(G, x);
}
}
std::vector<std::vector<int>> get() const {
return result;
}
std::vector<std::vector<int>> getCompressed() const {
return G_compress;
}
int getId(int x) const {
return id[x];
}
};
ll T;
void input(){
in(T);
}
void solve(){
ll n, m, k; in(n, m, k);
SCC scc(n);
rep(i, m){
ll u, v; in(u, v);
u--, v--;
scc.add_edge(u, v);
}
scc.build();
vector<vi> G = scc.getCompressed();
ll len = G.size();
string ans = "Yes";
ll last = -1;
{
vll visited(len);
auto dfs = [&](auto &self, ll v) -> void {
visited[v] = 1;
if(v != scc.getId(0)){
last = v;
}
for(auto nv : G[v]){
self(self, nv);
break;
}
};
dfs(dfs, scc.getId(0));
if(sum(visited) != len){
ans = "No";
}
}
{
vll is_ok(len), col(n, -1);
vll visited(len);
auto dfs = [&](auto &self, ll v, ll c) -> void{
col[v] = c;
for(auto nv : scc.G[v]){
if(scc.getId(v) != scc.getId(nv)) continue;
if(col[nv] != -1) continue;
self(self, nv, (c + 1) % 2);
}
};
rep(i, n){
if(!visited[scc.getId(i)]){
dfs(dfs, i, 0);
visited[scc.getId(i)] = 1;
}
}
rep(i, n){
for(auto j : scc.G[i]){
if(scc.getId(i) != scc.getId(j)) continue;
if(col[i] == col[j]){
is_ok[scc.getId(i)] = 1;
}
}
}
is_ok[last] = 1;
if(sum(is_ok) != len){
ans = "No";
}
}
out(ans);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
T = 1;
// input();
while(T--) solve();
}