結果
問題 | No.184 たのしい排他的論理和(HARD) |
ユーザー | south37 |
提出日時 | 2019-09-16 20:09:34 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 100 ms / 5,000 ms |
コード長 | 3,438 bytes |
コンパイル時間 | 671 ms |
コンパイル使用メモリ | 90,332 KB |
実行使用メモリ | 5,456 KB |
最終ジャッジ日時 | 2023-09-17 17:53:43 |
合計ジャッジ時間 | 4,005 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,528 KB |
testcase_01 | AC | 2 ms
4,900 KB |
testcase_02 | AC | 2 ms
4,624 KB |
testcase_03 | AC | 3 ms
4,528 KB |
testcase_04 | AC | 2 ms
4,612 KB |
testcase_05 | AC | 3 ms
4,608 KB |
testcase_06 | AC | 3 ms
4,608 KB |
testcase_07 | AC | 3 ms
4,608 KB |
testcase_08 | AC | 72 ms
4,804 KB |
testcase_09 | AC | 18 ms
4,680 KB |
testcase_10 | AC | 56 ms
4,608 KB |
testcase_11 | AC | 41 ms
4,672 KB |
testcase_12 | AC | 83 ms
4,816 KB |
testcase_13 | AC | 89 ms
4,932 KB |
testcase_14 | AC | 53 ms
4,552 KB |
testcase_15 | AC | 96 ms
5,396 KB |
testcase_16 | AC | 81 ms
4,808 KB |
testcase_17 | AC | 86 ms
4,804 KB |
testcase_18 | AC | 3 ms
4,628 KB |
testcase_19 | AC | 3 ms
4,564 KB |
testcase_20 | AC | 26 ms
5,200 KB |
testcase_21 | AC | 100 ms
5,068 KB |
testcase_22 | AC | 100 ms
5,392 KB |
testcase_23 | AC | 4 ms
4,892 KB |
testcase_24 | AC | 3 ms
4,676 KB |
testcase_25 | AC | 3 ms
4,612 KB |
testcase_26 | AC | 3 ms
4,548 KB |
testcase_27 | AC | 3 ms
4,552 KB |
testcase_28 | AC | 61 ms
4,740 KB |
testcase_29 | AC | 86 ms
4,996 KB |
testcase_30 | AC | 76 ms
4,860 KB |
testcase_31 | AC | 66 ms
4,828 KB |
testcase_32 | AC | 82 ms
5,180 KB |
testcase_33 | AC | 97 ms
4,924 KB |
testcase_34 | AC | 96 ms
5,456 KB |
testcase_35 | AC | 100 ms
5,180 KB |
testcase_36 | AC | 98 ms
5,260 KB |
ソースコード
// https://github.com/south37/atcoder/blob/master/template.cpp // http://drken1215.hatenablog.com/entry/2019/03/20/174600 #include <algorithm> #include <bitset> #include <cassert> #include <cmath> #include <iostream> #include <map> #include <queue> #include <unordered_map> #include <vector> #include <string.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; ++i) #define all(s) s.begin(), s.end() int dx[] = { 1, -1, 0, 0 }; int dy[] = { 0, 0, 1, -1 }; typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; typedef tuple<ll, ll, ll> triple; typedef double D; int gcd(int a, int b) { if (a < b) { swap(a, b); } if (b == 0) { return a; } return gcd(b, a % b); } bool prime(int n) { for (int i = 2; i <= sqrt(n); ++i) { if (n % i == 0) { return false; } } return n != 1; } template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } const ll INF = 1e9; const ll MOD = 1000000007; // 1e9 + 7 ll powmod(ll x, ll y) { ll r = 1; while (y) { if (y & 1) { r = r * x % MOD; } x = x * x % MOD; y >>= 1; } return r; } const int COM_MAX = 500010; ll fac[COM_MAX], facinv[COM_MAX], inv[COM_MAX]; void COMinit() { fac[0] = fac[1] = 1; facinv[0] = facinv[1] = 1; inv[1] = 1; for(int i = 2; i < COM_MAX; ++i) { fac[i] = fac[i-1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; facinv[i] = facinv[i-1] * inv[i] % MOD; } } ll COM(ll n, ll k) { return (fac[n] * facinv[k] % MOD) * facinv[n-k] % MOD; } ll PERM(ll n, ll k) { return (fac[n] * facinv[k] % MOD); } const int MAX_ROW = 100; // To be set appropriately. const int MAX_COL = 100010; // To be set appropriately. class BitMatrix { public: BitMatrix(int m = 1, int n = 1) : H(m), W(n) {} inline bitset<MAX_COL>& operator [] (int i) { return val[i]; } int H, W; private: bitset<MAX_COL> val[MAX_ROW]; }; ostream& operator << (ostream& s, BitMatrix A) { s << endl; rep(i, A.H) { rep(j, A.W) { s << A[i][j] << ", "; } s << endl; } return s; } int GaussJordan(BitMatrix &A, bool is_extended = false) { int rank = 0; rep(col, A.W) { if (is_extended && col == A.W - 1) { break; } int pivot = -1; for (int row = rank; row < A.H; ++row) { if (A[row][col]) { pivot = row; break; } } if (pivot == -1) continue; swap(A[pivot], A[rank]); rep(row, A.H) { if (row != rank && A[row][col]) { A[row] ^= A[rank]; } } ++rank; } return rank; } int linear_equation(BitMatrix A, vector<int> b, vector<int> &res) { int m = A.H, n = A.W; BitMatrix M(m, n + 1); rep(i, m) { rep(j, n) { M[i][j] = A[i][j]; } M[i][n] = b[i]; } int rank = GaussJordan(M, true); // check if it has no solution for (int row = rank; row < m; ++row) { if (M[row][n]) { return -1; } } // answer res.assign(n, 0); rep(i, rank) { res[i] = M[i][n]; } return rank; } int main(int argc, char** argv) { int N; cin >> N; vector<ll> a(N); rep(i, N) { cin >> a[i]; } const int DIGIT = 61; BitMatrix A(DIGIT, N); rep(d, DIGIT) { rep(i, N) { if (a[i] & (1LL << d)) { A[d][i] = 1; } } } int rank = GaussJordan(A); cout << (1LL << rank) << endl; }