Submission #597729

#	Time	Username	Problem	Language	Result	Execution time	Memory
597729		Deepesson	NoM (RMI21_nom)	C++17	0 / 100	0 ms	212 KiB

Main

#include <bits/stdc++.h>
const int MOD = 1e9+7;
void forca_bruta(int N,int M){
    std::vector<int> array;
    for(int i=0;i!=N;++i){
        array.push_back(i);array.push_back(i);
    }
    std::sort(array.begin(),array.end());
    int count=0;
    do{
        for(int i=0;i!=2*N;++i){
            int p = i+M;
            if(p<2*N&&array[p]==array[i]){
                goto fail;
            }
        }
        ++count;
        fail:{}
    }while (std::next_permutation(array.begin(),array.end()));
    for(int i=0;i!=N;++i){
        count=(count*2)%MOD;
    }
    std::cout<<count<<"\n";
}
int main()
{
    int N,M;
    std::cin>>N>>M;
    forca_bruta(N,M);
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 18
• Subtask 5: 0 / 48