#937930 (C++17) No.2316 Freight Train

• 問題: No.2316 Freight Train
• ユーザー: *yudai25n
• 提出日時: 2023-12-11 18:11:47
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 470 ms / 2,000 ms
• コード長: 1,547 bytes
• コンパイル時間: 4,373 ms
• コンパイル使用メモリ: 264,048 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2023-12-11 18:12:08
• 合計ジャッジ時間: 16,863 ms
• ジャッジサーバーID （参考情報）: judge15 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	447 ms; 6,676 KB
testcase_04	AC	240 ms; 6,676 KB
testcase_05	AC	171 ms; 6,676 KB
testcase_06	AC	56 ms; 6,676 KB
testcase_07	AC	375 ms; 6,676 KB
testcase_08	AC	256 ms; 6,676 KB
testcase_09	AC	332 ms; 6,676 KB
testcase_10	AC	356 ms; 6,676 KB
testcase_11	AC	313 ms; 6,676 KB
testcase_12	AC	381 ms; 6,676 KB
testcase_13	AC	470 ms; 6,676 KB
testcase_14	AC	459 ms; 6,676 KB
testcase_15	AC	454 ms; 6,676 KB
testcase_16	AC	454 ms; 6,676 KB
testcase_17	AC	459 ms; 6,676 KB
testcase_18	AC	457 ms; 6,676 KB
testcase_19	AC	460 ms; 6,676 KB
testcase_20	AC	457 ms; 6,676 KB
testcase_21	AC	465 ms; 6,676 KB
testcase_22	AC	455 ms; 6,676 KB
testcase_23	AC	412 ms; 6,676 KB
testcase_24	AC	444 ms; 6,676 KB
testcase_25	AC	423 ms; 6,676 KB
testcase_26	AC	411 ms; 6,676 KB
testcase_27	AC	317 ms; 6,676 KB
testcase_28	AC	1 ms; 6,676 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using LP = pair<long long,long long>;
using SP = pair<string,string>;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using mint1 = modint1000000007;
using mint9 = modint998244353;
const int INF = 2e9;
const long long LINF = 4e18;
const int di[] = {0,1,0,-1,-1,1,-1,1};
const int dj[] = {1,0,-1,0,1,1,-1,-1};
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
void YesNo (bool ok , const string &s , const string &t) {if(ok) cout << s << endl; else cout << t << endl;} 


//-----def end-----//


int main () {
    int n , q;
    cin >> n >> q;
    dsu g(n);
    rep(i , n) {
        int p;
        cin >> p;
        if(p == -1) continue;
        p--;
        g.merge(i , p);
    }
    rep(i , q) {
        int a , b;
        cin >> a >> b;
        a--; b--;
        if(g.same(a , b)) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
	return 0;
}