Submission #72296

#TimeUsernameProblemLanguageResultExecution timeMemory
72296BBBSNG (#118)Chocolate Cookie Machine (FXCUP3_chocolate)C++17
55 / 100
841 ms33808 KiB
#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; vector<int> G[MAXN]; 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; 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++) fg(G, B[i], C[i]); for(int v : VA) { if(isD[v]) continue; isA[v] = true; } for(int v : VB) { if(!G[v].empty()) continue; isB[v] = true; } for(int i = 1; i <= N; i++) if(isA[i]) { for(int v : G[i]) D[v]++; An++; } for(int i = 1; i <= M; i++) Ans[A[i]] = true; for(int i = 1; i <= N; i++) if(D[i] == An) Ans[i] = true; if(!VB.empty()) { for(int i = 1; i <= M; i++) Ans[A[i]] = false; for(int i = 1; i <= N; i++) if(isB[i]) for(int v : G[i]) Ans[v] = false; } for(int i = 1; i <= N; i++) if(Ans[i]) AnsV.eb(i); if(sz(AnsV) == 0) return 1 / 0; printf("%d\n", sz(AnsV)); for(int v : AnsV) printf("%d ", v); puts(""); return 0; }

Compilation message (stderr)

chocolate.cpp: In function 'int main()':
chocolate.cpp:98:29: warning: division by zero [-Wdiv-by-zero]
  if(sz(AnsV) == 0) return 1 / 0;
                           ~~^~~
chocolate.cpp:63: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:64: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:65: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:66: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:68: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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...