# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
579434 | juggernaut | Amusement Park (CEOI19_amusementpark) | C++14 | 167 ms | 19620 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>
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef juggernaut
#define printl(args...) printf(args)
#else
#define printl(args...) 0
#endif
int x[999],y[999];
ll mod=998244353;
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=0;i^m;i++)scanf("%d%d",&x[i],&y[i]);
unordered_set<ll>st;
vector<int>vec(n);
iota(vec.begin(),vec.end(),1);
ll ans=0;
do{
ll tmp=0;
for(int i=0;i^m;i++)if(vec[x[i]-1]<vec[y[i]-1])tmp|=1ll<<i;
if(!st.count(tmp)){
st.insert(tmp);
ans+=__builtin_popcount(tmp);
}
}while(next_permutation(vec.begin(),vec.end()));
ans%=mod;
cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |