Submission #1364672


Source Code Expand

#include <algorithm>  
#include <iostream>  
#include <sstream>  
#include <string>  
#include <cstring>
#include <vector>  
#include <queue>  
#include <set>  
#include <map>  
#include <cstdio>  
#include <cstdlib>  
#include <cctype>  
#include <cmath>  
#include <list>  
#include <cassert>
#include <ctime>
#include <climits>
using namespace std;  

#define PB push_back  
#define MP make_pair  
#define SZ(v) ((int)(v).size())  
#define FOR(i,a,b) for(int i=(a);i<(b);++i)  
#define REP(i,n) FOR(i,0,n)  
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)  
#define REPE(i,n) FORE(i,0,n)  
#define FORSZ(i,a,v) FOR(i,a,SZ(v))  
#define REPSZ(i,v) REP(i,SZ(v))  
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b); }

const int MAXN=15;
const int MOD=1000000007;

int n,m;
int adj[MAXN];
int mem[1<<MAXN];
int bcnt[1<<MAXN];

int go(int mask) {
	if(mask==0) return 1;
	if(mem[mask]!=-1) return mem[mask];
	//printf("go(%d)\n",mask);
	int ret=0;
	int donemask=(1<<n)-1-mask;
	for(int nxtmask=(donemask+1)&mask;nxtmask!=0;nxtmask=(nxtmask+donemask+1)&mask) {
		bool a=(nxtmask&1)!=0,b=(nxtmask&2)!=0; if(a!=b) continue;
		int remmask=mask-nxtmask;
		int ways=1;
		REP(i,n) if(remmask&(1<<i)) {
			int cnt=bcnt[adj[i]&nxtmask];
			int curways=(1<<cnt)-1;
			ways=(ll)ways*curways%MOD;
		}
		REP(i,n) if(nxtmask&(1<<i)) {
			int cnt=bcnt[adj[i]&remmask];
			int curways=(1<<cnt);
			ways=(ll)ways*curways%MOD;
		}
		int res=go(remmask);
		ret=(ret+(ll)ways*res)%MOD;
	}
	return mem[mask]=ret;
}

void run() {
	scanf("%d%d",&n,&m); REP(i,n) adj[i]=0;
	REP(i,m) { int a,b; scanf("%d%d",&a,&b); --a,--b; adj[a]|=1<<b; }
	memset(mem,-1,sizeof(mem));
	bcnt[0]=0; FOR(i,1,1<<n) bcnt[i]=1+bcnt[i-(i&-i)];
	int tot=1; REP(i,m) tot=(ll)2*tot%MOD;
	int lose=go((1<<n)-1);
	int ret=(tot-lose+MOD)%MOD;
	printf("%d\n",ret);
}

int main() {
	run();
	return 0;
}

Submission Info

Submission Time
Task F - Games on DAG
User krijgertje
Language C++14 (GCC 5.4.1)
Score 1600
Code Size 1974 Byte
Status AC
Exec Time 502 ms
Memory 512 KB

Compile Error

./Main.cpp: In function ‘void run()’:
./Main.cpp:68:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m); REP(i,n) adj[i]=0;
                     ^
./Main.cpp:69:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i,m) { int a,b; scanf("%d%d",&a,&b); --a,--b; adj[a]|=1<<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 501 ms 512 KB
1_02.txt AC 501 ms 512 KB
1_03.txt AC 501 ms 512 KB
1_04.txt AC 501 ms 512 KB
1_05.txt AC 501 ms 512 KB
1_06.txt AC 502 ms 512 KB
1_07.txt AC 501 ms 512 KB
1_08.txt AC 502 ms 512 KB
1_09.txt AC 501 ms 512 KB
1_10.txt AC 501 ms 512 KB
1_11.txt AC 501 ms 512 KB
1_12.txt AC 501 ms 512 KB
1_13.txt AC 501 ms 512 KB
1_14.txt AC 501 ms 512 KB
1_15.txt AC 501 ms 512 KB
1_16.txt AC 501 ms 512 KB
1_17.txt AC 501 ms 512 KB
1_18.txt AC 502 ms 512 KB
1_19.txt AC 501 ms 512 KB
1_20.txt AC 501 ms 512 KB
1_21.txt AC 3 ms 384 KB
1_22.txt AC 501 ms 512 KB
1_23.txt AC 501 ms 512 KB
1_24.txt AC 159 ms 384 KB
1_25.txt AC 2 ms 384 KB
1_26.txt AC 501 ms 512 KB
1_27.txt AC 17 ms 384 KB
1_28.txt AC 501 ms 512 KB
1_29.txt AC 51 ms 384 KB
1_30.txt AC 17 ms 384 KB
1_31.txt AC 502 ms 512 KB
1_32.txt AC 51 ms 384 KB
1_33.txt AC 17 ms 384 KB
1_34.txt AC 159 ms 384 KB
1_35.txt AC 51 ms 384 KB