제출 #975354

#제출 시각아이디문제언어결과실행 시간메모리
975354vjudge1Pizza (COCI21_pizza)C++17
50 / 50
1 ms600 KiB
#include <iostream> #include <vector> #include <algorithm> #include <cstring> using namespace std; int memo[1000]; bool man(int x,vector <int> a){ if(memo[x]!=-1){ return memo[x]; } else{ if(binary_search(a.begin(),a.end(),x)){ memo[x]=false; return false; } memo[x]=true; return true; } } int main() { memset(memo,-1,sizeof(memo)); int n,m,cnt=0; cin>>n; bool temp; vector <int> a; for(int i=0;i<n;i++){ int t; cin>>t; a.push_back(t); } sort(a.begin(),a.end()); cin>>m; for(int i=0;i<m;i++){ int t; cin>>t; temp=true; for(int j=0;j<t;j++){ int y; cin>>y; if(temp){ temp=man(y,a); } } if(temp){ cnt++; } } cout<<cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...