結果
問題 | No.2346 Replace!! |
ユーザー | fastmath |
提出日時 | 2023-06-09 22:29:49 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,054 bytes |
コンパイル時間 | 1,842 ms |
コンパイル使用メモリ | 143,492 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2025-01-02 03:46:49 |
合計ジャッジ時間 | 4,071 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 6 ms
6,820 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 3 ms
6,816 KB |
testcase_14 | AC | 2 ms
6,816 KB |
testcase_15 | AC | 3 ms
6,820 KB |
testcase_16 | AC | 3 ms
6,816 KB |
testcase_17 | AC | 3 ms
6,820 KB |
testcase_18 | AC | 3 ms
6,820 KB |
testcase_19 | AC | 3 ms
6,816 KB |
testcase_20 | AC | 3 ms
6,816 KB |
testcase_21 | AC | 2 ms
6,820 KB |
testcase_22 | AC | 3 ms
6,824 KB |
testcase_23 | AC | 3 ms
6,816 KB |
testcase_24 | AC | 2 ms
6,820 KB |
testcase_25 | AC | 4 ms
6,816 KB |
testcase_26 | AC | 3 ms
6,816 KB |
testcase_27 | AC | 3 ms
6,816 KB |
testcase_28 | AC | 1 ms
6,820 KB |
testcase_29 | AC | 3 ms
6,816 KB |
testcase_30 | AC | 2 ms
6,816 KB |
testcase_31 | AC | 3 ms
6,820 KB |
testcase_32 | AC | 3 ms
6,820 KB |
testcase_33 | AC | 3 ms
6,820 KB |
testcase_34 | AC | 3 ms
6,816 KB |
testcase_35 | AC | 3 ms
6,816 KB |
testcase_36 | AC | 3 ms
6,816 KB |
testcase_37 | AC | 3 ms
6,824 KB |
testcase_38 | AC | 3 ms
6,816 KB |
testcase_39 | AC | 3 ms
6,820 KB |
testcase_40 | AC | 3 ms
6,820 KB |
testcase_41 | AC | 3 ms
6,816 KB |
testcase_42 | AC | 3 ms
6,816 KB |
testcase_43 | AC | 3 ms
6,816 KB |
testcase_44 | AC | 3 ms
6,820 KB |
testcase_45 | AC | 3 ms
6,816 KB |
testcase_46 | AC | 3 ms
6,816 KB |
testcase_47 | AC | 3 ms
6,816 KB |
testcase_48 | AC | 3 ms
6,820 KB |
testcase_49 | AC | 3 ms
6,816 KB |
testcase_50 | AC | 3 ms
6,820 KB |
testcase_51 | AC | 3 ms
6,820 KB |
testcase_52 | AC | 2 ms
6,820 KB |
testcase_53 | AC | 2 ms
6,820 KB |
testcase_54 | AC | 3 ms
6,816 KB |
testcase_55 | AC | 3 ms
6,820 KB |
testcase_56 | AC | 3 ms
6,816 KB |
testcase_57 | AC | 3 ms
6,820 KB |
testcase_58 | AC | 3 ms
6,816 KB |
testcase_59 | AC | 3 ms
6,820 KB |
testcase_60 | AC | 3 ms
6,816 KB |
testcase_61 | AC | 3 ms
6,820 KB |
testcase_62 | AC | 3 ms
6,816 KB |
testcase_63 | AC | 3 ms
6,820 KB |
testcase_64 | AC | 3 ms
6,820 KB |
testcase_65 | AC | 3 ms
6,816 KB |
testcase_66 | AC | 4 ms
6,820 KB |
testcase_67 | AC | 3 ms
6,816 KB |
testcase_68 | AC | 3 ms
6,816 KB |
testcase_69 | AC | 3 ms
6,816 KB |
testcase_70 | AC | 3 ms
6,820 KB |
testcase_71 | AC | 3 ms
6,816 KB |
testcase_72 | AC | 3 ms
6,820 KB |
testcase_73 | AC | 3 ms
6,816 KB |
ソースコード
#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <cmath>#include <vector>#include <set>#include <map>#include <unordered_set>#include <unordered_map>#include <queue>#include <ctime>#include <cassert>#include <complex>#include <string>#include <cstring>#include <chrono>#include <random>#include <bitset>#include <fstream>#include <array>#include <functional>#include <stack>#include <memory>using namespace std;#define int long long#define ii pair <int, int>#define app push_back#define all(a) a.begin(), a.end()#define bp __builtin_popcountll#define ll long long#define mp make_pair#define x first#define y second#define Time (double)clock()/CLOCKS_PER_SEC#define munq(a) sort(all(a)); a.resize(unique(all(a))-a.begin())#ifdef LOCAL#define debug(x) std::cerr << #x << ": " << x << '\n';#define debug2(x, y) std::cerr << #x << ", " << #y << ": " << x << ", " << y << '\n';#define debug3(x, y, z) std::cerr << #x << ", " << #y << ", " << #z << ": " << x << ", " << y << ", " << z << '\n';#else#define debug(x)#define debug2(x, y)#define debug3(x, y, z)#endif#define FORI(i,a,b) for (int i = (a); i < (b); ++i)#define FOR(i,a) FORI(i,0,a)#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)#define ROF(i,a) ROFI(i,0,a)#define rep(a) FOR(_,a)#define each(a,x) for (auto& a: x)#define FORN(i, n) FORI(i, 1, n + 1)using vi = vector<int>;template <typename T>std::istream& operator >>(std::istream& input, std::pair <T, T> & data){input >> data.x >> data.y;return input;}template <typename T>std::istream& operator >>(std::istream& input, std::vector<T>& data){for (T& x : data)input >> x;return input;}template <typename T>std::ostream& operator <<(std::ostream& output, const pair <T, T> & data){output << "(" << data.x << "," << data.y << ")";return output;}template <typename T>std::ostream& operator <<(std::ostream& output, const std::vector<T>& data){for (const T& x : data)output << x << " ";return output;}ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded upll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded downll math_mod(ll a, ll b) { return a - b * div_down(a, b); }#define tcT template<class T#define tcTU tcT, class UtcT> using V = vector<T>;tcT> bool ckmin(T& a, const T& b) {return b < a ? a = b, 1 : 0;} // set a = min(a,b)tcT> bool ckmax(T& a, const T& b) {return a < b ? a = b, 1 : 0;}tcT> vector <T> presum(vector <T> &a) {vector <T> p(a.size() + 1);FOR (i, a.size()) {p[i + 1] = p[i] + a[i];}return p;}tcT> vector <T> sufsum(vector <T> &a) {vector <T> p(a.size() + 1);for (int i = (int)a.size() - 1; i >= 0; --i) {p[i] = p[i + 1] + a[i];}return p;}ll gcd(ll a, ll b) {while (b) {tie(a, b) = mp(b, a % b);}return a;}int Bit(int mask, int bit) { return (mask >> bit) & 1; }signed main() {#ifdef LOCAL#else#define endl '\n'ios_base::sync_with_stdio(0); cin.tie(0);#endifauto solve = [&] () {int n;cin >> n;vi a(n), b(n);cin >> a >> b;FOR (i, n) {a[i]--;b[i]--;}auto calc = [&] (vi &a, vi &cyc, vi &f) {vi onc(n, 1);vi in(n);FOR (i, n) {in[a[i]]++;}queue <int> q;FOR (i, n) {if (in[i]==0) {q.push(i);}}vi ord;while (q.size()) {int u = q.front(); q.pop();ord.app(u);onc[u]=0;in[a[u]]--;if (in[a[u]]==0) {q.push(a[u]);}}debug(onc);int p = 0;FOR (i, n) {if (onc[i] && cyc[i]==-1) {int u=i;do {debug(u);cyc[u] = p;u = a[u];} while (u != i);p++;}}reverse(all(ord));each (u, ord) {f[u] = f[a[u]];}debug(cyc);};vi ca(n, -1), cb(n, -1), fa(n, -1), fb(n, -1);calc(a, ca, fa);calc(b, cb, fb);auto go = [&] (int start, vi &a) {int u = start;vi ans;do {ans.app(u);u = a[u];} while (u != start);return ans;};string ans = "Yes";vi ua(n), ub(n);FOR (i, n) {debug2(i, cb[i]);if (cb[i]!=-1 && !ub[i]) {if (ca[i]==-1 || ua[i]) {debug(i);ans = "No";}else {vi x = go(i, b);vi y = go(i, a);FOR (j, n) {if ((fa[j]==ca[i]) ^ (fb[j]==cb[i])) {ans = "No";}}each (e, x) {ub[e] = 1;}each (e, y) {ua[e] = 1;}int ptr = 0;each (e, x) {while (ptr < y.size() && y[ptr]!=e) {ptr++;}if (ptr == y.size()) {debug2(x,y);ans = "No";}ptr++;}}}}cout << ans << endl;};int t;cin >> t;rep (t) {solve();}}