SO？

为什么 GF25 都占一半了

误闯天家（花广金狮的）

不要把我踢出去（球球了！）

#include <bits/stdc++.h>
using namespace std;
const int N=1e3+5,M=1e4+5;
struct stu {
	int p,u,v,w;
} g[M];
int n,m,cnt,sum,ans;
int fa[N];
int find(int x) {
	if(x==fa[x])return x;
	return fa[x]=find(fa[x]);
}
bool cmp(stu x,stu y) {
	return x.w<y.w;
}
int main() {
	cin>>n>>m;
	for(int i=1; i<=n; i++) {
		fa[i]=i;
	}
	for(int i=1; i<=m; i++) {
		cin>>g[i].p>>g[i].u>>g[i].v>>g[i].w;
	}
	for(int i=1;i<=m;i++){
		if(g[i].p==1){
			int x=find(g[i].u);
		    int y=find(g[i].v);
		    if(x!=y)fa[x]=y;
			sum+=g[i].w;
		}
		
	}
	sort(g+1,g+m+1,cmp);
	
	for(int i=1; i<=m; i++) {
		if(cnt==n-1)break;
		int x=find(g[i].u);
		int y=find(g[i].v);
		if(x==y)continue;
		else {
		    fa[x]=y;
		    if(g[i].p==1)continue;
			cnt++;
			sum+=g[i].w;
			
		}

	}
	cout<<sum;
	return 0;
}

洛谷测试数据全部 TLE

div.test-case {
    background-color: #052242 !important;
}

div.status {
    /* 不隐藏整个元素，只隐藏原始内容 */
    font-size: 0 !important;
    color: transparent !important;
    background: none !important;
    border: none !important;
    /* 但保持元素可见以便显示伪元素 */
    width: auto !important;
    height: auto !important;
    overflow: visible !important;
    display: block !important; /* 确保是块级元素 */
}
div.status::after {
    content: "TLE" !important;
    font-size: 20px !important;
     font-weight: normal !important;
    color: #fff !important;
    display: block !important;
    /* 确保伪元素独立显示 */
    position: relative !important;
    z-index: 1000 !important;
}

div.info {
    /* 不隐藏整个元素，只隐藏原始内容 */
    font-size: 0 !important;
    color: transparent !important;
    background: none !important;
    border: none !important;
    /* 但保持元素可见以便显示伪元素 */
    width: auto !important;
    height: auto !important;
    overflow: visible !important;
    display: block !important; /* 确保是块级元素 */
}
div.info::after {
    content: "1200y/102.00PB" !important;
    font-size: 10px !important;
     font-weight: normal !important;
    color: #fff !important;
    display: block !important;
    /* 确保伪元素独立显示 */
    position: relative !important;
    z-index: 1000 !important;
}

div.message {
    color: transparent !important;
    width: 100px;
    height: 15px;
}
div.message::after {
    content: "Time Limit Exceeded." !important;
    font-size: 12px !important;
    font-weight: normal !important;
    color: #fff !important;
    display: block !important;
    position: absolute !important;
    top: 50% !important;
    left: 50% !important;
    transform: translate(-50%, -50%) !important;
    z-index: 1000 !important;
    /* 解决换行问题的解决方案 */
    white-space: nowrap !important; /* 防止换行 */
    text-align: center !important; /* 居中对齐 */
    width: 100% !important; /* 占满容器宽度 */
}

一言观赏

main.mdl-layout__content {
    background-image: url(https://picsum.photos/1920/1080) !important;
    background-repeat: no-repeat;
    background-size: cover;
    background-position: center;
    background-attachment: fixed;
}

div.word {
    -webkit-text-stroke: 0.4px #000000; /* 描边 */
    text-shadow: 0 0 5px currentcolor, 0 0 10px currentcolor; /* 发光 */
}

div.mdl-layout__header-row, i.material-icons, header.mdl-layout__header.mdl-layout__header--scroll.mdl-layout__header--transparent, p {
    display: none !important;
}

面壁者不需要对自己的行为作出任何解释。

* { opacity: 0 !important; transition: opacity 0.3s ease !important; }
*:hover { opacity: 1.0 !important; }

让 DXD 以为你在打代码

#include <conio.h>
#include <iostream>
using namespace std;

string prt = R"(ABCDEF)";

int main()
{
	system("color F0");
	int i = 0, n = prt.size();
	while (i < n)
	{
		while (!_kbhit());
		_getch();
		cout << prt[i];
		++i;
	}
	return 0;
}

* { background-color: #20202000 !important; }
body { background-color: #202020 !important; }

*:not(a, strong) {
    color: #fff !important;
    font-weight: normal !important;
    text-shadow: 0 0 5px currentcolor, 0 0 10px currentcolor;
}
a {
    color: #e3f6ff !important;
    font-weight: normal !important;
    text-shadow: 0 0 3px currentcolor, 0 0 7px currentcolor;
}
strong {
    color: #c6c7ff !important;
    font-weight: bold !important;
    text-shadow: 0 0 3px currentcolor, 0 0 7px currentcolor;
}

img { opacity: 0.6; transition: opacity 0.3s ease !important; }
img:hover { opacity: 1.0; }

A test of pow in <cmath> and user define function fast pow.

#include <cmath>
#include <chrono>
#include <iostream>
using namespace std;
using namespace chrono; 
#define ll long long

ll time()
{
    auto now = high_resolution_clock::now();
    return duration_cast<milliseconds>(now.time_since_epoch()).count();
}

ll fpow(ll a, ll b, ll Mod)
{
	if (b == 0)return 1;
	if (b == 1)return (a % Mod);
	ll h = fpow(a, (b >> 1), Mod) % Mod;
	if (b & 1)return (h * h * a) % Mod;
	return (h * h) % Mod;
}

int main()
{
	ll a, b;
	while (cin >> a >> b)
	{
		int st = time();
		int c = int(pow(a, b)) % 1145;
		cout << "\"pow\" function in <cmath>: ";
		if (c < 0)cout << "can't get right answer\n";
		else cout << int(pow(a, b)) % 1145 << "\n";
		int et = time();
		cout << "use time: " << et - st << " ms\n\n";
		
		st = time();
		cout << "user define function \"fast pow\": " << fpow(a, b, 1145) << "\n";
		et = time();
		cout << "use time: " << et - st << " ms\n\n";
	}
	return 0;
}

尺规作图练习

正则表达式学习网站

Stylus

Stylus 样式查找

把洛谷改成BCOI

把BCOI改成小拨鼠

/*鼠标样式*/
    * {
        cursor: url(https://cdn.luogu.com.cn/upload/image_hosting/m0z68fn1.png), url(https://cdn.luogu.com.cn/upload/image_hosting/m0z68fn1.png), default !important;
    }

可以用这个做 C++ 中文版

#include <random>
#include <sstream>
#include <iostream>
#include <unordered_map>
using namespace std;
int randInt(int l, int r)
{
	static random_device rd;
	static mt19937 gen(rd());
    uniform_int_distribution<int> dist(l, r);
    return dist(gen);
}

unordered_map <string, string> def; // 宏替换，优先级最高
unordered_map <string, string> Turn; // 名转换，优先级最低 

string GetEn(string en)
{
	if (Turn.count(en))return Turn[en];
	string ret = ""; // 随机生成名 
	int lenght = randInt(5, 15); // 长度（反正不是给人看的 
	char fstCh = randInt('A', 'Z');
	--lenght;
	ret += fstCh;
	while (lenght--)
	{
		int type = randInt(1, 4);
		if (type == 1)ret += char(randInt('A', 'Z'));
		else if (type == 2)ret += char(randInt('a', 'z'));
		else if (type == 3)ret += char(randInt('0', '9'));
		else ret += '_';
	}
	Turn[en] = ret;
	return ret;
}

string toEn(string str)
{
	if (def.count(str))return toEn(def[str]);
	if (str == "#导入")return "#include";
	if (str == "使用")return "using";
	if (str == "命名空间")return "namespace";
	if (str == "标准")return "std"; 
	if (str == "主函数")return "main";
	
	if (str == "《输入输出流》")return "<iostream>";
	
	if (str == "无符号")return "unsigned";
	if (str == "有符号")return "signed";
	if (str == "整型")return "int";
	if (str == "字符串")return "string";
	if (str == "长整型")return "long long";
	if (str == "常量")return "const";
	
	if (str == "循环")return "for";
	if (str == "如果成立则循环")return "while"; 
	if (str == "返回")return "return";
	if (str == "如果")return "if";
	
	if (str == "输入")return "cin";
	if (str == "输出")return "cout";
	
	if (str == "或")return "||";
	if (str == "且")return "&&";
	if (str == "等于")return "==";
	if (str == "小于等于")return "<=";
	if (str == "小于")return "<";
	if (str == "大于")return ">";
	if (str == "大于等于")return ">=";
	if (str == "不等于")return "!=";
	if (str == "加")return "+";
	if (str == "加上")return "+=";
	if (str == "减")return "-";
	if (str == "减去")return "-=";
	if (str == "自增")return "++";
	if (str == "自减")return "--";
	if (str == "为")return "=";
	if (str == "（")return "(";
	if (str == "）")return ")";
	if (str == "（）")return "()";
	if (str == "【")return "[";
	if (str == "】")return "]";
	if (str == "；")return ";";
	if (str == "》》")return ">>";
	if (str == "《《")return "<<";
	if (str == "，")return ",";
	if (str == "？")return "?";
	if (str == "！")return "!";
	if (str == "“" || str == "”")return "\"";
	if (str == "{" || str == "}" || (str[0] >= '0' && str[0] <= '9'))return str;
	if (str[0] == '\\')return str.substr(1, str.size() - 1); 
	return GetEn(str); // 变量名
}

int main()
{
	freopen("code.in", "r", stdin);
	freopen("英文版.txt", "w", stdout);
	
	int Tabn = 0;
	string line;
	while (getline(cin, line))
	{
		stringstream sss(line);
		stringstream ss2(line);
		string inp, tab;
		while (ss2 >> tab)if (tab == "}")--Tabn;
		for (int i = 1; i <= Tabn; ++i)cout << "\t";
		bool flag = 1;
		while (sss >> inp)
		{
			if (inp == "#替换")
			{
				string bef, aft;
				sss >> bef >> aft;
				def[bef] = aft;
				flag = 0;
				continue;
			}
			if (inp == "{")++Tabn;
			cout << toEn(inp) << " ";
		}
		if (flag)cout << "\n";
	}
	return 0;
}

输入问题就能得到 AI 的回答（false）

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string a;
	getline(cin, a);
	a = "start https://chat.baidu.com/search?word=" + a;
	system(a.c_str());
	system("exit");
	return 0;
}

可以生成你在洛谷练习的表格

#include <map>
#include <iostream>
#include <algorithm>
using namespace std;

int n = 8;

string names[10] = {"", "暂无评定", "入门", "普及-", "普及/提高-", "普及+/提高", "提高+/省选-", "省选/NOI-", "NOI/NOI+/CTSC"};
string colors[10] = {"", "#bfbfbf", "#fe4c61", "#f39c11", "#ffc116", "#52c41a", "#3498db", "#9d3dcf", "#0e1d69"}; 
int lens[10], socs[10];

struct stu
{
	int name;
	int soc, len;
}a[10];

bool cmp(stu x, stu y)
{
	return x.soc > y.soc;
}

void print(int name, int len)
{
	cout << "\\textbf{" << names[name] << "} &: \\color{#ffffff}\\colorbox{" << colors[name] 
		 << "}{\\hspace{" << len / 20.0 << "cm}" << socs[name] << "\\hspace{" << len / 20.0 << "cm}} \\\\" << endl;
}

int main()
{
	//ios::sync_with_stdio(0);
	//cin.tie(0); cout.tie(0);
	
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i].soc;
		socs[i] = a[i].soc;
		a[i].name = i;
		if (a[i].soc == 0)a[i].soc = -1;
	}
	sort(a + 1, a + 9, cmp);
	
	a[1].len = 100;
	for (int i = 2; i <= n; ++i)
	{
		a[i].len = a[i].soc * a[i - 1].len / a[i - 1].soc;
	}
	
	for (int i = 1; i <= n; ++i)
	{
		lens[a[i].name] = a[i].len;
	}
	
	cout << "\\boxed{" << endl;
	cout << "\\begin{aligned}" << endl;
	for (int i = 1; i <= n; ++i)
	{
		print(i, lens[i]);
	}
	cout << "\\end{aligned}" << endl;
	cout << "}";
	return 0;
}