Submission #1499075


Source Code Expand

#include <cstdio>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

#define TRACE(x) cerr << #x << " = " << x << endl
#define REP(i, n) for (int i=0; i<n; i++)
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define _ << " " <<

typedef long long ll;
typedef pair<int, int> P;
#define X first
#define Y second

const int MAX = 15;
const int MOD = 1e9 + 7;

int add(int a, int b)
{
  a += b;
  if (a >= MOD)
    a -= MOD;
  return a;
}

int sub(int a, int b)
{
  a -= b;
  if (a < 0)
    a += MOD;
  return a;
}

int mul(int a, int b)
{
  return (int) (((ll) a * b) % MOD);
}

int pot2[MAX*MAX];
int dp[1<<MAX];
int e[MAX];
int sajz[MAX][1<<MAX];
int n, m;

inline int gb(int x, int pos) {
  return x>>pos & 1;
}

int rek(int msk) {
  if (dp[msk] != -1) return dp[msk];

  int ret = 1;
  for (int pod=(msk-1) & msk; pod; pod = (pod - 1) & msk) {
    int veci = pod, manji = msk ^ pod;
    if (gb(veci, 0) != gb(veci, 1))
      continue;

    int tmp = 1;
    REP(i, n) {
      if (gb(veci, i))
	tmp = mul(tmp, sub(pot2[sajz[i][manji]], 1));
      else if (gb(manji, i))
	tmp = mul(tmp, pot2[sajz[i][veci]]);
    }

    tmp = mul(tmp, rek(veci));
    ret = add(ret, tmp);
  }

  return dp[msk] = ret;
}

int main()
{
  pot2[0] = 1;
  FOR(i, 1, MAX*MAX)
    pot2[i] = mul(2, pot2[i-1]);

  scanf("%d%d", &n, &m);
  REP(i, m) {
    int a, b;
    scanf("%d%d", &a, &b); a--; b--;
    e[a] |= 1<<b;
  }
    
  REP(i, n)
    REP(j, 1<<n)
    sajz[i][j] = __builtin_popcount(e[i] & j);

  memset(dp, -1, sizeof dp);  
  printf("%d\n", sub(pot2[m], rek((1<<n)-1)));

  return 0;
}

Submission Info

Submission Time
Task F - Games on DAG
User dbradac
Language C++14 (GCC 5.4.1)
Score 1600
Code Size 1742 Byte
Status AC
Exec Time 370 ms
Memory 2304 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:84: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:87:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &a, &b); a--; b--;
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1600 / 1600
Status
AC × 4
AC × 40
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.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, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 384 KB
0_01.txt AC 1 ms 384 KB
0_02.txt AC 1 ms 384 KB
0_03.txt AC 1 ms 384 KB
1_00.txt AC 1 ms 384 KB
1_01.txt AC 369 ms 2304 KB
1_02.txt AC 370 ms 2304 KB
1_03.txt AC 369 ms 2304 KB
1_04.txt AC 369 ms 2304 KB
1_05.txt AC 368 ms 2304 KB
1_06.txt AC 369 ms 2304 KB
1_07.txt AC 369 ms 2304 KB
1_08.txt AC 369 ms 2304 KB
1_09.txt AC 369 ms 2304 KB
1_10.txt AC 369 ms 2304 KB
1_11.txt AC 369 ms 2304 KB
1_12.txt AC 369 ms 2304 KB
1_13.txt AC 369 ms 2304 KB
1_14.txt AC 369 ms 2304 KB
1_15.txt AC 369 ms 2304 KB
1_16.txt AC 369 ms 2304 KB
1_17.txt AC 369 ms 2304 KB
1_18.txt AC 369 ms 2304 KB
1_19.txt AC 369 ms 2304 KB
1_20.txt AC 368 ms 2304 KB
1_21.txt AC 2 ms 512 KB
1_22.txt AC 369 ms 2304 KB
1_23.txt AC 369 ms 2304 KB
1_24.txt AC 119 ms 1280 KB
1_25.txt AC 2 ms 384 KB
1_26.txt AC 369 ms 2304 KB
1_27.txt AC 13 ms 640 KB
1_28.txt AC 369 ms 2304 KB
1_29.txt AC 38 ms 896 KB
1_30.txt AC 13 ms 640 KB
1_31.txt AC 369 ms 2304 KB
1_32.txt AC 38 ms 896 KB
1_33.txt AC 13 ms 640 KB
1_34.txt AC 119 ms 1280 KB
1_35.txt AC 38 ms 896 KB