#include <bits/stdc++.h>
#define rf(x) (x)=0;while(*p<48)p++;while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);
//#define rf(x) (x)=0;while(*p<48)im=*p=='-';while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);if(im)(x)=-(x);
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define cb(x) (x)=(!(x))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define INFST (0x7f7f7f7f)
#define INFLLST (0x7f7f7f7f7f7f7f7fll)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
typedef complex<ld> base;
const ld EPS = (ld)1e-7;
const ld PI = acos(0) * 2;
bool isZero(const ld& x) { return abs(x) <= EPS; }
int sign(const ld& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
ll gcd(ll a, ll b) { for(;b;a%=b,swap(a,b)){} return abs(a); }
pll operator + (const pll& a, const pll& b) { return pll(a.first+b.first, a.second+b.second); }
pll operator - (const pll& a, const pll& b) { return pll(a.first-b.first, a.second-b.second); }
pll operator * (const pll& a, const ll& b) { return pll(a.first*b, a.second*b); }
ll operator * (const pll& a, const pll& b) { return a.first*b.second - b.first*a.second; }
ll ccw(const pll& a, const pll& b, const pll& c) { return a*b + b*c + c*a; }
void fg(vector<int> G[], int a, int b) { G[a].pb(b); G[b].pb(a); }
void fg(vector<pii> G[], int a, int b, int c) { G[a].pb({b, c}); G[b].pb({a, c}); }
const int MAXN = 300005;
const int MAXM = 300005;
const int MAXK = 1000005;
bool F[1010][1010];
vector<int> VA, VB;
bitset<MAXN> isA, isB, isD;
int D[MAXN];
int B[MAXK], C[MAXK];
int A[MAXM];
bitset<MAXN> Ans;
vector<int> AnsV;
int N, M, K, Q, An;
bool check(int a, int b)
{
if(F[a][b]) return 1;
if(isD[a] || isD[b]) return 1;
return 0;
}
int main() {
scanf("%d%d%d", &N, &M, &K);
for(int i = 1; i <= M; i++) scanf("%d", &A[i]);
for(int i = 1; i <= K; i++) scanf("%d%d", &B[i], &C[i]);
for(scanf("%d", &Q); Q--;) {
int x; char str[10];
scanf(" L + %d = %s", &x, str);
if('B' == str[0]) VA.eb(x);
else VB.eb(x);
}
for(int i = 1; i <= M; i++) isD[A[i]] = true;
for(int i = 1; i <= K; i++){
F[B[i]][C[i]] = 1;
F[C[i]][B[i]] = 1;
}
for(int i = 1; i <= N; i++){
int f = 1;
for(int &t: VA) if(!check(i, t)) f = 0;
for(int &t: VB) if(check(i, t)) f = 0;
if(f) AnsV.eb(i);
}
printf("%d\n", sz(AnsV));
for(int v : AnsV) printf("%d ", v);
puts("");
return 0;
}
Compilation message
chocolate.cpp: In function 'int main()':
chocolate.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &N, &M, &K);
~~~~~^~~~~~~~~~~~~~~~~~~~~~
chocolate.cpp:71:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(int i = 1; i <= M; i++) scanf("%d", &A[i]);
~~~~~^~~~~~~~~~~~~
chocolate.cpp:72:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(int i = 1; i <= K; i++) scanf("%d%d", &B[i], &C[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~~
chocolate.cpp:73:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(scanf("%d", &Q); Q--;) {
~~~~~^~~~~~~~~~
chocolate.cpp:75:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf(" L + %d = %s", &x, str);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
488 KB |
Output is correct |
| 3 |
Correct |
5 ms |
1584 KB |
Output is correct |
| 4 |
Correct |
89 ms |
3944 KB |
Output is correct |
| 5 |
Correct |
5 ms |
3944 KB |
Output is correct |
| 6 |
Correct |
4 ms |
3944 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
299 ms |
16504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
488 KB |
Output is correct |
| 3 |
Correct |
5 ms |
1584 KB |
Output is correct |
| 4 |
Correct |
89 ms |
3944 KB |
Output is correct |
| 5 |
Correct |
5 ms |
3944 KB |
Output is correct |
| 6 |
Correct |
4 ms |
3944 KB |
Output is correct |
| 7 |
Runtime error |
299 ms |
16504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 8 |
Halted |
0 ms |
0 KB |
- |
