Submission #00032
ソースコード
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 | #pragma region Macros #include <bits/stdc++.h> using namespace std; #define pb emplace_back #define int ll #define endl '\n' #define sqrt __builtin_sqrtl #define cbrt __builtin_cbrtl #define hypot __builtin_hypotl // #define next asdnext // #define prev asdprev using ll = long long ; using ld = long double ; const ld PI = acosl(-1); const int INF = 1 << 30; const ll INFL = 1LL << 61; // const int MOD = 998244353; const int MOD = 1000000007; const ld EPS = 1e-10; const bool equals(ld a, ld b) { return fabs ((a) - (b)) < EPS; } const vector< int > dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗ const vector< int > dy = {1, 0, -1, 0, 1, -1, -1, 1}; #define EC int struct Edge { int from, to; EC cost; Edge() : from(-1), to(-1), cost(-1) {} Edge( int to, EC cost) : to(to), cost(cost) {} Edge( int from, int to, EC cost) : from(from), to(to), cost(cost) {} bool operator ==( const Edge& e) { return this ->from == e.from && this ->to == e.to && this ->cost == e.cost; } bool operator !=( const Edge& e) { return this ->from != e.from or this ->to != e.to or this ->cost != e.cost; } bool operator <( const Edge& e) { return this ->cost < e.cost; } bool operator >( const Edge& e) { return this ->cost > e.cost; } }; chrono::system_clock::time_point start; __attribute__((constructor)) void constructor() { ios::sync_with_stdio( false ); cin.tie(nullptr); cout << fixed << setprecision(10); start = chrono::system_clock::now(); } random_device seed_gen; mt19937_64 rng(seed_gen()); uniform_int_distribution< int > dist_x(0, 1e9); struct RNG { unsigned Int() { return dist_x(rng); } unsigned Int(unsigned l, unsigned r) { return dist_x(rng) % (r - l + 1) + l; } ld Double() { return ld(dist_x(rng)) / 1e9; } } rnd; namespace bit_function { using i64 = ll; // using i64 = uint64_t; // bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r) i64 lrmask( int l, int r) { return (1LL << r) - (1LL << l); } i64 sub_bit(i64 x, int l, int r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可 i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); } i64 popcount(i64 x) { return __builtin_popcountll(x); } i64 popcount(i64 x, int l, int r) { return __builtin_popcountll(sub_bit(x, l, r)); } i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); } // 最上位bitより下のみ i64 unpopcount(i64 x, int l, int r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); } // 最上位bitより上も含まれうる bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse bool is_pow4(i64 x) { return __builtin_popcountll(x) == 1 && __builtin_ctz(x) % 2 == 0; } //bool is_pow4(ll x) { return __builtin_popcountll(x) == 1 && (x&0x55555555); } int top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0) int bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0) int next_bit(i64 x, int k) { // upper_bound x >>= (k + 1); int pos = k + 1; while (x > 0) { if (x & 1) return pos; x >>= 1; pos++; } return -1; } int prev_bit(i64 x, int k) { // k = min(k, bit_width(x)); ? int pos = 0; while (x > 0 && pos < k) { if (x & 1) { if (pos < k) return pos; } x >>= 1; pos++; } return -1; } int kth_bit(i64 x, int k) { // kは1-indexed int pos = 0, cnt = 0; while (x > 0) { if (x & 1) { cnt++; if (cnt == k) return pos; } x >>= 1; pos++; } return -1; } i64 msb(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask i64 lsb(i64 x) { return (x & -x); } // mask int countl_zero(i64 x) { return __builtin_clzll(x); } int countl_one(i64 x) { // countl_oneと定義が異なるので注意 i64 ret = 0, k = 63 - __builtin_clzll(x); while (k != -1 && (x & (1LL << k))) { k--; ret++; } return ret; } int countr_zero(i64 x) { return __builtin_ctzll(x); } // x=0のとき64 int countr_one(i64 x) { int ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; } // int countr_one(ll x) { return __builtin_popcount(x ^ (x & -~x)); i64 l_one(i64 x) { // 最上位で連なってる1のmask if (x == 0) return 0; i64 ret = 0, k = 63 - __builtin_clzll(x); while (k != -1 && (x & (1LL << k))) { ret += 1LL << k; k--; } return ret; } int floor_log2(i64 x) { return 63 - __builtin_clzll(x); } // top_bit int ceil_log2(i64 x) { return 64 - __builtin_clzll(x - 1); } i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // msb i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); } i64 rotl(i64 x, int k) { // 有効bit内でrotate. オーバーフロー注意 i64 w = bit_width(x); k %= w; return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1); } // i64 rotl(i64 x, i64 l, i64 m, i64 r) {} i64 rotr(i64 x, int k) { i64 w = bit_width(x); k %= w; return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1); } // i64 rotr(i64 x, i64 l, i64 m, i64 r) {} i64 bit_reverse(i64 x) { // 有効bit内で左右反転 i64 r = 0, w = bit_width(x); for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1); return r; } // i64 bit_reverse(i64 x, int l, int r) {} bool is_palindrome(i64 x) { return x == bit_reverse(x); } bool is_palindrome(i64 x, int l, int r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); } i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意 i64 erase(i64 x, int l, int r) { return x >> r << l | x & ((1LL << l) - 1); } // [l, r) をカット i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); } i64 hamming(i64 a, i64 b, int l, int r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); } i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; } i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数 i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数 i64 next_combination(i64 x) { i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1)); } } using namespace bit_function; namespace util_function { namespace Std = std; int per( int x, int y) { // x = qy + r (0 <= r < y) を満たすq assert (y != 0); if (x >= 0 && y > 0) return x / y; if (x >= 0 && y < 0) return x / y - (x % y < 0); if (x < 0 && y < 0) return x / y + (x % y < 0); return x / y - (x % y < 0); // (x < 0 && y > 0) } int mod( int x, int y) { // x = qy + r (0 <= r < y) を満たすr assert (y != 0); return x - y * per(x, y); int floor ( int x, int y) { // (ld)x / y 以下の最大の整数 assert (y != 0); if (y < 0) x = -x, y = -y; return x >= 0 ? x / y : (x + 1) / y - 1; } int ceil ( int x, int y) { // (ld)x / y 以上の最小の整数 assert (y != 0); if (y < 0) x = -x, y = -y; return x > 0 ? (x - 1) / y + 1 : x / y; } int round( int x, int y) { // (ld)(x/y)を小数点第1位について四捨五入 assert (y != 0); return (x * 2 + y) / (y * 2); } int round2( int x, int y) { // 五捨五超入 // 未verify assert (y != 0); if (y < 0) y = -y, x = -x; int z = x / y; if ((z * 2 + 1) * y <= y * 2) z++; return z; } ld round(ld x, int k) { // xを10^kの位に関して四捨五入. to_string(x, k)優先 // x += EPS; ld d = pow (10, -k); return Std::round(x * d) / d; } ld floor (ld x, int k) { // xを10^kの位に関してflooring // x += EPS; ld d = pow (10, -k); return Std:: floor (x * d) / d; // 未verify } ld ceil (ld x, int k) { // xを10^kの位に関してceiling // x -= EPS; ld d = pow (10, -k); return Std:: ceil (x * d) / d; // 未verify } // int kth(int x, int y, int k) { // x / yの10^kの位の桁 // } int floor (ld x, ld y) { // 誤差対策TODO assert (!equals(y, 0)); return Std:: floor (x / y); // floor(x) = ceil(x - 1) という話も } int ceil (ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい assert (!equals(y, 0)); return Std:: ceil (x / y); // ceil(x) = floor(x + 1) } int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q // 未verify. 誤差対策TODO. EPS外してもいいかも。 assert (!equals(y, 0)); if (x >= 0 && y > 0) return Std:: floor (x / y)+EPS; if (x >= 0 && y < 0) return -Std:: floor (x / fabs (y)); if (x < 0 && y < 0) return Std:: floor (x / y) + (x - Std:: floor (x/y)*y < -EPS); return Std:: floor (x / y) - (x - Std:: floor (x/y)*y < -EPS); // (x < 0 && y > 0) } ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r // 未verify. 誤差対策TODO. -0.0が返りうる。 assert (!equals(y, 0)); if (x >= 0) return x - fabs (y)* fabs (per(x, y)); return x - fabs (y)* floor (x, fabs (y)); } int seisuu(ld x) { return ( int )x; } // 整数部分. 誤差対策TODO int modf (ld x) { if (x < 0) return ceill(x); else return floorl(x); } // 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる? int seisuu( int x, int y) { assert (y != 0); return x / y; } int seisuu(ld x, ld y) { // 誤差対策TODO assert (!equals(y, 0)); return ( int )(x / y); } int floor_log( int base, int x) { assert (base >= 2); int ret = 0, now = 1; while (now <= x) { now *= base; if (now <= x) ret++; } return ret; } int ceil_log( int base, int x) { assert (base >= 2); int ret = 0, now = 1; while (now < x) { now *= base; ret++; } return ret; } template < class T> pair<T, T> max( const pair<T, T> &a, const pair<T, T> &b) { if (a.first > b.first or a.first == b.first && a.second > b.second) return a; return b; } template < class T> pair<T, T> min( const pair<T, T> &a, const pair<T, T> &b) { if (a.first < b.first or a.first == b.first && a.second < b.second) return a; return b; } template < class T> bool chmax(T &a, const T& b) { if (a < b) { a = b; return true ; } return false ; } template < class T> bool chmin(T &a, const T& b) { if (a > b) { a = b; return true ; } return false ; } template < class T> T mid(T a, T b, T c) { // 誤差対策TODO return a + b + c - Std::max({a, b, c}) - Std::min({a, b, c}); } template < class T> void Sort(T &a, T &b, bool rev = false ) { if (rev == false ) if (a > b) swap(a, b); else if (b > a) swap(b, a); } template < typename T, typename ... Args> void Sort(T& a, T& b, T& c, Args&... args) { vector<T> vec = {a, b, c, args...}; sort(vec.begin(), vec.end()); auto it = vec.begin(); a = *it++; b = *it++; c = *it++; int dummy[] = { (args = *it++, 0)... }; static_cast < void >(dummy); } string to_string(ld x, int k) { // xの小数第k位までをstring化する assert (k >= 0); stringstream ss; ss << setprecision(k + 2) << x; string s = ss.str(); if (s.find( '.' ) == string::npos) s += '.' ; int pos = s.find( '.' ); for ( int i = 0; k >= ( int )s.size() - 1 - pos; i++) s += '0' ; s.pop_back(); if (s.back() == '.' ) s.pop_back(); return s; // stringstream ss; // 第k+1位を四捨五入して第k位まで返す // ss << setprecision(k + 1) << x; // string s = ss.str(); // if (s.find('.') == string::npos) s += '.'; // int pos = s.find('.'); // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0'; // if (s.back() == '.') s.pop_back(); // return s; } string to_string( char c) { string s = "" ; s += c; return s; } } using namespace util_function; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; template < class T> size_t HashCombine( const size_t seed, const T &v) { return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2)); } template < class T, class S> struct hash<pair<T,S>>{ size_t operator()( const pair<T,S> &keyval) const noexcept { return HashCombine(hash<T>()(keyval.first), keyval.second); } }; template < class T> struct hash<vector<T>>{ size_t operator()( const vector<T> &keyval) const noexcept { size_t s=0; for (auto&& v: keyval) s=HashCombine(s,v); return s; } }; template < int N> struct HashTupleCore{ template < class Tuple> size_t operator()( const Tuple &keyval) const noexcept{ size_t s=HashTupleCore<N-1>()(keyval); return HashCombine(s,get<N-1>(keyval)); } }; template <> struct HashTupleCore<0>{ template < class Tuple> size_t operator()( const Tuple &keyval) const noexcept{ return 0; } }; template < class ... Args> struct hash<tuple<Args...>>{ size_t operator()( const tuple<Args...> &keyval) const noexcept { return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval); } }; template < typename T> class Compress { // 試験運用, バグったらTをintにする public : int sz = 0; // gp_hash_table<T, int, custom_hash> Z; // gp_hash_table<int, T, custom_hash> UZ; unordered_map<T, int > Z; // 元の値 -> 圧縮した値 unordered_map< int , T> UZ; // 圧縮した値 -> 元の値 Compress() {} Compress( const vector<T> &V, T base = 0) { this ->sz = base; set<T> s(V.begin(), V.end()); for (T x : s) { this ->Z[x] = this ->sz; this ->UZ[ this ->sz] = x; this ->sz++; } } Compress( const vector<T> &V1, const vector<T> &V2, T base = 0) { this ->sz = base; vector<T> V3 = V2; V3.insert(V3.end(), V1.begin(), V1.end()); set<T> s(V3.begin(), V3.end()); for (T x : s) { this ->Z[x] = this ->sz; this ->UZ[ this ->sz] = x; this ->sz++; } } Compress( const vector<T> &V1, const vector<T> &V2, const vector<T> &V3, T base = 0) { this ->sz = base; vector<T> V4 = V1; V4.insert(V4.end(), V2.begin(), V2.end()); V4.insert(V4.end(), V3.begin(), V3.end()); set<T> s(V4.begin(), V4.end()); for (T x : s) { this ->Z[x] = this ->sz; this ->UZ[ this ->sz] = x; this ->sz++; } } Compress( const vector<T> &V1, const vector<T> &V2, const vector<T> &V3, const vector<T> &V4, T base = 0) { this ->sz = base; vector<T> V5 = V1; V5.insert(V5.end(), V2.begin(), V2.end()); V5.insert(V5.end(), V3.begin(), V3.end()); V5.insert(V5.end(), V4.begin(), V4.end()); set<T> s(V5.begin(), V5.end()); for (T x : s) { this ->Z[x] = this ->sz; this ->UZ[ this ->sz] = x; this ->sz++; } } vector< int > zip( const vector<T> &V) { vector< int > ret(V.size()); for ( int i = 0; i < ( int )V.size(); i++) { ret[i] = Z[V[i]]; } return ret; } vector<T> unzip( const vector< int > &V) { vector<T> ret(V.size()); for ( int i = 0; i < ( int )V.size(); i++) { ret[i] = UZ[V[i]]; } return ret; } int size() { return sz; } T encode( int x) { return Z[x]; } int decode(T x) { if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき return UZ[x]; } }; class UnionFind { public : UnionFind() = default ; UnionFind( int N) : par(N), sz(N, 1) { iota(par.begin(), par.end(), 0); } int root( int x) { if (par[x] == x) return x; return (par[x] = root(par[x])); } bool unite( int x, int y) { int rx = root(x); int ry = root(y); if (rx == ry) return false ; if (sz[rx] < sz[ry]) swap(rx, ry); sz[rx] += sz[ry]; par[ry] = rx; return true ; } bool issame( int x, int y) { return (root(x) == root(y)); } int size( int x) { return sz[root(x)]; } vector<vector< int >> groups( int N) { vector<vector< int >> G(N); for ( int x = 0; x < N; x++) { G[root(x)].push_back(x); } G.erase( remove_if(G.begin(), G.end(), [&]( const vector< int >& V) { return V.empty(); }), G.end()); return G; } private : vector< int > par, sz; }; template < typename T> struct BIT { int N; // 要素数 vector<T> bit[2]; // データの格納先 BIT( int N_, int x = 0) { N = N_ + 1; bit[0].assign(N, 0); bit[1].assign(N, 0); if (x != 0) { for ( int i = 0; i < N; i++) add(i, x); } } BIT( const vector<T> &A) { N = A.size() + 1; bit[0].assign(N, 0); bit[1].assign(N, 0); for ( int i = 0; i < ( int )A.size(); i++) add(i, A[i]); } void add_sub( int p, int i, T x) { while (i < N) { bit[p][i] += x; i += (i & -i); } } void add( int l, int r, T x) { add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r); add_sub(1, l + 1, x); add_sub(1, r + 1, -x); } void add( int i, T x) { add(i, i + 1, x); } T sum_sub( int p, int i) { T ret = 0; while (i > 0) { ret += bit[p][i]; i -= (i & -i); } return ret; } T sum( int i) { return sum_sub(0, i) + sum_sub(1, i) * i; } T sum( int l, int r) { return sum(r) - sum(l); } T get( int i) { return sum(i, i + 1); } void set( int i, T x) { T s = get(i); add(i, -s + x); } }; template < int mod> class Modint { public : int val = 0; Modint( int x = 0) { while (x < 0) x += mod; val = x % mod; } Modint( const Modint &r) { val = r.val; } Modint operator -() { return Modint(-val); } // 単項 Modint operator +( const Modint &r) { return Modint(* this ) += r; } Modint operator +( const int &q) { Modint r(q); return Modint(* this ) += r; } Modint operator -( const Modint &r) { return Modint(* this ) -= r; } Modint operator -( const int &q) { Modint r(q); return Modint(* this ) -= r; } Modint operator *( const Modint &r) { return Modint(* this ) *= r; } Modint operator *( const int &q) { Modint r(q); return Modint(* this ) *= r; } Modint operator /( const Modint &r) { return Modint(* this ) /= r; } Modint operator /( const int &q) { Modint r(q); return Modint(* this ) /= r; } Modint& operator ++() { val++; if (val >= mod) val -= mod; return * this ; } // 前置 Modint operator ++( signed ) { ++* this ; return * this ; } // 後置 Modint& operator --() { val--; if (val < 0) val += mod; return * this ; } Modint operator --( signed ) { --* this ; return * this ; } Modint &operator +=( const Modint &r) { val += r.val; if (val >= mod) val -= mod; return * this ; } Modint &operator +=( const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return * this ; } Modint &operator -=( const Modint &r) { if (val < r.val) val += mod; val -= r.val; return * this ; } Modint &operator -=( const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return * this ; } Modint &operator *=( const Modint &r) { val = val * r.val % mod; return * this ; } Modint &operator *=( const int &q) { Modint r(q); val = val * r.val % mod; return * this ; } Modint &operator /=( const Modint &r) { int a = r.val, b = mod, u = 1, v = 0; while (b) { int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);} val = val * u % mod; if (val < 0) val += mod; return * this ; } Modint &operator /=( const int &q) { Modint r(q); int a = r.val, b = mod, u = 1, v = 0; while (b) { int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);} val = val * u % mod; if (val < 0) val += mod; return * this ; } bool operator ==( const Modint& r) { return this -> val == r.val; } bool operator <( const Modint& r) { return this -> val < r.val; } bool operator >( const Modint& r) { return this -> val > r.val; } bool operator !=( const Modint& r) { return this -> val != r.val; } friend istream &operator >>(istream &is, Modint& x) { int t; is >> t; x = t; return (is); } friend ostream &operator <<(ostream &os, const Modint& x) { return os << x.val; } }; using mint = Modint<MOD>; mint modpow( const mint &x, int n) { if (n < 0) return (mint)1 / modpow(x, -n); // 未verify assert (n >= 0); if (n == 0) return 1; mint t = modpow(x, n / 2); t = t * t; if (n & 1) t = t * x; return t; } vector<mint> _fac, _finv, _inv; void COMinit( int N) { _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1); _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1; for ( int i = 2; i <= N; i++) { _fac[i] = _fac[i-1] * mint(i); _inv[i] = -_inv[MOD % i] * mint(MOD / i); _finv[i] = _finv[i - 1] * _inv[i]; } } mint FAC( int N) { if (N < 0) return 0; return _fac[N]; } mint COM( int N, int K) { if (N < K) return 0; if (N < 0 or K < 0) return 0; return _fac[N] * _finv[K] * _finv[N - K]; } mint PERM( int N, int K) { if (N < K) return 0; if (N < 0 or K < 0) return 0; return _fac[N] * _finv[N - K]; } mint NHK( int N, int K) { // initのサイズに注意 if (N == 0 && K == 0) return 1; return COM(N + K - 1, K); } #pragma endregion vector<vector<Edge>> G; vector< int > dist; signed main() { int N, M; cin >> N >> M; if (N == 1) { if (M == 0) { cout << 0 << endl; return 0; } vector< int > C(M); for ( int i = 0; i < M; i++) { int u, v; cin >> u >> v >> C[i]; } sort(C.begin(), C.end()); if (C[0] < 0) { cout << -1 << endl; } else cout << 0 << endl; return 0; } G.resize(N); for ( int i = 0; i < M; i++) { int u, v, c; cin >> u >> v >> c; u--; v--; G[u].pb(v, c); } const int inf = 1e14+1; dist.assign(N, inf); vector< int > dist2; // N - 1周目時点のdistを記録する配列 dist[0] = 0; for ( int i = 0; i < N; i++) { // 閉路検出のために1周余分にN周する // 全ての辺を見る for ( int j = 0; j < N; j++) { // fromの頂点について、 if (dist[j] == inf) continue ; for (auto e : G[j]) { // 接続辺の先の頂点を更新する if (dist[e.to] > dist[j] + e.cost) { dist[e.to] = dist[j] + e.cost; } } } // 閉路検出用 if (i == N - 2) { dist2 = dist; } } // この時点でdistとdist2で値が異なる頂点は「始点から到達可能な負閉路に含まれる頂点」 // もう一周必要? bool negloop = false ; for ( int i = 0; i < N; i++) { // 頂点iが始点からも終点からも到達可能(始点-終点の経路上)で、 if (dist[i] != inf) { // N - 1周目からN周目にかけて値が更新されるなら負ループが存在する if (dist2[i] != dist[i]) { negloop = true ; break ; } } } if (negloop) cout << -1 << endl; else if (dist[N - 1] == inf) cout << -1 << endl; else { cout << dist[N - 1] << endl; } } |
ステータス
項目 | データ |
---|---|
問題 | 0004 - Shortest Path2 |
ユーザー名 | T101010101 |
投稿日時 | 2024-08-18 01:48:55 |
言語 | C++17 |
状態 | Time Limit Exceeded |
得点 | 0 |
ソースコード長 | 25909 Byte |
最大実行時間 | 1000 ms |
最大メモリ使用量 | 1004 KB |
セット
セット | 得点 | Cases | |
---|---|---|---|
1 | ALL | 0 / 10 | * |
テストケース
ファイル名 | 状態 | 実行時間 | メモリ使用量 | # |
---|---|---|---|---|
in1.txt | AC | 21 ms | 604 KB |
1
|
in2.txt | AC | 29 ms | 424 KB |
1
|
in3.txt | AC | 18 ms | 500 KB |
1
|
in4.txt | AC | 21 ms | 576 KB |
1
|
in5.txt | TLE | 1000 ms | 904 KB |
1
|
in6.txt | AC | 78 ms | 1004 KB |
1
|
in7.txt | AC | 36 ms | 932 KB |
1
|
in8.txt | AC | 36 ms | 720 KB |
1
|
in9.txt | AC | 28 ms | 452 KB |
1
|