Submission #1173613

#TimeUsernameProblemLanguageResultExecution timeMemory
1173613javkhlantogsGeppetto (COCI15_geppetto)C++20
80 / 80
21 ms328 KiB
#include<bits/stdc++.h> #define ll long long using namespace std; vector<ll> a; set<pair<ll,ll>> st; ll ans=0,n; void dfs(ll u){ a.push_back(u); for(ll i=u+1 ; i<=n ; i++){ bool check=true; for(auto v:a){ if(st.count({v,i})==1) check=false; } if(check){ ans++; dfs(i); } } a.pop_back(); } int main(){ ll m,i,j,a,b,k; cin>>n>>m; for(i=0 ; i<m ; i++){ cin>>a>>b; st.insert({a,b}); st.insert({b,a}); } for(i=1 ; i<=n ; i++){ dfs(i); } cout<<ans+n+1; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...