結果
問題 | No.1477 Lamps on Graph |
ユーザー |
|
提出日時 | 2024-04-01 11:51:32 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 159 ms / 2,000 ms |
コード長 | 3,401 bytes |
コンパイル時間 | 4,101 ms |
コンパイル使用メモリ | 272,240 KB |
実行使用メモリ | 18,496 KB |
最終ジャッジ日時 | 2024-09-30 21:46:51 |
合計ジャッジ時間 | 10,255 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 38 |
ソースコード
#include <bits/stdc++.h>#include<atcoder/all>using namespace atcoder;using namespace std;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vvvvll = vector<vvvll>;using vb = vector<bool>;using vvb = vector<vb>;using vvvb = vector<vvb>;using vvvvb = vector<vvvb>;using vvvvvb = vector<vvvvb>;using vd = vector<double>;using vvd = vector<vd>;using vvvd = vector<vvd>;using vvvvd = vector<vvvd>;using vvvvvd = vector<vvvvd>;#define all(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll modPow(long long a, long long n, long long p) {if (n == 0) return 1; // 0乗にも対応する場合if (n == 1) return a % p;if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;long long t = modPow(a, n / 2, p);return (t * t) % p;}ll gcd(ll(a), ll(b)) {if (a == 0)return b;if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}ll sqrtz(ll N) {ll L = 0;ll R = sqrt(N) + 10000;while (abs(R - L) > 1) {ll mid = (R + L) / 2;if (mid * mid <= N)L = mid;else R = mid;}return L;}using mint = modint998244353;using vm = vector<mint>;using vvm = vector<vm>;using vvvm = vector<vvm>;vector<mint> fact, factinv, inv, factK;ll mod = 998244353;void prenCkModp(ll n) {//factK.resize(4*n+5);fact.resize(n + 5);factinv.resize(n + 5);inv.resize(n + 5);fact[0] = fact[1] = 1;factinv[0] = factinv[1] = 1;inv[1] = 1;for (ll i = 2; i < n + 5; i++) {fact[i] = (fact[i - 1] * i);inv[i] = (mod - ((inv[mod % i] * (mod / i))));factinv[i] = (factinv[i - 1] * inv[i]);}//factK[0]=1;//for(ll i=1;i<4*n+5;i++){// factK[i]=factK[i-1]*mint(K-i+1);// //K*(K-1)*...*(K-i+1);//}}mint nCk(ll n, ll k) {if (n < k || k < 0) return 0;return (fact[n] * ((factinv[k] * factinv[n - k])));}//mint nCkK(ll n,ll k){// if(K<n||K-n<k)return 0;// mint res=factK[n+k];// res*=factK[n].inv();// res*=factinv[k];// return res;//}bool DEB = 1;int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll N,M;cin>>N>>M;vll A(N);rep(i,N)cin>>A[i];scc_graph G(N);vvll UU(N);rep(i,M){ll U,V;cin>>U>>V;U--;V--;if(A[U]>A[V])G.add_edge(V,U),UU[V].push_back(U);else if(A[V]>A[U])G.add_edge(U,V),UU[U].push_back(V);}auto V=G.scc();ll K;cin>>K;vll B(N,0);rep(k,K){ll b;cin>>b;B[b-1]=1;}vll AN;for(auto v:V){for(auto m:v){if(B[m]){AN.push_back(m);B[m]=0;for(auto p:UU[m]){B[p]=1-B[p];}}}}ll Z=AN.size();cout<<Z<<endl;rep(i,Z)cout<<AN[i]+1<<endl;}