제출 #72228

#제출 시각아이디문제언어결과실행 시간메모리
72228IDxTree (#118)초코쿠키 기계 (FXCUP3_chocolate)C++17
55 / 100
931 ms33296 KiB
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; typedef pair<int, bool> pib; typedef long long ll; const int inf=2e9, MX=300010; vector<int> G[MX]; int n, m, k, cnt[MX], e, f; bool boom[MX]; pib in(){ int v; char c; string S; cin>>c>>c>>v>>c>>S; return {v, S=="BOOM"}; } int main(){ ios::sync_with_stdio(0); cin.tie(0); cin>>n>>m>>k; for(int i=1,x ; i<=m; i++) cin>>x, boom[x]=true; for(int i=1; i<=k; i++){ int u,v; cin>>u>>v; G[u].push_back(v); G[v].push_back(u); } cin>>e; for(int i=1; i<=e; i++){ int v; bool b; tie(v,b)=in(); if(boom[v]){ f++; continue; } if(b) for(int x:G[v]) cnt[x]++; else assert(false); } vector<int> ans; for(int i=1; i<=n; i++){ if(boom[i] || cnt[i]==e-f) ans.push_back(i); } cout<<ans.size()<<'\n'; for(int x:ans) cout<<x<<' '; cout<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...