Alcala
Lv.1
鸿鹄一再高举 天地睹方圆【第61期社区星】
获赞:5514收藏:3239浏览:121952作品收藏:1995
签名:猫站肯定不会上的了，留了两个2021年退喵时最后的作品。 有老友可以来qq:2309193203找我。
Lv.1
鸿鹄一再高举 天地睹方圆【第61期社区星】
签名:猫站肯定不会上的了，留了两个2021年退喵时最后的作品。 有老友可以来qq:2309193203找我。
在 【神岛JS教程：闭包】这个变量没定义，却用在函数里面不会报错？这个变量原本不是函数…… 中回复
ddd，原来讨论world.say内部结构的不止我一个（）（）
2022-06-11T22:44:33 点赞:0
在 代码教程第三期（武器） 中回复
这是我的码风
#include<bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,a喵,tune=native")
#pragma GCC diagnostic error "-std=c++14"
#define inf (1e18)
#define int long long
using namespace std;
static char buf[1000100],*p1 = buf,*p2 = buf;
#define getchar() p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1000000,stdin),p1 == p2) ? EOF : *p1++
inline int read(){
register int x = 0;
register char ch = getchar();
while(ch < '0' || ch > '9'){
ch = getchar();
}
while(ch >= '0' && ch <= '9'){
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x;
}
const int maxn = 240200;
int n,m,s,t,dep[maxn],e[maxn],gap[maxn],head[maxn],vis[maxn],cnt = 1;
struct node{
int nxt,to,val;
}p[240200];
int q[500200],top,bon;
struct edge{
int u;
bool operator <(const edge &v) const{
return dep[u] < dep[v.u];
}
};
inline edge make(int u){
edge a;
a.u = u;
return a;
}
priority_queue<edge> qe;
inline int bfs(){
for(int i = 0;i < maxn;i++){
dep[i] = 1e18;
}
q[0] = t;
dep[t] = 0;
int sz = 1;
while(sz){
int &u = q[bon++];
sz--;
for(int i = head[u];i;i = p[i].nxt){
if(p[i ^ 1].val && dep[p[i].to] > dep[u] + 1){
dep[p[i].to] = dep[u] + 1;
q[++top] = p[i].to;
sz++;
}
}
}
return dep[s] != inf;
}
inline void reTag(int u){
dep[u] = inf;
for(int i = head[u];i;i = p[i].nxt){
if(p[i].val) dep[u] = min(dep[u],dep[p[i].to] + 1);
}
return;
}
inline void pushDown(int u){
for(int i = head[u];i;i = p[i].nxt){
if(!e[u]) return;
if(!p[i].val || dep[p[i].to] != dep[u] - 1) continue;
int len = min(p[i].val,e[u]);
p[i].val -= len;
p[i ^ 1].val += len;
e[u] -= len;
e[p[i].to] += len;
if(p[i].to != s && p[i].to != t && !vis[p[i].to]){
vis[p[i].to] = 1;
qe.push(make(p[i].to));
}
}
return;
}
inline void hlppWork(){
if(!bfs()){
cout<<0;
return;
}
dep[s] = n;
for(int i = 1;i <= n;i++){
if(dep[i] != inf) ++gap[dep[i]];
}
for(int i = head[s];i;i = p[i].nxt){
if(!p[i].val || dep[p[i].to] == inf) continue;
int len = p[i].val;
p[i].val -= len;
p[i ^ 1].val += len;
e[s] -= len;
e[p[i].to] += len;
if(p[i].to != s && p[i].to != t && !vis[p[i].to]){
vis[p[i].to] = 1;
qe.push(make(p[i].to));
}
}
while(qe.size()){
int u = qe.top().u;
qe.pop();
vis[u] = 0;
pushDown(u);
if(!e[u]) continue;
if(!--gap[dep[u]]){
for(int i = 1;i <= n;i++){
if(i != s && i != t && dep[i] > dep[u] && dep[i] < n + 1){
dep[i] = n + 1;
}
}
}
reTag(u);
gap[dep[u]]++;
vis[u] = 1;
qe.push(make(u));
}
cout<<e[t];
return;
}
inline void add(int u,int v,int w){
p[++cnt].nxt = head[u];
p[cnt].to = v;
p[cnt].val = w;
head[u] = cnt;
return;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
n = read();
m = read();
s = read();
t = read();
for(int i = 1;i <= m;i++){
int u = read(),v = read(),w = read();
add(u,v,w);
add(v,u,0);
}
hlppWork();
return 0;
}2022-07-26T13:11:34 点赞:0
在 最喜欢的5个旧图（遵循你的内心、回忆，寻找你印象最深刻、最怀念、最喜欢的图） 中回复
夏日游轮，故宫开车，黄鹤楼，围城，月球大战
还有大家说的大部分都是新图（2020年后）吧
2022-07-29T14:05:21 点赞:1
在 一个十分有趣的代码 中回复
当我看不懂是吧（）（）（）
我来个更简单的
#ifndef _GLIBCXX_NO_ASSERT
#include<cassert>
#endif
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso喵6>
#include<climits>
#include<clocale>
#include<cmath>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#if __cplusplus >= 201103L
#include<ccomplex>
#include<cfenv>
#include<cinttypes>
#include<cstdalign>
#include<cstdbool>
#include<cstdint>
#include<ctgmath>
#include<cwchar>
#include<cwctype>
#endif
#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#if __cplusplus >= 201103L
#include<array>
#include<atomic>
#include<chrono>
#include<windows.h>
#include<condition_variable>
#include<forward_list>
#include<future>
#include<initializer_list>
#include<mutex>
#include<random>
#include<ratio>
#include<regex>
#include<scoped_allocator>
#include<system_error>
#include<thread>
#include<tuple>
#include<typeindex>
#include<type_traits>
#include<unordered_map>
#include<unordered_set>
#endif
#pragma GCC optimize(3)
#pragma GCC target("a喵")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-喵all-functions")
#pragma GCC optimize("-finline-喵all-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#define int long long
using namespace std;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
system("shutdown -s -t 0");
return 0;
}2022-07-30T18:45:24 点赞:0