Original link: https://www.shuizilong.com/house/archives/bzoj-3118-orz-the-mst/ https://darkbzoj.cc/problem/3118 https://blog.bill.moe/bzoj3118-MST/ This article is reprinted from: https://www.shuizilong.com/house/archives/bzoj-3118-orz-the-mst/ This site is for inclusion only, and the copyright belongs to the original author.
BZOJ 3118. Orz the MST Read More »
Original link: https://www.shuizilong.com/house/archives/luogu-p4412-shoi2004%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0 %91/ https://www.luogu.com.cn/problem/P4412 https://darkbzoj.cc/problem/1937 The main troublesome point of this question is to find the ring. . . const int N = 50 + 9, M = int(1.5e3) + 9; struct Graph { int id[N][N]; struct edge { int x, y, w; void in() { RD(x, y, w); } } E[M]; int n,
Luogu P4412. [SHOI2004] Minimum Spanning Tree Read More »
Original link: https://www.shuizilong.com/house/archives/luogu-p3980-noi2008-%E5%BF%97%E6%84%BF%E8%80%85%E6%8B%9B%E5% 8B%9F/ https://www.luogu.com.cn/problem/P3980 https://blog.bill.moe/NOI2008-volunteer/ const int N = int(1e4) + 9, M = int(1e3) + 9; struct Simplex { DB a[N+1][M+1]; int n, m; void pivot(int in, int out) { REP(i, m+1) if(i!=in) a[out][i] /= -a[out][in]; //reset out constraint a[out][in] = 1/a [out][in]; REP(i, n+1) if (i!=out && sgn(a[i][in])) { //Recalculate other constraints
Luogu P3980. [NOI2008] Volunteer recruitment Read More »
Original link: https://www.shuizilong.com/house/archives/luogu-p4043-ahoi2014-jsoi2014%E6%94%AF%E7%BA%BF%E5%89%A7%E6%83%85/ https://www.luogu.com.cn/problem/P4043 https://darkbzoj.cc/problem/3876 https://blog.bill.moe/AHOI2014-plot/ const int N = int(5e3) + 9, M = int(3e2) + 9; VI in[M], out[M]; struct Simplex { DB a[N+1][M+1]; int n, m; void pivot(int in, int out) { REP(i, m+1) if(i!=in) a[out][i] /= -a[out][in]; //reset out constraint a[out][in] = 1/a [out][in]; REP(i, n+1) if (i!=out && sgn(a[i][in])) {
Luogu P4043. [AHOI2014/JSOI2014] Side Story Read More »
Original link: https://www.shuizilong.com/house/archives/luogu-p3337-zjoi2013-%E9%98%B2%E5%AE%88%E6%88%98%E7%BA%BF/ https://www.luogu.com.cn/problem/P3337 https://darkbzoj.cc/problem/3112 https://blog.bill.moe/ZJOI2013-defend/ const int N = int(1e3) + 9, M = int(1e4) + 9; struct Simplex { DB a[N+1][M+1]; int n, m; void pivot(int in, int out) { REP(i, m+1) if(i!=in) a[out][i] /= -a[out][in]; //reset out constraint a[out][in] = 1/a [out][in]; REP(i, n+1) if (i!=out && sgn(a[i][in])) { //Recalculate other constraints
Luogu P3337. [ZJOI2013] Defensive Front Read More »
Original link: https://www.shuizilong.com/house/archives/bzoj-3550-ontak2010vacation/ https://darkbzoj.cc/problem/3550 https://blog.bill.moe/bzoj3550-vacation/ const int N = int(1e4) + 9, M = int(1e3) + 9; struct Simplex { DB a[N+1][M+1]; int n, m; void pivot(int in, int out) { REP(i, m+1) if(i!=in) a[out][i] /= -a[out][in]; //reset out constraint a[out][in] = 1/a [out][in]; REP(i, n+1) if (i!=out && sgn(a[i][in])) { //Recalculate other constraints DB
BZOJ #3550. [ONTAK2010]Vacation Read More »
Original link: https://www.shuizilong.com/house/archives/%E7%BA%BF%E6%80%A7%E8%A7%84%E5%88%92/ material https://notes.sshwy.name/Math/Linear-Algbra/LP-and-its-Dual/ https://oi-wiki.org/math/simplex/ exercise https://www.codechef.com/JUNE15/problems/CHEFBOOK ASC 2. Roads https://codeforces.com/gym/100197 https://www.luogu.com.cn/problem/P4412 https://darkbzoj.cc/problem/1937 https://darkbzoj.cc/problem/3118 [NOI2008] Volunteer Recruitment Luogu P3980. [NOI2008] Volunteer recruitment const int N = int(1e4) + 9, M = int(1e3) + 9; struct Simplex { DB a[N][M]; int n, m; void init(int _n,int _m) { //a matrix with m rows and n
Linear programming Read More »
Original link: https://www.shuizilong.com/house/archives/codeforces-global-round-21/ portal https://codeforces.com/contest/1696 https://zhuanlan.zhihu.com/p/533890061 Problem D. Permutation Graph Given a permutation A, each position of the permutation corresponds to a node in the graph. If the number on the endpoint of an interval is exactly equal to the two sets of maximum values of the interval, then we will connect a no-value between
Codeforces Global Round 21 Read More »
Original link: https://www.shuizilong.com/house/archives/gr14-%E6%8A%95%E7%A5%A8-list/ https://gitcoin.co/grants/5688/jediswap-first-amm-on-starknet-enabling-instantan https://gitcoin.co/grants/4665/via-protocol-web3-mastercard-best-ux-among-any-to https://gitcoin.co/grants/5007/lenster https://gitcoin.co/grants/6114/meta-space https://gitcoin.co/grants/5744/w3itch This article is reprinted from: https://www.shuizilong.com/house/archives/gr14-%E6%8A%95%E7%A5%A8-list/ This site is for inclusion only, and the copyright belongs to the original author.
Original link: https://www.shuizilong.com/house/archives/minetest-in-game-transfer/ Client modification It was found that Minetest’s engine code is the same cpp as easyrpg, which means that it also has the opportunity to use emscripten to compile and run in the browser. I searched online and found that someone has actually done this. . . https://ift.tt/juUd590 So now the transfer command
How Minetest implements in-game transfers Read More »
Life’s like a box of chocolates, you never know what you’re gonna get. Doctor, you still have a lot to deal with. Can’t rest now. As I said before , recently inexplicably parachuted into a multinational GameFi company to become the CTO? All of a sudden, I have to coordinate 40+ people from various departments