Submission #2119327

---

Source Code Expand

#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;

#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;
#define szz(x) (int)(x).size()
#define rep(i, n) for(int i=0;i<n;i++)
#define Se second
#define Fi first

const int MX = 300;
const int MM = 1000000007;

ll pw2[MX*MX];
int N;

ll DP[MX][MX][MX];
int C[MX][MX];

int main()
{
	pw2[0] = 1;
	for(int i = 1; i < MX*MX; i++) pw2[i] = pw2[i-1] * 2 % MM;
	scanf("%d", &N);
	for(int i = 1; i <= N; i++){
		for(int j = 1; j <= N; j++) scanf("%d", C[i]+j);
	}
	/*

	int tot = 0;

	for(int i = 0; i < 1<<N*N; i++){
		for(int j = 0; j < 1<<N*N; j++){
			int A[MX][MX] = {};
			for(int p = 0; p < N; p++){
				for(int q = 0; q < N; q++){
					for(int r = 0; r < N; r++){
						if( i&1<<p*N+q && j&1<<q*N+r ) A[p][r] ^= 1;
					}
				}
			}
			int ch = 1;
			for(int p = 0; p < N; p++){
				for(int q = 0; q < N; q++){
					if( A[p][q] != C[p+1][q+1] ) ch = 0;
				}
			}
			tot += ch;
		}
	}
	printf("%d\n", tot);
// */
	int K = 0, cur = 1;
	for(int i = 1; i <= N; i++){
		for(int j = cur; j <= N; j++){
			if( C[j][i] == 1 ){
				for(int k = 1; k <= N; k++) swap(C[j][k], C[cur][k]);
				break;
			}
		}
		if( C[cur][i] == 0 ) continue;
		for(int j = cur+1; j <= N; j++){
			if( !C[j][i] ) continue;
			for(int k = 1; k <= N; k++){
				C[j][k] ^= C[cur][k];
			}
		}
		K++; cur++;
	}

	DP[0][0][0] = 1;
	for(int i = 1; i <= N; i++){
		for(int j = 0; j <= K; j++){
			for(int k = j; k <= N; k++){
				DP[i][j][k] = DP[i-1][j][k] * pw2[k] % MM;
				if( j && k ) DP[i][j][k] = (DP[i][j][k] + DP[i-1][j-1][k-1] * (pw2[K+(k-j)] - pw2[k-1] + MM)) % MM;
				if( k ) DP[i][j][k] = (DP[i][j][k] + DP[i-1][j][k-1] * (pw2[N] - pw2[K+k-1-j] + MM*2)) % MM;
//				printf("%d %d %d %lld\n", i, j, k, DP[i][j][k]);
			}
		}
	}
	ll ans = 0;
	for(int i = K; i <= N; i++){
//		printf("%d %d %d %lld\n", N, K, i, DP[N][K][i]);
		ans = (ans + DP[N][K][i] * pw2[(N-i)*N]) % MM;
	}
	printf("%lld\n", ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:65:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:67:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   for(int j = 1; j <= N; j++) scanf("%d", C[i]+j);
                                                  ^

Judge Result