#873162 (C++17) No.2319 Friends+

提出ソース

結果

問題	No.2319 Friends+
ユーザー	mikam
提出日時	2023-05-27 18:59:57
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	371 ms / 3,000 ms
コード長	4,499 bytes
コンパイル時間	3,335 ms
コンパイル使用メモリ	239,748 KB
実行使用メモリ	101,376 KB
最終ジャッジ日時	2024-06-07 18:39:45
合計ジャッジ時間	16,067 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	206 ms 101,248 KB
testcase_03	AC	194 ms 101,248 KB
testcase_04	AC	198 ms 101,248 KB
testcase_05	AC	202 ms 101,248 KB
testcase_06	AC	199 ms 101,248 KB
testcase_07	AC	371 ms 101,248 KB
testcase_08	AC	362 ms 101,248 KB
testcase_09	AC	356 ms 101,248 KB
testcase_10	AC	358 ms 101,248 KB
testcase_11	AC	359 ms 101,120 KB
testcase_12	AC	3 ms 5,376 KB
testcase_13	AC	3 ms 5,376 KB
testcase_14	AC	3 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	1 ms 5,376 KB
testcase_18	AC	206 ms 101,248 KB
testcase_19	AC	256 ms 101,248 KB
testcase_20	AC	212 ms 101,248 KB
testcase_21	AC	220 ms 101,248 KB
testcase_22	AC	213 ms 101,248 KB
testcase_23	AC	232 ms 101,248 KB
testcase_24	AC	221 ms 101,248 KB
testcase_25	AC	216 ms 101,248 KB
testcase_26	AC	215 ms 101,248 KB
testcase_27	AC	217 ms 101,376 KB
testcase_28	AC	215 ms 101,120 KB
testcase_29	AC	206 ms 101,248 KB
testcase_30	AC	210 ms 101,248 KB
testcase_31	AC	207 ms 101,248 KB
testcase_32	AC	208 ms 101,248 KB
testcase_33	AC	209 ms 101,248 KB
testcase_34	AC	206 ms 101,248 KB
testcase_35	AC	208 ms 101,376 KB
testcase_36	AC	256 ms 101,120 KB
testcase_37	AC	185 ms 101,248 KB
testcase_38	AC	211 ms 101,248 KB
testcase_39	AC	208 ms 101,248 KB
testcase_40	AC	214 ms 101,248 KB
testcase_41	AC	219 ms 101,248 KB
testcase_42	AC	223 ms 101,248 KB
testcase_43	AC	213 ms 101,376 KB
testcase_44	AC	206 ms 101,248 KB
testcase_45	AC	206 ms 101,376 KB
testcase_46	AC	188 ms 101,248 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// #include "atcoder/convolution"
#include "atcoder/dsu"
#include "atcoder/fenwicktree"
#include "atcoder/lazysegtree"
#include "atcoder/math"
#include "atcoder/maxflow"
#include "atcoder/mincostflow"
#include "atcoder/modint"
#include "atcoder/scc"
#include "atcoder/segtree"
#include "atcoder/string"
#include "atcoder/twosat"
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
// using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> void print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> void print(T& a){cout << a<< '\n';}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
void yesno(bool ok,string y="Yes",string n="No"){ print(ok?y:n);}
void YESNO(bool ok,string y="YES",string n="NO"){ print(ok?y:n);}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
//using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n,m);
    vi p(n);
    rep(i,n)cin>>p[i],--p[i];
    vector<bitset<20000>> friends(n);
    vector<bitset<20000>> world(n);
    rep(i,m){
        INT(a,b);
        --a;--b;
        friends[a][b] = friends[b][a] = 1;
    }
    rep(i,n)world[p[i]][i] = 1;
    INT(q);
    while(q--){
        INT(x,y);
        --x;--y;
        bool ok = false;
        if(p[x]!=p[y] && (friends[x]&world[p[y]]).count()){
            world[p[x]][x] = 0;
            p[x] = p[y];
            world[p[x]][x] = 1;
            ok = true;
        }
        yesno(ok);
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード