結果
| 問題 | No.2316 Freight Train |
| ユーザー |
👑  rin204
|
| 提出日時 | 2023-05-27 00:01:16 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 76 ms / 2,000 ms |
| コード長 | 9,049 bytes |
| コンパイル時間 | 3,346 ms |
| コンパイル使用メモリ | 253,672 KB |
| 実行使用メモリ | 4,864 KB |
| 最終ジャッジ日時 | 2023-08-26 14:11:21 |
| 合計ジャッジ時間 | 6,926 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge15 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,380 KB |
| testcase_01 | AC | 2 ms
4,376 KB |
| testcase_02 | AC | 1 ms
4,376 KB |
| testcase_03 | AC | 73 ms
4,636 KB |
| testcase_04 | AC | 36 ms
4,376 KB |
| testcase_05 | AC | 29 ms
4,376 KB |
| testcase_06 | AC | 8 ms
4,380 KB |
| testcase_07 | AC | 49 ms
4,380 KB |
| testcase_08 | AC | 49 ms
4,696 KB |
| testcase_09 | AC | 51 ms
4,376 KB |
| testcase_10 | AC | 51 ms
4,380 KB |
| testcase_11 | AC | 54 ms
4,412 KB |
| testcase_12 | AC | 62 ms
4,380 KB |
| testcase_13 | AC | 76 ms
4,628 KB |
| testcase_14 | AC | 75 ms
4,864 KB |
| testcase_15 | AC | 75 ms
4,616 KB |
| testcase_16 | AC | 75 ms
4,580 KB |
| testcase_17 | AC | 75 ms
4,592 KB |
| testcase_18 | AC | 76 ms
4,572 KB |
| testcase_19 | AC | 75 ms
4,608 KB |
| testcase_20 | AC | 74 ms
4,680 KB |
| testcase_21 | AC | 75 ms
4,688 KB |
| testcase_22 | AC | 76 ms
4,680 KB |
| testcase_23 | AC | 59 ms
4,636 KB |
| testcase_24 | AC | 66 ms
4,628 KB |
| testcase_25 | AC | 61 ms
4,584 KB |
| testcase_26 | AC | 57 ms
4,572 KB |
| testcase_27 | AC | 32 ms
4,376 KB |
| testcase_28 | AC | 2 ms
4,376 KB |
ソースコード
// start A.cpp
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
#ifndef RIN__LOCAL
#define endl "\n"
#endif
#define spa ' '
#define len(A) A.size()
#define all(A) begin(A), end(A)
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)
vector<char> stoc(string &S) {
int n = S.size();
vector<char> ret(n);
for (int i = 0; i < n; i++) ret[i] = S[i];
return ret;
}
#define INT(...) \
int __VA_ARGS__; \
inp(__VA_ARGS__);
#define LL(...) \
ll __VA_ARGS__; \
inp(__VA_ARGS__);
#define STRING(...) \
string __VA_ARGS__; \
inp(__VA_ARGS__);
#define CHAR(...) \
char __VA_ARGS__; \
inp(__VA_ARGS__);
#define VEC(T, A, n) \
vector<T> A(n); \
inp(A);
#define VVEC(T, A, n, m) \
vector<vector<T>> A(n, vector<T>(m)); \
inp(A);
const ll MOD1 = 1000000007;
const ll MOD9 = 998244353;
template <class T>
auto min(const T &a) {
return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
auto b = clamp(a, l, r);
return (a != b ? a = b, 1 : 0);
}
void FLUSH() {
cout << flush;
}
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(Tail)) cout << spa;
print(forward<Tail>(tail)...);
}
template <typename T>
void print(vector<T> &A) {
int n = A.size();
for (int i = 0; i < n; i++) {
cout << A[i];
if (i != n - 1) cout << ' ';
}
cout << endl;
}
template <typename T>
void print(vector<vector<T>> &A) {
for (auto &row : A) print(row);
}
template <typename T, typename S>
void print(pair<T, S> &A) {
cout << A.first << spa << A.second << endl;
}
template <typename T, typename S>
void print(vector<pair<T, S>> &A) {
for (auto &row : A) print(row);
}
template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
int n = A.size();
for (int i = 0; i < n; i++) {
cout << A[i];
if (i != n - 1) cout << sep;
}
cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
cout << A << end;
}
template <typename T>
void priend(T A) {
priend(A, spa);
}
template <class... T>
void inp(T &... a) {
(cin >> ... >> a);
}
template <typename T>
void inp(vector<T> &A) {
for (auto &a : A) cin >> a;
}
template <typename T>
void inp(vector<vector<T>> &A) {
for (auto &row : A) inp(row);
}
template <typename T, typename S>
void inp(pair<T, S> &A) {
inp(A.first, A.second);
}
template <typename T, typename S>
void inp(vector<pair<T, S>> &A) {
for (auto &row : A) inp(row.first, row.second);
}
template <typename T>
T sum(vector<T> &A) {
T tot = 0;
for (auto a : A) tot += a;
return tot;
}
template <typename T>
vector<T> compression(vector<T> X) {
sort(all(X));
X.erase(unique(all(X)), X.end());
return X;
}
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
vector<vector<int>> edges(n, vector<int>());
for (int i = 0; i < m; i++) {
INT(u, v);
u -= indexed;
v -= indexed;
edges[u].push_back(v);
if (!direct) edges[v].push_back(u);
}
return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
return read_edges(n, n - 1, false, indexed);
}
template <typename T>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
for (int i = 0; i < m; i++) {
INT(u, v);
T w;
inp(w);
u -= indexed;
v -= indexed;
edges[u].push_back({v, w});
if (!direct) edges[v].push_back({u, w});
}
return edges;
}
template <typename T>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
return read_wedges<T>(n, n - 1, false, indexed);
}
bool yes(bool f = true) {
cout << (f ? "yes" : "no") << endl;
return f;
}
bool Yes(bool f = true) {
cout << (f ? "Yes" : "No") << endl;
return f;
}
bool YES(bool f = true) {
cout << (f ? "YES" : "NO") << endl;
return f;
}
bool no(bool f = false) {
cout << (!f ? "yes" : "no") << endl;
return f;
}
bool No(bool f = false) {
cout << (!f ? "Yes" : "No") << endl;
return f;
}
bool NO(bool f = false) {
cout << (!f ? "YES" : "NO") << endl;
return f;
}
// start data_structure/UnionFind.hpp
struct UnionFind {
int n;
vector<int> par;
int group;
UnionFind() = default;
UnionFind(int n) : n(n) {
par.assign(n, -1);
group = n;
}
int find(int x) {
if (par[x] < 0) return x;
par[x] = find(par[x]);
return par[x];
}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
group--;
par[x] += par[y];
par[y] = x;
return true;
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
return -par[find(x)];
}
vector<int> roots() {
vector<int> ret;
for (int i = 0; i < n; i++) {
if (i == find(i)) ret.push_back(i);
}
return ret;
}
};
// end data_structure/UnionFind.hpp
// restart A.cpp
void solve() {
INT(n, Q);
VEC(int, P, n);
UnionFind UF(n);
fori(i, n) {
if (P[i] != -1) UF.unite(i, P[i] - 1);
}
fori(Q) {
INT(a, b);
Yes(UF.same(a - 1, b - 1));
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
// cout << fixed << setprecision(12);
int t;
t = 1;
// cin >> t;
while (t--) solve();
return 0;
}
// end A.cpp