結果
問題 | No.1779 Magical Swap |
ユーザー | riano |
提出日時 | 2021-12-18 23:18:03 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 39 ms / 2,000 ms |
コード長 | 4,701 bytes |
コンパイル時間 | 1,938 ms |
コンパイル使用メモリ | 176,052 KB |
実行使用メモリ | 6,960 KB |
最終ジャッジ日時 | 2024-09-15 14:05:24 |
合計ジャッジ時間 | 3,045 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
5,248 KB |
testcase_01 | AC | 3 ms
5,376 KB |
testcase_02 | AC | 5 ms
5,376 KB |
testcase_03 | AC | 4 ms
5,376 KB |
testcase_04 | AC | 38 ms
6,724 KB |
testcase_05 | AC | 18 ms
5,376 KB |
testcase_06 | AC | 20 ms
5,376 KB |
testcase_07 | AC | 33 ms
6,536 KB |
testcase_08 | AC | 3 ms
5,376 KB |
testcase_09 | AC | 11 ms
5,376 KB |
testcase_10 | AC | 39 ms
6,804 KB |
testcase_11 | AC | 21 ms
5,488 KB |
testcase_12 | AC | 9 ms
5,376 KB |
testcase_13 | AC | 31 ms
6,488 KB |
testcase_14 | AC | 37 ms
6,960 KB |
testcase_15 | AC | 28 ms
5,376 KB |
testcase_16 | AC | 36 ms
6,960 KB |
testcase_17 | AC | 31 ms
5,376 KB |
testcase_18 | AC | 3 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#define ll long long#define rep(i,n) for(int i=0;i<n;i++)#define rrep(i,n) for(int i=n-1;i>=0;i--)#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)#define vll(n,i) vector<long long>(n,i)#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))#define all(v) v.begin(),v.end()#define chmin(k,m) k = min(k,m)#define chmax(k,m) k = max(k,m)#define Pr pair<ll,ll>#define Tp tuple<ll,ll,ll>#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)using Graph = vector<vector<Pr>>;const ll mod = 998244353;template<uint64_t mod>struct modint{uint64_t val;constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}constexpr modint operator-() const noexcept{return modint(*this)=mod-val;}constexpr modint operator+(const modint rhs) const noexcept{return modint(*this)+=rhs;}constexpr modint operator-(const modint rhs) const noexcept{return modint(*this)-=rhs;}constexpr modint operator*(const modint rhs) const noexcept{return modint(*this)*=rhs;}constexpr modint operator/(const modint rhs) const noexcept{return modint(*this)/=rhs;}constexpr modint &operator+=(const modint rhs) noexcept{val+=rhs.val;val-=((val>=mod)?mod:0);return (*this);}constexpr modint &operator-=(const modint rhs) noexcept{val+=((val<rhs.val)?mod:0);val-=rhs.val;return (*this);}constexpr modint &operator*=(const modint rhs) noexcept{val=val*rhs.val%mod;return (*this);}constexpr modint &operator/=(modint rhs) noexcept{uint64_t ex=mod-2;modint now=1;while(ex){now*=((ex&1)?rhs:1);rhs*=rhs,ex>>=1;}return (*this)*=now;}modint & operator++(){val++;if (val == mod) val = 0;return *this;}modint operator++(int){modint<mod> res = *this;++*this;return res;}constexpr bool operator==(const modint rhs) noexcept{return val==rhs.val;}constexpr bool operator!=(const modint rhs) noexcept{return val!=rhs.val;}friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{return os<<(x.val);}friend constexpr istream &operator>>(istream& is,modint& x) noexcept{uint64_t t;is>>t,x=t;return is;}};typedef modint<mod> mint;mint pw(long long a,long long b,long long m = mod){if(a%m==0) return mint(0);if(b==0) return mint(1);else if(b%2==0){long long x = pw(a,b/2,m).val;return mint(x*x);}else{long long x = pw(a,b-1,m).val;return mint(a*x);}}mint modinv(long long a, long long m = mod) {long long b = m, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;return mint(u);}#define vm(n,i) vector<mint>(n,i)#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))//素数判定// nまでの整数に最小の素因数minfactorを与えるvector<int> min_factor;vector<ll> primes;vector<int> sieve(int n) {vector<int> res(n+1);iota(res.begin(), res.end(), 0);for (int i = 2; i*i <= n; ++i) {if (res[i] < i) continue;for (int j = i*i; j <= n; j += i) {if (res[j] == j) res[j] = i;}}for(int i=2;i<=n;i++){if(res[i]==i){primes.push_back(i);}}return res;}int main() {riano_; //ll ans = 0;ll T; cin >> T;ll n = 100001;//main関数内min_factor = sieve(n); //nまでの素数判定string ans;rep(ii,T){ll N; cin >> N; ans = "Yes";ll a[N],b[N];rep(i,N) cin >> a[i];rep(i,N) cin >> b[i];vector<ll> aa,bb;rep(i,N){if(i==0||min_factor[i+1]*2>N){if(a[i]!=b[i]) ans = "No";}else{aa.push_back(a[i]);bb.push_back(b[i]);}}sort(all(aa)); sort(all(bb));rep(i,aa.size()){if(aa[i]!=bb[i]) ans = "No";}cout << ans << "\n";}//cout << ans << endl;}