xhlmy
UID: 940, 注册于 2024-6-21 8:56:27, 最后登录于 2025-7-17 18:33:06, 目前离线.
解决了 19 道题目，RP: 88 (No. 19)
-
个人简介
唐朝大诗人亚里士多德曾说：
一朝被蛇咬，处处闻啼鸟。
脚踏两条船，迟早要翻船。
脚踏万条船，翻都翻不完。
屏幕在深夜微微发亮
思想在那虚树路径上彷徨
平面的向量交错生长
织成 忧伤的网
剪枝剪去我们的疯狂
SPFA 告诉我前途在何方
01 背包装下了忧伤
笑颜 溢满脸庞
键盘微凉 鼠标微凉
指尖流淌 代码千行
凸包周长 直径多长
一进考场 全都忘光
你在 OJ 上提交了千百遍
却依然不能卡进那时限
双手敲尽代码也敲尽岁月
只有我一人
写的题解
凋零在 OJ 里面
Tarjan 陪伴强连通分量
生成树完成后思路才闪光
欧拉跑过的七桥古塘
让你 心驰神往
队列进出图上的方向
线段树区间修改求出总量
可持久化留下的迹象
我们 伏身欣赏
数论算法 图论算法
高斯费马 树上开花
线性规划 动态规划
时间爆炸 如何优化
我在 OI 中辗转了千百天
却不让我看 AK 最后一眼
我用空间换回超限的时间
随重新编译
测完样例
才发现漏洞满篇
原来CE 是因选错语言
其实爆零 只因忘写文件
如果标算太难 请坚定信念
不如回头 再看一眼题面
以那暴力模拟向正解吊唁
蒟蒻的蜕变
神犇出现
终将与 AC 擦肩
屏幕在深夜微微发亮
我心在考场...
(我是原创) 发坤之山， 其上多只因。 有鸟焉， 其状如坤， 中分首， 鸡喙， 鸡脚， 名曰坤坤， 其名蔡徐坤。 是炎帝之坤坤， 名曰I坤。 I坤游于东海， 溺而不返， 故为坤坤。 常衔坤山之木石， 以堙于东海。
mc 1.3.cpp: nnnnnnnn:
#include<bits/stdc++.h> using namespace std; int main() { cout<<(0%0)/(0%0); }#include<bits/stdc++.h> using namespace std; char s=7; int main() { for(int i=1;;i++) cout<<s;#include<bits/stdc++.h> using namespace std; int main() { for(int i=1;;i++) { cout<<"李林优和屠唯一是SB*"<<"!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"; } return 0; }#include<stdc++.h> using namespace std; int n=1; int main() { while(n) { cout<<111101000100100101010110100101; } }#include<bits/stdc++.h> using namespace std; int n,x,s,a[109]; int main() { cin>>n; while(n) { x++; s=n%10; n=n/10; a[x]=s; } cout<<x<<endl; for(int i=x;i>=1;i++) cout<<a[i]<<' '; cout<<endl; for(int i=1;i<=x;i++) cout<<a[i]; }//mc 1.3 //mc 1.3 #include <bits/stdc++.h> #include <conio.h> #include <windows.h> #include <time.h> #define KEY_DOWN(VK_NONAME) ((GetAsyncKeyState(VK_NONAME) & 0x8000) ? 1:0) #pragma GCC optimize(3,"Ofast","inline") int x,y; using namespace std; int Map[1024][1024],l[1024]; class Player { public: void move() { if(KEY_DOWN('A')&&Map[x][y-1]<=1&&Map[x-1][y-1]<=1) { y--; } if(KEY_DOWN('D')&&Map[x][y+1]<=1&&Map[x-1][y+1]<=1) { y++; } if(KEY_DOWN('W')&&Map[x-2][y]<=1) { x--; } if(KEY_DOWN('S')&&Map[x+1][y]<=1) { x++; } if(KEY_DOWN('1')) { Map[x+1][y]=0; } if(KEY_DOWN('2')) { Map[x][y-1]=0; } if(KEY_DOWN('4')) { Map[x-1][y-1]=0; } if(KEY_DOWN('6')) { Map[x-2][y]=0; } if(KEY_DOWN('5')) { Map[x-1][y+1]=0; } if(KEY_DOWN('3')) { Map[x][y+1]=0; } } }p1; struct Block { int rank; string image; int color; }; Block blocks[]={ {0," ",0},//air {1,"██",1},//water {2,"██",6},//dirt {3,"██",2},//grassdirt {4,"██",8},//rock {5,"██",15},//wood {6,"▓▓",10},//leaves {7,"▓▓",14}//sand }; //如果有问题用下面的 /*Block blocks[]={ {0," ",0},//air {1,"█",1},//water {2,"█",6},//dirt {3,"█",2},//grassdirt {4,"█",8},//rock {5,"█",15},//wood {6,"▓",10},//leaves {7,"▓",14}//sand };*/ inline void color(int n) { SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),n); } inline void draw_map() { for(int j=0;j<1024;j++) { for(int i=1023;i>=512;i--) { Map[i][j]=1; } } int h=512,k,f; for(int j=1;j<1023;j++) { l[j]=h; k=rand()%3; f=rand()%2; for(int i=h;i<=h+3;i++) { Map[i][j]=2; } for(int i=h+4;i<=1023;i++) { Map[i][j]=4; } if(f==1) h+=k; else h-=k; } for(int i=0;i<1024;i++) { for(int j=0;j<1024;j++) { if(Map[i][j]==1) { if(Map[i+1][j]!=1) { Map[i+1][j]=7; } if(Map[i][j+1]!=1) { Map[i][j+1]=7; } if(Map[i][j-1]!=1) { Map[i][j-1]=7; } if(Map[i-1][j]!=1) { Map[i-1][j]=0; } } } } int x,y; for(int i=1;i<=100;i++) { y=rand()%1024; x=l[y]+1; if(Map[x][y]!=1&&Map[x+1][y]==2) { Map[x][y]=5; Map[x-1][y]=5; Map[x-2][y-2]=6; Map[x-2][y-1]=6; Map[x-2][y]=6; Map[x-2][y+1]=6; Map[x-2][y+2]=6; Map[x-3][y-1]=6; Map[x-3][y]=6; Map[x-3][y+1]=6; Map[x-4][y-1]=6; Map[x-4][y]=6; Map[x-4][y+1]=6; l[y-2]+=3; l[y-1]+=5; l[y]+=5; l[y+1]+=5; l[y+2]+=3; } } } inline void print_map(int x,int y,int c,int r) { for(int i=x-c/2;i<=x+c/2;i++) { for(int j=y-r/2;j<=y+r/2;j++) { if(i==x-1&&j==y) color(14),cout<<"()"; else if(i==x&&j==y) color(1),cout<<"II"; else { color(blocks[Map[i][j]].color); cout<<blocks[Map[i][j]].image; } } cout<<endl; } color(7); cout<<"X:"; color(6); cout<<x<<endl; color(7); cout<<"Y:"; color(6); cout<<y; } inline void update() { system("cls"); for(int i=0;i<1024;i++) { for(int j=0;j<1024;j++) { if(Map[i][j]==2&&(Map[i-1][j]==0||Map[i-1][j]==6)) { Map[i][j]=3; } } } p1.move(); print_map(x,y,15,15); } inline void start() { ifstream fin("world.txt"); for(int i=0;i<1024;i++) { for(int j=0;j<1024;j++) { fin>>Map[i][j]; } } for(int i=0;i<1024;i++) { fin>>l[i]; } fin.close(); } inline void write() { ofstream fout("world.txt"); for(int i=0;i<1024;i++) { for(int j=0;j<1024;j++) { fout<<Map[i][j]<<" "; } } for(int i=0;i<1024;i++) { fout<<l[i]<<" "; } fout.close(); } int main() { SetConsoleTitle("MyWorlds"); srand(time(0)); draw_map(); int t=rand()%1024; x=l[t]-1; y=t; while(true) { update(); } return 0; } /* 1 深蓝色 2 深绿色 3 深青色 4 深红色 5 深粉色 6 黄色 7 深白色 8 灰色 9 浅蓝色 10 浅绿色 11 浅青色 12 浅红色 13 浅粉色 14 浅黄色 15 浅白色 */letters.cpp:
#include <bits/stdc++.h> using namespace std; string w[110],gw; bool f[20]; void print() { for(int i=0;i<gw.size();i++) { if(f[i]) cout<<gw[i]; else cout<<"_"; } } signed main() { int c=0; ifstream fin("words.txt"); for(int i=1;i<=90;i++) { fin>>w[i]; } fin.close(); srand(time(0)); gw=w[rand()%90+1]; for(int i=0;i<gw.size();i++) { if(gw[i]>='a'&&gw[i]<='z') f[i]=false; else f[i]=true; } char ch; while(true) { system("cls"); print(); cout<<"\nGusse:"; cin>>ch; for(int i=0;i<gw.size();i++) { if(gw[i]==ch) { f[i]=true; } } c++; if(c>10) { system("cls"); cout<<gw<<endl<<"You lost!"; return 0; } int l=1; for(int i=0;i<gw.size();i++) { if(f[i]==false) { l=0; break; } } if(l==1) { system("cls"); cout<<gw<<endl<<"You win!"; return 0; } } }words.txt:
because they're friend their really apparently immediate we're wear where beautiful discipline around possession brought found didn't upon about abound aired houses winters lamp apple reader drinking aunt deed somewhere pockets honey bottom nurse vain gaze victory excellent marriage actually park faces yellows listed asked roses eight stage departed beast intended presented broke greatly worship ourselves fault motion whistle journey everyone everything coming happened tried haunted scared receive believe know eating page wished drove remove imagine leave porch delight basket backed asleep rounder yesterday lowered patient kindly pride steaming c++#include <bits/stdc++.h> #include <conio.h> #include <windows.h> #include <time.h> #pragma GCC optimize(3,"Ofast","inline") #define key(VK_NONAME) ((GetAsyncKeyState(VK_NONAME) & 0x8000) ? 1:0) using namespace std; int x, y, sum; bool run, bai; int l[17][17]; bool f[16][16]; const int px[] = {-1, -1, -1, 0, 0, 1, 1, 1}; const int py[] = {-1, 0, 1, -1, 1, -1, 0, 1}; inline void clean() { system("cls"); } inline void color(int n) { SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),n); } inline void dig(int x, int y) { f[x][y] = true; sum++; if(!f[x - 1][y] && l[x - 1][y] == 0 && x - 1 > 0) { dig(x - 1, y); } if(!f[x + 1][y] && l[x + 1][y] == 0 && x + 1 < 16) { dig(x + 1, y); } if(!f[x][y - 1] && l[x][y - 1] == 0&& y - 1 > 0) { dig(x, y - 1); } if(!f[x][y + 1] && l[x][y + 1] == 0&& y + 1 < 16) { dig(x, y + 1); } } inline void print(int p) { for(int i = 1; i <= 17; i++) { printf("#"); } printf("\n# "); if(p == 1) { printf("'_'"); } if(p == 2) { printf(">_<"); } if(p == 3) { printf("^_^"); } printf(" #\n"); printf("#score:%d", sum); if(sum < 10) { printf(" "); } else if(sum < 100) { printf(" "); } else { printf(" "); } printf("#\n"); for(int i = 1; i <= 17; i++) { printf("#"); } printf("\n"); for(int i = 1; i <= 15; i++) { color(15); printf("#"); for(int j = 1; j <= 15; j++) { if(i == x && j == y) { color(4); if(f[i][j]) { if(l[i][j] == -1) { printf("*"); } else if(l[i][j] != 0) { printf("%d", l[i][j]); } else { printf(" "); } } else { printf("?"); } continue; } if(f[i][j]) { if(l[i][j] == -1) { color(4); printf("*"); } else if(l[i][j] != 0) { color(15); printf("%d", l[i][j]); } else { printf(" "); } } else { color(15); printf("?"); } } color(15); printf("#\n"); } for(int i = 1; i <= 17; i++) { printf("#"); } printf("\nX: %d Y: %d", x, y); } inline void init() { int dl = 0, x, y; for(int i = 1; i <= 15; i++) { for(int j = 1; j <= 15; j++) { f[i][j] = false; l[i][j] = 0; } } while(dl < 20) { x = rand() % 15 + 1; y = rand() % 15 + 1; if(l[x][y] != -1) { l[x][y] = -1; dl++; for(int k = 0; k <= 7; k++) { int tx = x + px[k]; int ty = y + py[k]; if(l[tx][ty] != -1) { l[tx][ty]++; } } } } } inline void update() { clean(); print(1); bool kd = false; do { if(key('A')) { y--; kd = true; } if(key('D')) { y++; kd = true; } if(key('W')) { x--; kd = true; } if(key('S')) { x++; kd = true; } if(key('Q')) { if(l[x][y] == -1) { clean(); for(int i = 1; i <= 15; i++) { for(int j = 1; j <= 15; j++) { f[i][j] = true; } } print(2); run = false; bai = true; return ; } else if(l[x][y] != 0) { f[x][y] = true; clean(); sum++; } else { dig(x, y); } kd = true; } }while(!kd); x = max(1, x); x = min(15, x); y = max(1, y); y = min(15, y); if(sum == 225) { run = false; } _sleep(100); } int main() { srand(time(0)); init(); x = 1; y = 1; run = true; bai = false; while(run) { update(); } if(!bai) { clean(); for(int i = 1; i <= 15; i++) { for(int j = 1; j <= 15; j++) { f[i][j] = true; } } print(3); } return 0; }digdig.io yorg.io kirka.io
415
已递交
332
已通过
0
题解被赞
题目标签
分支结构32顺序结构27简单循环25一维数组15while循环13枚举10排序6绍兴复赛真题32016年第十四届12021年第十九届12022年第二十届1诸暨市赛真题12023年1
状态
开发
支持
-
通过的题目
-
最近活动
This person is lazy and didn't join any contests or homework. -
最近编写的题解
题目标签
- 聪明人游戏
- 4
- 2021
- 1
- cspj 2021
- 1
- CSP-J
- 1
- 深搜 广搜
- 1
- 广搜
- 1
- 大沥2021
- 1