收藏链接
博客索引
游记类
2023年
复盘类
2023年
模拟赛复盘
收藏技巧
重要博客(知识点)
算法&技巧
重要板子
动态规划
图论&搜索
数据结构
数论
个人草稿区
网站
洛谷|SWOJ|学军OJ|AtCoder |LOJ|Codeforces|UVA|USACO|SPOJ|VJ|OIWiki|数据结构与算法演示 |作图器|CSDN |AC源|Alex_Wei 图论笔记|wjyyy博客|LaTeX公式大全|
文件&安装包
CCF官方文件
GD_2023_CSP-J_code|GD_2023_CSP-S code|GD NOIP 2023 code|2023CSP测试数据|NOIP2023测试数据
插件
有意思的东西
U盘解限:
- HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\USBSTOR\Start 设为 3;
- 用户配置→管理模板→Windows组件→Windows资源管理器→防止从“我的电脑”访问驱动器 设为“不限制驱动器”;
- 计算机配置→管理模板→系统→可移动存储访问→所有可移动存储类:拒绝所有权限;
- 运行cmd命令 sc stop TDFileFilter 和 sc delete TDFileFilter;
模板题
\(\color{F39C11}普及-\)
\(\color{FFC116}普及/提高-\)
\(\color{52C41A}普及+/提高\)
\(\color{3498DB}提高+/省选-\)
\(\color{9D3DCF}省选/NOI-1\)
\(\color{9D3DCF}省选/NOI- 2\)
\(\color{0E1D69}NOI/NOI+/CTSC\)
//好玩的颜色:
//F39C11:普及
//FFC116:普及/提高-
//52C41A:普及+/提高
//3498DB:提高+/省选-
//9D3DCF:省选/NOI-
//9D3DCF:省选/NOI-
//0E1D69:NOI/NOI+/CTSC
My 缺省源:
//#pragma omp parallel for num_threads(64)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize(2,3,"Ofast","inline","-fgcse","-fgcse-lm","-fipa-sra","-ftree-pre","-ftree-vrp","-fpeephole2","-ffast-math","-fsched-spec","unroll-loops","-falign-jumps","-falign-loops","-falign-labels","-fdevirtualize","-fcaller-saves","-fcrossjumping","-fthread-jumps","-funroll-loops","-freorder-blocks","-fschedule-insns","inline-functions","-ftree-tail-merge","-fschedule-insns2","-fstrict-aliasing","-falign-functions","-fcse-follow-jumps","-fsched-interblock","-fpartial-inlining","no-stack-protector","-freorder-functions","-findirect-inlining","-fhoist-adjacent-loads","-frerun-cse-after-loop","inline-small-functions","-finline-small-functions","-ftree-switch-conversion","-foptimize-sibling-calls","-fexpensive-optimizations","inline-functions-called-once","-fdelete-null-pointer-checks")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
//#pragma comment(linker,"/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//--------------------------------------------------------神奇加速
#include<bits/stdc++.h>
//#include<windows.h>
//--------------------------------------------------------
#define ll long long
//#define int unsigned long long
#define i128 __int128
#define ull unsigned long long
#define pii pair<int,int>
#define fir first
#define se second
#define endl '\n'
#define end puts("")
#define debug1 puts("AK IOI -- part 1")
#define debug2 puts("AK IOI -- part 2")
#define debug3 puts("AK IOI -- part 3")
#define debug4 puts("AK IOI -- part 4")
#define re register
#define Yes puts("Yes")
#define No puts("No")
#define YES puts("YES")
#define NO puts("NO")
#define yes puts("yes")
#define no puts("no")
#define error puts("error")
#define IMPOSSIBLE puts("IMPOSSIBLE")
#define Impossible puts("Impossible")
#define fy puts("-1")
#define pll pair<long long, long long>
#define AC exit(0)
//
////-------------------------------------------------------define好习惯
//
using namespace std;
namespace gsczl71_function{
inline int Min(int a, int b) { return a < b ? a : b;}
inline int Max(int a, int b) { return a > b ? a : b;}
inline void my_swap(int& a,int& b) {a^=b,b^=a,a^=b;}
inline void to_min(int& a,int b) {if(a>b)a=b;}
inline void to_max(int& a,int b) {if(a<b)a=b;}
inline int my_abs(int x){return (x^(x>>31))-(x >> 31);}
inline ll gcd(ll a,ll b){
int i=__builtin_ctz(a),j=__builtin_ctz(b),x=i>j?j:i,y;b>>=j;
while(a){a>>=i;y=b-a;i=__builtin_ctz(y);b=a<b?a:b;a=y<0?-y:y;}
return b<<x;
}inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll jc(ll x,ll p){ll res=1;if(p)for(ll i(1);i<=x;++i)res=(res*i)%p;else for(ll i(1);i<=x;++i)res=(res*i);return res;}
inline ll mod(ll x, ll y){return x - y * (x / y);}
}
namespace gsczl71_fastIO{//输入后加 Ctrl + z
#define BUF_SIZE 100000
#define OUT_SIZE 100000
//fread->read
bool IOerror=0;
inline char nc(){
static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
if (p1==pend){
p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin);
if (pend==p1){IOerror=1;return -1;}
//{printf("IO error!\n");system("pause");for (;;);exit(0);}
}
return *p1++;
}
inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
inline void read(int &x){
bool sign=0; char ch=nc(); x=0;
for (;blank(ch);ch=nc());
if (IOerror)return;
if (ch=='-')sign=1,ch=nc();
for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
if (sign)x=-x;
}
inline void read(ll &x){
bool sign=0; char ch=nc(); x=0;
for (;blank(ch);ch=nc());
if (IOerror)return;
if (ch=='-')sign=1,ch=nc();
for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
if (sign)x=-x;
}
inline void read(double &x){
bool sign=0; char ch=nc(); x=0;
for (;blank(ch);ch=nc());
if (IOerror)return;
if (ch=='-')sign=1,ch=nc();
for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
if (ch=='.'){
double tmp=1; ch=nc();
for (;ch>='0'&&ch<='9';ch=nc())tmp/=10.0,x+=tmp*(ch-'0');
}
if (sign)x=-x;
}
inline void read(char *s){
char ch=nc();
for (;blank(ch);ch=nc());
if (IOerror)return;
for (;!blank(ch)&&!IOerror;ch=nc())*s++=ch;
*s=0;
}
inline void read(char &c){
for (c=nc();blank(c);c=nc());
if (IOerror){c=-1;return;}
}
//fwrite->write
struct Ostream_fwrite{
char *buf,*p1,*pend;
Ostream_fwrite(){buf=new char[BUF_SIZE];p1=buf;pend=buf+BUF_SIZE;}
void out(char ch){
if (p1==pend){
fwrite(buf,1,BUF_SIZE,stdout);p1=buf;
}
*p1++=ch;
}
void print(int x){
static char s[15],*s1;s1=s;
if (!x)*s1++='0';if (x<0)out('-'),x=-x;
while(x)*s1++=x%10+'0',x/=10;
while(s1--!=s)out(*s1);
}
void println(int x){
static char s[15],*s1;s1=s;
if (!x)*s1++='0';if (x<0)out('-'),x=-x;
while(x)*s1++=x%10+'0',x/=10;
while(s1--!=s)out(*s1); out('\n');
}
void print(ll x){
static char s[25],*s1;s1=s;
if (!x)*s1++='0';if (x<0)out('-'),x=-x;
while(x)*s1++=x%10+'0',x/=10;
while(s1--!=s)out(*s1);
}
void println(ll x){
static char s[25],*s1;s1=s;
if (!x)*s1++='0';if (x<0)out('-'),x=-x;
while(x)*s1++=x%10+'0',x/=10;
while(s1--!=s)out(*s1); out('\n');
}
void print(double x,int y){
static ll mul[]={1,10,100,1000,10000,100000,1000000,10000000,100000000,
1000000000,10000000000LL,100000000000LL,1000000000000LL,10000000000000LL,
100000000000000LL,1000000000000000LL,10000000000000000LL,100000000000000000LL};
if (x<-1e-12)out('-'),x=-x;x*=mul[y];
ll x1=(ll)floor(x); if (x-floor(x)>=0.5)++x1;
ll x2=x1/mul[y],x3=x1-x2*mul[y]; print(x2);
if (y>0){out('.'); for (size_t i=1;i<(y&&x3*mul[i]<mul[y]);out('0'),++i); print(x3);}
}
void println(double x,int y){print(x,y);out('\n');}
void print(char *s){while (*s)out(*s++);}
void println(char *s){while (*s)out(*s++);out('\n');}
void flush(){if (p1!=buf){fwrite(buf,1,p1-buf,stdout);p1=buf;}}
~Ostream_fwrite(){flush();}
}Ostream;
inline void print(int x){Ostream.print(x);}
inline void println(int x){Ostream.println(x);}
inline void print(char x){Ostream.out(x);}
inline void println(char x){Ostream.out(x);Ostream.out('\n');}
inline void print(ll x){Ostream.print(x);}
inline void println(ll x){Ostream.println(x);}
inline void print(double x,int y){Ostream.print(x,y);} //y为小数点后几位
inline void println(double x,int y){Ostream.println(x,y);}
inline void print(char *s){Ostream.print(s);}
inline void println(char *s){Ostream.println(s);}
inline void println(){Ostream.out('\n');}
inline void flush(){Ostream.flush();} //清空
#undef OUT_SIZE
#undef BUF_SIZE
};
using namespace gsczl71_fastIO;
using namespace gsczl71_function;
//-------------------------------------------------------主程序-----------------------------------------------------
//#define int long long
void solve(){
}
signed main(){
// freopen("std.in","r",stdin);
// freopen("std.out","w",stdout);
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int TTT=1;
// scanf("%d",&TTT);
while(TTT--){
solve();
}
return 0;
}
本文来自博客园,作者:gsczl71,转载请注明原文链接:https://www.cnblogs.com/gsczl71/p/17857576.html
gsczl71 AK IOI!RP = INF 2024年拿下七级勾!