{
"Default Template": {
"prefix": "src",
"body": [
"#include<bits/stdc++.h>",
"// #define int long long",
"",
"typedef long long ll;",
"typedef unsigned long long ull;",
"typedef std::pair<int, int> pii;",
"",
"#define rep(i, a, b) for(int i = (a);i <= (b);i++)",
"#define pre(i, a, b) for(int i = (a);i >= (b);i--)",
"#define rp(i, a) for(int i = 1; i <= (a); i++)",
"#define pr(i, a) for(int i = (a); i >= 1; i--)",
"#define go(i, x) for(auto i : x)",
"#define lowbit(x) (x & (-x))",
"",
"#define mp make_pair",
"#define pb push_back",
"#define gc getchar",
"#define fir first",
"#define sec second",
"",
"using namespace std;",
"",
"const int P = ${1:1e9 + 7}, L = ${2:2e5 + 5}, inf = ${3:2e9 + 5};",
"",
"inline ll qpow(ll a, ll b) { ll ans = 1, q = a; while(b) { if(b & 1) { ans *= q; ans %= P; } q *= q; q %= P; b >>= 1; } return ans; }",
"inline ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }",
"inline ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }",
"",
"namespace fast_IO {",
" template<typename T> inline void rd(T &x) {",
" x = 0; bool f = 0; char ch = getchar();",
" while (! isdigit(ch)) f |= (ch == '-'), ch = getchar();",
" while (isdigit(ch)) x = (x << 3) + (x << 1) + ch - '0', ch = getchar();",
" x = (f ? - x : x);",
" }",
" ",
" template<typename T, typename... Args> inline void rd(T &first, Args& ... args) {",
" rd(first);",
" rd(args...);",
" }",
" ",
" template<typename T> inline void write(T x, bool f) {",
" if (x < 0) x = -x, putchar('-'); static short Stack[50], top(0);",
" do Stack[++ top] = x % 10, x /= 10; while (x);",
" while (top) putchar(Stack[top --] | 48);",
" (f ? putchar('\\n') : putchar(' '));",
" }",
"} using namespace fast_IO;",
"",
"namespace fenwick { ",
" int t[L];",
" void add(int w, int num) {",
" while(w < L) t[w] += num, w += lowbit(w);",
" }",
" int query(int w) {",
" int sum = 0;",
" while(w) sum += t[w], w -= lowbit(w);",
" return sum;",
" }",
"}",
"",
"/***************************************************************************************************************************/",
"/* */",
"/***************************************************************************************************************************/",
"",
"signed main() {",
" $4",
" return 0;",
"}"
],
"description": "Default Template"
},
"Fenwick Tree Template": {
"prefix": "fenwick_tree",
"body": [
"namespace fenwick { ",
" int t[L];",
" void add(int w, int num) {",
" while(w < L) t[w] += num, w += lowbit(w);",
" }",
" int query(int w) {",
" int sum = 0;",
" while(w) sum += t[w], w -= lowbit(w);",
" return sum;",
" }",
"}"
],
"description": "Fenwick Tree Template"
},
"Segment Tree Template": {
"prefix": "segment_tree",
"body": [
"namespace segment_tree {",
" #define mid (l + r >> 1)",
" #define lson l, mid, L, R, w << 1",
" #define rson mid + 1, r, L, R, w << 1 | 1",
" struct node {",
" int num, w, lz;",
" } tr[L << 2];",
" void pushup(int w) { ",
" tr[w].num = max(tr[w << 1 | 1].num, tr[w << 1].num);",
" tr[w].num += tr[w].lz;",
" }",
" void pushdown(int w) {",
" tr[w << 1].num += tr[w].lz;",
" tr[w << 1 | 1].num += tr[w].lz;",
" tr[w << 1].lz += tr[w].lz;",
" tr[w << 1 | 1].lz += tr[w].lz;",
" tr[w].lz = 0;",
" }",
" int query(int l, int r, int L, int R, int w) {",
" if(L <= l && r <= R) return tr[w].num;",
" pushdown(w);",
" if(R <= mid) return query(lson);",
" if(L > mid) return query(rson);",
" return max(query(lson), query(rson));",
" }",
" void modify(int l, int r, int L, int R, int w, int num) {",
" if(L <= l && r <= R) return void(tr[w].lz += num), void(tr[w].num += num); pushdown(w);",
" if(R <= mid) return void(), modify(lson, num), pushup(w);",
" if(L > mid) return void(), modify(rson, num), pushup(w);",
" modify(lson, num), modify(rson, num), pushup(w);",
" }",
" void build(int l, int r, int w) {",
" if(l != r) {",
" build(l, mid, w << 1);",
" build(mid + 1, r, w << 1 | 1); pushup(w);",
" } else {",
" tr[w].num = ${1:-inf};",
" tr[w].lz = 0;",
" tr[w].w = 1;",
" }",
" }",
"}"
],
"description": "Segment Tree Template"
},
"optimize": {
"prefix": "optimize",
"body": [
"#pragma GCC optimize(3)",
"#pragma GCC target(\"avx\")",
"#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-small-functions\")",
"#pragma GCC optimize(\"-finline-small-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\")",
"#pragma GCC optimize(2)"
],
"description": "optimize"
}
}
{
"workbench.colorTheme": "Default Light Modern",
"security.allowedUNCHosts": [
"wsl.localhost"
],
"fileheader.customMade": {
"Author": "Linmobi & TLE_Automaton & ChinoKafuu",
"Date": "Do not edit",
"LastEditors": "Linmobi",
"LastEditTime": "Do not edit",
"FilePath": "no item name",
"Description": "Right Output ! & Accepted !",
},
"fileheader.cursorMode": {},
"fileheader.configObj": {
"createFileTime": true,
"language": {
"languagetest": {
"head": "/$$",
"middle": " $ @",
"end": " $/",
"functionSymbol": {
"head": "/** ",
"middle": " * @",
"end": " */"
},
"functionParams": "js"
}
},
"autoAdd": true,
"autoAddLine": 100,
"autoAlready": true,
"annotationStr": {
"head": "/*",
"middle": " * @",
"end": " */",
"use": false
},
"headInsertLine": {
"php": 2,
"sh": 2
},
"beforeAnnotation": {
"文件后缀": "该文件后缀的头部注释之前添加某些内容"
},
"afterAnnotation": {
"文件后缀": "该文件后缀的头部注释之后添加某些内容"
},
"specialOptions": {
"特殊字段": "自定义比如LastEditTime/LastEditors"
},
"switch": {
"newlineAddAnnotation": true
},
"supportAutoLanguage": [],
"prohibitAutoAdd": [
"json"
],
"folderBlacklist": [
"node_modules",
"文件夹禁止自动添加头部注释"
],
"prohibitItemAutoAdd": [
"项目的全称, 整个项目禁止自动添加头部注释, 可以使用快捷键添加"
],
"moveCursor": true,
"dateFormat": "YYYY-MM-DD HH:mm:ss",
"atSymbol": [
"@",
"@"
],
"atSymbolObj": {
"文件后缀": [
"头部注释@符号",
"函数注释@符号"
]
},
"colon": [
": ",
": "
],
"colonObj": {
"文件后缀": [
"头部注释冒号",
"函数注释冒号"
]
},
"filePathColon": "路径分隔符替换",
"showErrorMessage": false,
"writeLog": false,
"wideSame": false,
"wideNum": 13,
"functionWideNum": 0,
"CheckFileChange": false,
"createHeader": false,
"useWorker": false,
"designAddHead": false,
"headDesignName": "random",
"headDesign": false,
"cursorModeInternalAll": {},
"openFunctionParamsCheck": true,
"functionParamsShape": [
"{",
"}"
],
"functionBlankSpaceAll": {},
"functionTypeSymbol": "*",
"typeParamOrder": "type param",
"customHasHeadEnd": {},
"throttleTime": 60000,
"functionParamAddStr": "",
"NoMatchParams": "no show param"
}
}
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 无需6万激活码!GitHub神秘组织3小时极速复刻Manus,手把手教你使用OpenManus搭建本
· C#/.NET/.NET Core优秀项目和框架2025年2月简报
· Manus爆火,是硬核还是营销?
· 一文读懂知识蒸馏
· 终于写完轮子一部分:tcp代理 了,记录一下