| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 63057 |
2018-07-31T14:15:36 Z |
Bodo171 |
Paths (BOI18_paths) |
C++14 |
|
246 ms |
30676 KB |
#include <iostream>
#include <fstream>
using namespace std;
const int nmax=100005;
long long dp[32][nmax];
int c[nmax],a[nmax],b[nmax];
int n,m,k,i,j,x,y;
long long ans;
int main()
{
//freopen("data.in","r",stdin);
cin>>n>>m>>k;
for(i=1;i<=n;i++)
{
cin>>c[i];
c[i]--;
}
for(i=1;i<=m;i++)
{
cin>>a[i]>>b[i];
}
for(j=1;j<=n;j++)
dp[(1<<c[j])][j]=1;
for(i=1;i<(1<<k);i++)
{
if((i&(i-1)))
for(j=1;j<=n;j++)
ans+=dp[i][j];
for(j=1;j<=m;j++)
{
x=a[j];y=b[j];
if(((1<<c[x])&i)&&(!((1<<c[y])&i)))
dp[i+(1<<c[y])][y]+=dp[i][x];
if((!((1<<c[x])&i))&&((1<<c[y])&i))
dp[i+(1<<c[x])][x]+=dp[i][y];
}
}
cout<<ans;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
540 KB |
Output is correct |
| 3 |
Correct |
3 ms |
540 KB |
Output is correct |
| 4 |
Correct |
2 ms |
540 KB |
Output is correct |
| 5 |
Correct |
2 ms |
540 KB |
Output is correct |
| 6 |
Correct |
2 ms |
628 KB |
Output is correct |
| 7 |
Correct |
3 ms |
688 KB |
Output is correct |
| 8 |
Correct |
2 ms |
688 KB |
Output is correct |
| 9 |
Correct |
3 ms |
748 KB |
Output is correct |
| 10 |
Correct |
4 ms |
748 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
215 ms |
6756 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
540 KB |
Output is correct |
| 3 |
Correct |
3 ms |
540 KB |
Output is correct |
| 4 |
Correct |
2 ms |
540 KB |
Output is correct |
| 5 |
Correct |
2 ms |
540 KB |
Output is correct |
| 6 |
Correct |
2 ms |
628 KB |
Output is correct |
| 7 |
Correct |
3 ms |
688 KB |
Output is correct |
| 8 |
Correct |
2 ms |
688 KB |
Output is correct |
| 9 |
Correct |
3 ms |
748 KB |
Output is correct |
| 10 |
Correct |
4 ms |
748 KB |
Output is correct |
| 11 |
Runtime error |
215 ms |
6756 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
6756 KB |
Output is correct |
| 2 |
Correct |
99 ms |
6756 KB |
Output is correct |
| 3 |
Correct |
72 ms |
6756 KB |
Output is correct |
| 4 |
Correct |
125 ms |
11768 KB |
Output is correct |
| 5 |
Correct |
112 ms |
11768 KB |
Output is correct |
| 6 |
Correct |
225 ms |
30676 KB |
Output is correct |
| 7 |
Correct |
67 ms |
30676 KB |
Output is correct |
| 8 |
Correct |
139 ms |
30676 KB |
Output is correct |
| 9 |
Correct |
147 ms |
30676 KB |
Output is correct |
| 10 |
Correct |
146 ms |
30676 KB |
Output is correct |
| 11 |
Correct |
231 ms |
30676 KB |
Output is correct |
| 12 |
Correct |
177 ms |
30676 KB |
Output is correct |
| 13 |
Correct |
159 ms |
30676 KB |
Output is correct |
| 14 |
Correct |
226 ms |
30676 KB |
Output is correct |
| 15 |
Correct |
246 ms |
30676 KB |
Output is correct |
| 16 |
Correct |
3 ms |
30676 KB |
Output is correct |
| 17 |
Correct |
2 ms |
30676 KB |
Output is correct |
| 18 |
Correct |
3 ms |
30676 KB |
Output is correct |
| 19 |
Correct |
3 ms |
30676 KB |
Output is correct |
| 20 |
Correct |
3 ms |
30676 KB |
Output is correct |
| 21 |
Correct |
3 ms |
30676 KB |
Output is correct |
| 22 |
Correct |
3 ms |
30676 KB |
Output is correct |
| 23 |
Correct |
3 ms |
30676 KB |
Output is correct |
| 24 |
Correct |
3 ms |
30676 KB |
Output is correct |
| 25 |
Correct |
2 ms |
30676 KB |
Output is correct |
