Submission #1104930


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int MAXN = (1<<8)+5;
long long d[MAXN][8];
int n,m;
vector<int>E[10];
int mp[10][10];
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        a--,b--;
        mp[a][b]=1;
        mp[b][a]=1;
    }
    d[1][0]=1;
    for(int i=1;i<(1<<n);i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<n;k++){
                bool ok = (i&(1<<k));
                if(mp[j][k]&&!ok){
                    int next = i|(1<<k);
                    d[next][k] = d[next][k] + d[i][j];
                }
            }
        }
    }
    long long sum = 0;
    for(int i=0;i<n;i++){
        sum+=d[(1<<n)-1][i];
    }
    cout<<sum<<endl;
}

Submission Info

Submission Time
Task C - One-stroke Path
User qscqesze
Language C++14 (GCC 5.4.1)
Score 300
Code Size 779 Byte
Status AC
Exec Time 4 ms
Memory 256 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
./Main.cpp:13:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt
Case Name Status Exec Time Memory
sample_01.txt AC 4 ms 256 KiB
sample_02.txt AC 1 ms 256 KiB
subtask_1_01.txt AC 1 ms 256 KiB
subtask_1_02.txt AC 1 ms 256 KiB
subtask_1_03.txt AC 1 ms 256 KiB
subtask_1_04.txt AC 1 ms 256 KiB
subtask_1_05.txt AC 1 ms 256 KiB
subtask_1_06.txt AC 1 ms 256 KiB
subtask_1_07.txt AC 1 ms 256 KiB
subtask_1_08.txt AC 1 ms 256 KiB
subtask_1_09.txt AC 1 ms 256 KiB
subtask_1_10.txt AC 1 ms 256 KiB
subtask_1_11.txt AC 1 ms 256 KiB
subtask_1_12.txt AC 1 ms 256 KiB
subtask_1_13.txt AC 1 ms 256 KiB