#468189 (C++14) No.74 貯金箱の退屈

提出ソース

結果

問題	No.74 貯金箱の退屈
ユーザー	fumiphys
提出日時	2020-04-22 22:07:25
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,545 bytes
コンパイル時間	1,718 ms
コンパイル使用メモリ	174,224 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-10-12 05:50:30
合計ジャッジ時間	2,651 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	2 ms 6,816 KB
testcase_16	AC	2 ms 6,820 KB
testcase_17	AC	2 ms 6,816 KB
testcase_18	AC	2 ms 6,816 KB
testcase_19	AC	2 ms 6,820 KB
testcase_20	AC	2 ms 6,816 KB
testcase_21	AC	2 ms 6,816 KB
testcase_22	AC	2 ms 6,816 KB
testcase_23	AC	2 ms 6,816 KB
testcase_24	AC	2 ms 6,820 KB
testcase_25	AC	2 ms 6,816 KB
testcase_26	AC	2 ms 6,816 KB
testcase_27	AC	2 ms 6,816 KB
testcase_28	AC	2 ms 6,816 KB
testcase_29	AC	2 ms 6,816 KB
testcase_30	AC	2 ms 6,816 KB
testcase_31	AC	2 ms 6,816 KB
testcase_32	AC	2 ms 6,816 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

const int MAX_H = 510, MAX_W = 510;
struct MatrixB {
  int H, W;
  bitset<MAX_W> val[MAX_H];
  MatrixB(int m = 1, int n = 1): H(m), W(n){}
  inline bitset<MAX_W>& operator[](size_t i){return val[i];}
  int gauss_jordan(bool is_extended = false){
    int rank = 0;
    for(int col = 0; col < W; col++){
      if(col == W - 1 && is_extended)break;
      int pivot = -1;
      for(int row = rank; row < H; row++){
        if(val[row][col]){
          pivot = row;
          break;
        }
      }
      if(pivot == -1)continue;
      swap(val[pivot], val[rank]);
      for(int row = 0; row < H; row++){
        if(row != rank && val[row][col])val[row] ^= val[rank];
      }
      rank++;
    }
    return rank;
  }
};

int linear_eq(MatrixB &A, vector<int> b, vector<int> & res){
  int m = A.H, n = A.W;
  MatrixB M(m, n + 1);
  for(int i = 0; i < m; i++){
    for(int j = 0; j < n; j++){
      M[i][j] = A[i][j];
    }
    M[i][n] = b[i];
  }
  int rank = M.gauss_jordan(true);

  for(int row = rank; row < m; row++){
    if(M[row][n])return -1;
  }

  res.assign(n, 0);
  for(int i = 0; i < rank; i++)res[i] = M[i][n];
  return rank;
}

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  vector<int> d(n); cin >> d;
  vector<int> w(n); cin >> w; rep(i, n)w[i] = 1 - w[i];
  MatrixB m(n, n);
  rep(i, n){
    int l = (i + d[i]) % n;
    int r = (i - d[i]) % n; if(r < 0)r += n;
    m[i][l] = 1;
    m[i][r] = 1;
  }
  vector<int> res;
  auto r = linear_eq(m, w, res);
  if(r == n)cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード