# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339629 | Ahmad_Hasan | Beautiful row (IZhO12_beauty) | C++17 | 0 ms | 364 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;
int n;
int nums[25];
int cnt=0;
vector<vector<int> > dp;
int slv(int msk=0,int lstidx=-1){
if(msk==(1<<n)-1){
return 1;
}
int cnt=0;
if(lstidx!=-1&&dp[msk][lstidx]!=-1)
return dp[msk][lstidx];
for(int i=0;i<n;i++){
if(!(msk&(1<<i))){
if(lstidx==-1){
cnt+=slv(msk|(1<<i),i);
continue;
}
int f=0;
{
int num1=nums[lstidx];
int num2=nums[i];
int cntb2=0;
while(num1||num2){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |