結果

問題 No.1477 Lamps on Graph
ユーザー ningenMeningenMe
提出日時 2021-04-16 20:11:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 185 ms / 2,000 ms
コード長 3,794 bytes
コンパイル時間 2,378 ms
コンパイル使用メモリ 214,688 KB
実行使用メモリ 11,188 KB
最終ジャッジ日時 2023-09-15 20:25:55
合計ジャッジ時間 7,784 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 1 ms
4,376 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 70 ms
7,020 KB
testcase_13 AC 73 ms
6,648 KB
testcase_14 AC 83 ms
7,564 KB
testcase_15 AC 30 ms
4,820 KB
testcase_16 AC 25 ms
5,204 KB
testcase_17 AC 29 ms
4,952 KB
testcase_18 AC 126 ms
8,244 KB
testcase_19 AC 73 ms
7,220 KB
testcase_20 AC 24 ms
4,380 KB
testcase_21 AC 108 ms
7,016 KB
testcase_22 AC 12 ms
4,376 KB
testcase_23 AC 41 ms
5,196 KB
testcase_24 AC 111 ms
8,132 KB
testcase_25 AC 31 ms
4,732 KB
testcase_26 AC 114 ms
8,592 KB
testcase_27 AC 37 ms
5,420 KB
testcase_28 AC 52 ms
6,572 KB
testcase_29 AC 53 ms
5,740 KB
testcase_30 AC 73 ms
5,396 KB
testcase_31 AC 41 ms
5,300 KB
testcase_32 AC 185 ms
11,080 KB
testcase_33 AC 143 ms
11,188 KB
testcase_34 AC 175 ms
11,036 KB
testcase_35 AC 154 ms
10,580 KB
testcase_36 AC 143 ms
10,564 KB
testcase_37 AC 103 ms
10,544 KB
testcase_38 AC 121 ms
10,604 KB
testcase_39 AC 141 ms
10,516 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using int128  = __int128_t;
using int64   = long long;
using int32   = int;
using uint128 = __uint128_t;
using uint64  = unsigned long long;
using uint32  = unsigned int;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr int64 MOD = 1'000'000'000LL + 7; //'
constexpr int64 MOD2 = 998244353;
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

/**
 * @url 
 * @est
 */ 
int main() {
    cin.tie(0);ios::sync_with_stdio(false);
    int N,M; cin >> N >> M;
    vector<int> A(N);
    vector<pair<int,int>> vp(N);
    for(int i=0;i<N;++i) {
        cin >> A[i];
        vp[i] = {A[i],i};
    }
    sort(ALL(vp));
    vector<vector<int>> edges(N);
    for(int i=0;i<M;++i) {
        int u,v; cin >> u >> v;
        u--,v--;
        edges[u].push_back(v);
        edges[v].push_back(u);
    }
    vector<int> flg(N,0);
    int K; cin >> K;
    for(int i=0;i<K;++i) {
        int b; cin >> b;
        b--;
        flg[b] |= 1;
    }
    vector<int> ans;
    for(auto& p:vp) {
        int i = p.second;
        if(!flg[i]) continue;
        flg[i] ^= 0;
        for(int j:edges[i]) {
            if(A[i] < A[j]) flg[j] ^= 1;
        }
        ans.push_back(i+1);
    }
    cout << ans.size() << endl;
    for(int e:ans) cout << e << endl;
    return 0;
}
0