Submission #875844

#TimeUsernameProblemLanguageResultExecution timeMemory
875844Mr_PhNoM (RMI21_nom)C++17
0 / 100
1 ms348 KiB
#include<bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> typedef long long ll; typedef long long int lli; typedef unsigned long long ull; using namespace std; using namespace __gnu_pbds; template<class x> using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>; ll mod=(ll)1e9+7; ll mod1=998244353; ///the defines :) #define endl '\n' #define vi vector<int> #define vll vector<ll> #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i]; #define all(arr) arr.begin(),arr.end() #define allr(arr) arr.rbegin(),arr.rend() #define sz size() #define int long long void preprocess() {} void solve() { int n,m; cin>>n>>m; vi arr; for(int i=1;i<=n;i++){ arr.push_back(i); arr.push_back(n+i); } vector<pair<int,int>>xd(6); int ans=0; do { for(int i=1;i<=n;i++)xd[i]={0,0}; for(int i=0;i<2*n;i++) { int lmao=max(arr[i],arr[i]-n); if(xd[lmao].first) xd[lmao].second=i+1; else xd[lmao].first=i+1; } bool valid=true; for(int i=1;i<=n;i++) if((xd[i].second-xd[i].first)%m==0)valid=false; ans+=valid; }while(next_permutation(all(arr))); cout<<ans%mod<<endl; } signed main() { // freopen("meta_game_input.txt","r",stdin); // freopen("otput.txt","w",stdout); ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); preprocess(); //bla(); int t=1; //cin>>t; while(t--) solve(); }
#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...