結果
| 問題 | No.1584 Stones around Circle Pond |
| ユーザー |
 hitonanode
|
| 提出日時 | 2021-07-02 22:28:10 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 11,732 bytes |
| コンパイル時間 | 1,634 ms |
| コンパイル使用メモリ | 158,056 KB |
| 実行使用メモリ | 13,760 KB |
| 最終ジャッジ日時 | 2024-06-29 12:16:53 |
| 合計ジャッジ時間 | 5,064 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
13,760 KB |
| testcase_01 | AC | 1 ms
6,940 KB |
| testcase_02 | AC | 1 ms
6,944 KB |
| testcase_03 | AC | 3 ms
6,940 KB |
| testcase_04 | AC | 2 ms
6,944 KB |
| testcase_05 | TLE | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
| testcase_40 | -- | - |
| testcase_41 | -- | - |
| testcase_42 | -- | - |
| testcase_43 | -- | - |
| testcase_44 | -- | - |
| testcase_45 | -- | - |
| testcase_46 | -- | - |
| testcase_47 | -- | - |
| testcase_48 | -- | - |
| testcase_49 | -- | - |
| testcase_50 | -- | - |
| testcase_51 | -- | - |
| testcase_52 | -- | - |
| testcase_53 | -- | - |
| testcase_54 | -- | - |
| testcase_55 | -- | - |
| testcase_56 | -- | - |
| testcase_57 | -- | - |
| testcase_58 | -- | - |
| testcase_59 | -- | - |
| testcase_60 | -- | - |
ソースコード
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
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) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif
// Maximize cx s.t. Ax <= b, x >= 0
// Implementation idea: https://kopricky.github.io/code/Computation_Advanced/simplex.html
// Refer to https://hitonanode.github.io/cplib-cpp/combinatorial_opt/simplex.hpp
template <typename Float = double, int DEPS = 30, bool Randomize = true> struct Simplex {
const Float EPS = Float(1.0) / (1LL << DEPS);
int N, M;
std::vector<int> shuffle_idx;
std::vector<int> idx;
std::vector<std::vector<Float>> mat;
int i_ch, j_ch;
private:
void _initialize(const std::vector<std::vector<Float>> &A, const std::vector<Float> &b, const std::vector<Float> &c) {
N = c.size(), M = A.size();
mat.assign(M + 2, std::vector<Float>(N + 2));
i_ch = M;
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) mat[i][j] = -A[i][j];
mat[i][N] = 1, mat[i][N + 1] = b[i];
if (mat[i_ch][N + 1] > mat[i][N + 1]) i_ch = i;
}
for (int j = 0; j < N; j++) mat[M][j] = c[j];
mat[M + 1][N] = -1;
idx.resize(N + M + 1);
std::iota(idx.begin(), idx.end(), 0);
}
inline Float abs_(Float x) noexcept { return x > -x ? x : -x; }
void _solve() {
std::vector<int> jupd;
for (nb_iter = 0, j_ch = N;; nb_iter++) {
if (i_ch < M) {
std::swap(idx[j_ch], idx[i_ch + N + 1]);
mat[i_ch][j_ch] = Float(1) / mat[i_ch][j_ch];
jupd.clear();
for (int j = 0; j < N + 2; j++) {
if (j != j_ch) {
mat[i_ch][j] *= -mat[i_ch][j_ch];
if (abs_(mat[i_ch][j]) > EPS) jupd.push_back(j);
}
}
for (int i = 0; i < M + 2; i++) {
if (abs_(mat[i][j_ch]) < EPS or i == i_ch) continue;
for (auto j : jupd) mat[i][j] += mat[i][j_ch] * mat[i_ch][j];
mat[i][j_ch] *= mat[i_ch][j_ch];
}
}
j_ch = -1;
for (int j = 0; j < N + 1; j++) {
if (j_ch < 0 or idx[j_ch] > idx[j]) {
if (mat[M + 1][j] > EPS or (abs_(mat[M + 1][j]) < EPS and mat[M][j] > EPS)) j_ch = j;
}
}
if (j_ch < 0) break;
i_ch = -1;
for (int i = 0; i < M; i++) {
if (mat[i][j_ch] < -EPS) {
if (i_ch < 0) {
i_ch = i;
} else if (mat[i_ch][N + 1] / mat[i_ch][j_ch] - mat[i][N + 1] / mat[i][j_ch] < -EPS) {
i_ch = i;
} else if (mat[i_ch][N + 1] / mat[i_ch][j_ch] - mat[i][N + 1] / mat[i][j_ch] < EPS and idx[i_ch] > idx[i]) {
i_ch = i;
}
}
}
if (i_ch < 0) {
is_infty = true;
break;
}
}
if (mat[M + 1][N + 1] < -EPS) {
infeasible = true;
return;
}
x.assign(N, 0);
for (int i = 0; i < M; i++) {
if (idx[N + 1 + i] < N) x[idx[N + 1 + i]] = mat[i][N + 1];
}
ans = mat[M][N + 1];
}
public:
Simplex(std::vector<std::vector<Float>> A, std::vector<Float> b, std::vector<Float> c) {
is_infty = infeasible = false;
if (Randomize) {
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
std::vector<std::pair<std::vector<Float>, Float>> Abs;
for (unsigned i = 0; i < A.size(); i++) Abs.emplace_back(A[i], b[i]);
std::shuffle(Abs.begin(), Abs.end(), rng);
A.clear(), b.clear();
for (auto &&Ab : Abs) A.emplace_back(Ab.first), b.emplace_back(Ab.second);
shuffle_idx.resize(c.size());
std::iota(shuffle_idx.begin(), shuffle_idx.end(), 0);
std::shuffle(shuffle_idx.begin(), shuffle_idx.end(), rng);
auto Atmp = A;
auto ctmp = c;
for (unsigned i = 0; i < A.size(); i++) {
for (unsigned j = 0; j < A[i].size(); j++) A[i][j] = Atmp[i][shuffle_idx[j]];
}
for (unsigned j = 0; j < c.size(); j++) c[j] = ctmp[shuffle_idx[j]];
}
_initialize(A, b, c);
_solve();
if (Randomize and x.size() == c.size()) {
auto xtmp = x;
for (unsigned j = 0; j < c.size(); j++) x[shuffle_idx[j]] = xtmp[j];
}
}
unsigned nb_iter;
bool is_infty;
bool infeasible;
std::vector<Float> x;
Float ans;
};
uint32_t rand_int() // XorShift random integer generator
{
static uint32_t x = 123456789, y = 362436069, z = 521288629, w = 88675123;
uint32_t t = x ^ (x << 11);
x = y;
y = z;
z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
double rand_double() { return (double)rand_int() / UINT32_MAX; }
void No() {
puts("No");
exit(0);
}
int main() {
int N, L;
cin >> N >> L;
vector<int> d(N);
cin >> d;
REP(i, N) d.push_back(d[i] + L);
// vector<int> B(N * 2);
// cin >> B;
// vector dist(N * 2, vector<int>(N * 2));
// REP(i, dist.size()) REP(j, dist[i].size()) {
// auto dd = abs(d[i] - d[j]);
// dist[i][j] = min(dd, L * 2 - dd);
// }
// while (true) {
// dbg(B);
// int i = max_element(B.begin(), B.end()) - B.begin();
// i = (i + N) % (N * 2);
// if (B[i] <= 0) break;
// REP(j, N * 2) B[j] -= dist[i][j];
// }
// if (*min_element(B.begin(), B.end()) < 0) puts("No");
// else puts("Yes");
vector<int> Bin(N * 2);
cin >> Bin;
using Float = double;
vector<vector<Float>> A;
vector<Float> b, c(N * 2);
REP(i, c.size()) {
c[i] = rand_int() % 2;
}
REP(i, N * 2) {
vector<Float> a(N * 2);
a[i] = -1;
A.push_back(a);
b.push_back(0);
}
dbg(d);
REP(i, N * 2) {
vector<Float> a(N * 2);
REP(j, N * 2) {
int t = abs(d[j] - d[i]);
a[j] = min(t, L * 2 - t);
}
A.push_back(a);
b.push_back(Bin[i]);
for (auto &x : a) x = -x;
A.push_back(a);
b.push_back(-Bin[i]);
}
Simplex<Float, 20, false> simplex(A, b, c);
dbg(simplex.infeasible);
dbg(simplex.x);
if (simplex.infeasible) No();
for (auto x : simplex.x) {
if (abs(x - llround(x)) > 1e-5) No();
}
puts("Yes");
}