xhlmy

UID: 940, 注册于 2024-6-21 8:56:27, 最后登录于 2026-4-21 19:09:43, 目前离线.

解决了 21 道题目，RP: 90 (No. 19)

个人简介

#include<bits/stdc++.h>
using namespace std;
struct node
{
	int x,y,step;
};
bool p;
int check[150][150];
int n,m;
char ma[150][150];
int dir[8][2]={0,1,1,0,0,-1,-1,0,1,1,1,-1,-1,1,-1,-1};
int func()
{
	int a,b,c,d;
	cin>>c>>d>>a>>b;
	if(!a) 
	{
		p=1;
		return 0;
	}
	memset(check,0,sizeof(check));
	for(int i=0;i<8;i++)
	{
		for(int j=1;1;j++)
		{
			int x=c+j*dir[i][0];
			int y=d+j*dir[i][1];
			if(ma[x][y]!='O') break;
			check[x][y]=2;
		}
	}
	check[c][d]=2;
	if(check[a][b]==2)
	{
		cout<<0<<endl;
		return 1;
	}
	queue<node>q;
	q.push({a,b,0});
	check[a][b]=1;
	while(!q.empty())
	{
		node temp=q.front();
		q.pop();
		for(int i=0;i<4;i++)
		{
			int x=temp.x+dir[i][0];
			int y=temp.y+dir[i][1];
			if(check[x][y]==2)
			{
				cout<<temp.step+1<<endl;
				return 1;
			}
			if(ma[x][y]=='O'&&check[x][y]!=1)
			{
				check[x][y]=1;
				q.push({x,y,temp.step+1});
			}
		}
	}
	cout<<"Impossible!"<<endl;
	return 1;
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cin>>ma[i][j];
	while(1)
	{
		func();
		if(p==1) return 0;
	}
}

#include<bits/stdc++.h>
using namespace std;
int n,x,y,a[2000][2000],q[20000][2],f,r;
bool vis[1000000];
int main(){
	cin>>n>>x>>y;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++) cin>>a[i][j];
	q[0][0]=x;
	q[0][1]=0;
	while(f<=r){
		int tmp=q[f][0];
		if(tmp==y){
			cout<<q[f][1]-1;
			return 0;
		}
		for(int i=1;i<=n;i++)
			if(a[tmp][i]==1&&!vis[i]){
				r++;
				q[r][0]=i;
				q[r][1]=q[f][1]+1;
				vis[i]=true;
			}
		f++;
	}
}

#include<bits/stdc++.h>
using namespace std;
long long a[2000000],b[2000000],n,ans,sum,maxn,t,s,p;
int main(){
	freopen("mood.in","r",stdin);
	freopen("mood.out","w",stdout);
	cin>>t;
	while(t--){
		cin>>n;
		p=ans=0;
		memset(b,0,sizeof(b));
		for(int i=1;i<=n;i++){
			cin>>a[i];
			if(a[i]==0) p=i;
			b[i]=b[i-1]+a[i];
			if(b[i]==0) ans++;
		}
		if(p==0) cout<<ans<<endl;
		else{
			sum=0;
			for(int i=1;i<p;i++) if(b[i]==0) sum++;
			sort(b+p,b+n+1);
			s=1;
			b[n+1]=b[n]-1;
			maxn=INT_MIN;
			for(int i=p+1;i<=n+1;i++)
				if(b[i]==b[i-1]) s++;
				else{
					if(s>maxn) maxn=s;
					s=1;
				}
			cout<<sum+maxn<<endl;
		}
	}
}

//测人心.2版
#include <bits/stdc++.h>
#include <windows.h>
using namespace std;
int main()
{
string x="";
int p=0;
char s=7;
system("color 24");
do{
cout<<"作";
Sleep(100);
cout<<"者";
Sleep(100);
cout<<"是";
Sleep(100);
cout<<"不";
Sleep(100);
cout<<"是";
Sleep(100);
cout<<"傻";
Sleep(100);
cout<<"逼";
Sleep(1000);
cout<<endl;
cout<<"是( A ).       ";
Sleep(1000);
cout<<"不是( B )."<<endl;
cin>>x;
if(x=="A"||x=="是"||x=="a") {
char s=7;
system("cls");
system("color 35");
Sleep(500);
cout<<"恭喜你答对了";
Sleep(1000);
cout<<endl;
Sleep(100);
cout<<"真";
Sleep(100);
cout<<"的";
Sleep(100);
cout<<"么? ";
Sleep(100);
cout<<"当";
Sleep(100);
cout<<"然";
Sleep(100);
cout<<"不";
Sleep(100);
cout<<"是";
cout<<endl;
Sleep(1000);
system("color 42");
cout<<"还敢骂我,电脑准备死机吧";
Sleep(1500);
cout<<endl;
cout<<3<<' ';
Sleep(1100);
cout<<2<<' ';
Sleep(1100);
cout<<1;
Sleep(1500);
cout<<endl;
cout<<"OK,你已经死亡";
Sleep(500);
while(1) system("start cmd");
break;
}
else if(x=="B"||x=="不是"||x=="b"){
system("cls");
system("color 35");
Sleep(1000);
cout<<"你回答的真好      ";
Sleep(1500);
cout<<"你回答的真好";
Sleep(1000);
cout<<endl<<"恭喜你答对了这些大美味送给你";
Sleep(1500);
cout<<"  划到我的主页最下面有好东西";
Sleep(1000);
cout<<endl<<"你";
Sleep(100);
cout<<"是";
Sleep(100);
cout<<"个";
Sleep(100);
cout<<"文";
Sleep(100);
cout<<"明";
Sleep(100);
cout<<"的";
Sleep(100);
cout<<"人";
Sleep(100);
cout<<",";
Sleep(100);
cout<<"快";
Sleep(100);
cout<<"去";
Sleep(100);
cout<<"玩";
Sleep(100);
cout<<"吧!";
Sleep(5000);
system("cls");
system("color 00");
cout<<' ';
Sleep(500);
break;
}
if(x=="88"||x=="爸爸"){
system("cls");
Sleep(1000);
system("color 35");
cout<<" 什";
Sleep(100);
cout<<"么";
Sleep(100);
cout<<"你";
Sleep(100);
cout<<"找";
Sleep(100);
cout<<"到";
Sleep(100);
cout<<"了";
Sleep(100);
cout<<"隐";
Sleep(100);
cout<<"藏";
Sleep(100);
cout<<"彩";
Sleep(100);
cout<<"蛋";
cout<<endl;
Sleep(1000);
cout<<"那么这些大美味也送给你  ";
Sleep(1000);
cout<<"划到我的主页最下面有好东西";
Sleep(1000);
cout<<endl<<"你";
Sleep(100);
cout<<"是";
Sleep(100);
cout<<"个";
Sleep(100);
cout<<"文";
Sleep(100);
cout<<"明";
Sleep(100);
cout<<"的";
Sleep(100);
cout<<"人";
Sleep(100);
cout<<",";
Sleep(100);
cout<<"快";
Sleep(100);
cout<<"去";
Sleep(100);
cout<<"玩";
Sleep(100);
cout<<"吧!";
Sleep(5000);
system("cls");
system("color 00");
cout<<' ';
Sleep(500);
break;	
}
if(x=="54188"){
char s=7;
system("cls");
system("color 35");
Sleep(500);
cout<<"恭喜你答对了";
Sleep(1000);
cout<<endl;
Sleep(100);
cout<<"真";
Sleep(100);
cout<<"的";
Sleep(100);
cout<<"么? ";
Sleep(100);
cout<<"当";
Sleep(100);
cout<<"然";
Sleep(100);
cout<<"不";
Sleep(100);
cout<<"是";
cout<<endl;
Sleep(1000);
system("color 42");
cout<<"还敢骂我,电脑准备死机吧";
Sleep(1500);
cout<<endl;
cout<<3<<' ';
Sleep(1100);
cout<<2<<' ';
Sleep(1100);
cout<<1;
Sleep(1500);
cout<<endl;
cout<<"OK,你已经死亡";
Sleep(500);
while(1) system("start cmd");
break;
}
p++;
if(p==1&&(x!="54188"||x!="88"||x!="爸爸")){
system("cls");
Sleep(500);
system("color 42");
cout<<"666,你选的是什么玩意,在给你一次机会";
Sleep(2500);
system("color 24");
system("cls");
}
if(p==2&&(x!="54188"||x!="88"||x!="爸爸")) {
system("cls");
Sleep(500);
system("color 42");
cout<<"还不选选项,你再不选一次试试";
Sleep(2500);
system("color 24");
system("cls");
}
if(p>=3&&(x!="54188"||x!="88"||x!="爸爸")){
system("cls");
Sleep(500);
system("color 42");
cout<<"怎么还不选选项,电脑死机吧";
Sleep(1500);
cout<<endl;
cout<<3<<' ';
Sleep(1100);
cout<<2<<' ';
Sleep(1100);
cout<<1;
cout<<endl;
Sleep(1500);
cout<<"OK,你已经死亡";
Sleep(500);
while(1)
system("start cmd");
break;
}
}
while(1);
return 0;
}

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<bits/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];
}

/* 1 深蓝色 2 深绿色 3 深青色 4 深红色 5 深粉色 6 黄色 7 深白色 8 灰色 9 浅蓝色 10 浅绿色 11 浅青色 12 浅红色 13 浅粉色 14 浅黄色 15 浅白色 */ `

Copy

http://play.mc.js.cool（我的世界）

http://b1.mc.js.cool（我的世界）

http://douyin.com（抖音）

http://4399.com ( 4399）

http://bilibili.com（哔哩哔哩）

http://b.mc.js.cool（我的世界）

http://hao.360.com (360）

http://poki.com (游戏）

http://about:blank (空屏)

http://backrooms-wiki-cn.wikidot.com （试逝？) mc.163.com nb

Copy

digdig.io yorg.io kirka.io

通过的题目
P1

P9

P29

P30

P32

CSPJ2021B
CSPJ2021C

CSPJ2021A

P106

P107

P109

P132
P133

P134

P135

P136

P155

P308
P309

P325

P370
最近活动

This person is lazy and didn't join any contests or homework.
最近编写的题解
分数线划定

分数线划定

出门旅行

分糖果

分糖果

分糖果

分糖果

分糖果

分糖果

分糖果

聪明人游戏: 4
2021: 2
CSP-J: 2
cspj 2021: 1
深搜广搜: 1
广搜: 1
大沥2021: 1
算法笔记: 1

xhlmy

个人简介

通过的题目

最近活动

最近编写的题解

题目标签

状态

开发

支持

xhlmy

个人简介

通过的题目

最近活动

最近编写的题解

题目标签

状态

开发

支持

还没有账户？

登录