| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 928216 | vjudge1 | Amusement Park (CEOI19_amusementpark) | C++17 | 0 ms | 348 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>
using namespace std;
#define F first
#define S second
#define ll long long
#define maksim gay
#define int ll
#define pb push_back
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define in insert
#define lb lower_bound
#define ub upper_bound
const int MAX=20;
const int inf=1e10;
const int N=2e5;
int n,m;
int d[MAX][MAX];
void solve(){
  cin>>n>>m;
  vector<int> v;
  for(int i=1;i<=n;i++)v.pb(i);
  for(int i=1;i<=m;i++){
    int a,b;
    cin>>a>>b;
    d[a][b]=1;
  }
  int ans=0;
  do{
    for(int i=0;i<n;i++){
      for(int j=0;j<i;j++){
        if(d[v[i]][v[j]])ans++;
      }
    }
  }while(next_permutation(all(v)));
  cout<<ans<<"\n";
}
main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t=1;
  // cin>>t;
  while(t--){
    solve();
  }
}
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... | ||||
