Submission #2710326
Source Code Expand
#include <cstdio> #include <cstring> #include <string> #include <iostream> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <algorithm> using namespace std; typedef long long int ll; int main() { int n, m; scanf("%d %d", &n, &m); vector<int> v[16]; for(int i=0; i<m; i++){ int x, y; scanf("%d %d", &x, &y); x--; y--; v[x].push_back(y); } ll dp[1<<16]={}; dp[0]=1; for(int k=1; k<(1<<n); k++){ for(int i=0; i<n; i++){ if(((k>>i)&1)==0) continue; bool e=0; for(int j=0; j<v[i].size(); j++){ int y=v[i][j]; if(((k>>y)&1)==1){ e=1; break; } } if(e==0) dp[k]+=dp[k&(~(1<<i))]; } } printf("%lld\n", dp[(1<<n)-1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 徒競走 |
User | chocorusk |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 824 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 768 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:17:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &n, &m); ^ ./Main.cpp:21:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &x, &y); ^
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
Subtask1 | 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 768 KB |
0_01.txt | AC | 1 ms | 768 KB |
0_02.txt | AC | 5 ms | 768 KB |
1_00.txt | AC | 1 ms | 768 KB |
1_01.txt | AC | 1 ms | 768 KB |
1_02.txt | AC | 1 ms | 768 KB |
1_03.txt | AC | 1 ms | 768 KB |
1_04.txt | AC | 1 ms | 768 KB |
1_05.txt | AC | 1 ms | 768 KB |
1_06.txt | AC | 1 ms | 768 KB |
1_07.txt | AC | 1 ms | 768 KB |
1_08.txt | AC | 1 ms | 768 KB |
1_09.txt | AC | 1 ms | 768 KB |
1_10.txt | AC | 1 ms | 768 KB |
1_11.txt | AC | 1 ms | 768 KB |
1_12.txt | AC | 1 ms | 768 KB |
2_00.txt | AC | 5 ms | 768 KB |
2_01.txt | AC | 6 ms | 768 KB |
2_02.txt | AC | 6 ms | 768 KB |
2_03.txt | AC | 6 ms | 768 KB |
2_04.txt | AC | 4 ms | 768 KB |
2_05.txt | AC | 4 ms | 768 KB |
2_06.txt | AC | 4 ms | 768 KB |
2_07.txt | AC | 4 ms | 768 KB |
2_08.txt | AC | 6 ms | 768 KB |
2_09.txt | AC | 6 ms | 768 KB |
2_10.txt | AC | 7 ms | 768 KB |
2_11.txt | AC | 7 ms | 768 KB |
2_12.txt | AC | 5 ms | 768 KB |
2_13.txt | AC | 6 ms | 768 KB |
2_14.txt | AC | 6 ms | 768 KB |
2_15.txt | AC | 6 ms | 768 KB |