# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72478 | 신딩없는 신딩팀 (#118) | Chocolate Cookie Machine (FXCUP3_chocolate) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int dng[300005],bm[300005],ok[300005],vis[300005];
vector<int>edge[300005];
int N,M,K,E;
int main(){
scanf("%d%d%d",&N,&M,&K);
for(int i=0,x;i<M;i++){
scanf("%d",&x);
dng[x]=1;
edge[x].push(x);
}
for(int i=0,x,y;i<K;i++){
scanf("%d%d",&x,&y);
edge[x].push_back(y);
edge[y].push_back(x);
}
scanf("%d",&E);
int flag=1;
for(int i=0;i<E;i++){
char z[10];
int x;
scanf("%s %s %d %s %s",z,z,&x,z,z);
if(vis[x])continue;
vis[x]=1;
string str=z;
if(str=="OK"){
flag=0;
for(auto j:edge[x])ok[j]=1;
continue;
}
if(dng[x])continue;
for(auto j:edge[x])bm[j]=1;
}
vector<int>ans;
for(int i=1;i<=N;i++){
if((flag and dng[i]) or (bm[i] and !ok[i]))ans.push_back(i);
}
printf("%d\n",ans.size());
for(auto i:ans)printf("%d ",i);
return 0;
}