我的马蜂真的很AI吗？？？
2026-06-18 18:46:54
发布于：浙江
82阅读
0回复
0点赞
我的马蜂真的很AI吗？？？
难道你们不加空格吗？？？
放代码
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
long long h[N],a[N],b[N];
int main()
{
long long n,s,L;
cin >> n >> s >> L;
for(long long i = 1;i <= n;i++)
{
cin >> h[i];
}
for(long long i = 1;i <= n;i++)
{
cin >> a[i];
}
if(n == 1)
{
cout << (s-h[1])/a[1];
return 0;
}
long long ans = 1e18;
long long l = 0,r = 1e18;
while(l <= r)
{
long long mid = (l+r)/2;
for(long long i = 1;i <= n;i++)
{
long long now = h[i] + 1LL * a[i] * mid;
b[i] = now;
}
unsigned long long sum = 0;
sort(b+1,b+n+1);
for(int i = n;i >= 1;i--)
{
if(b[i] < L)
{
break;
}
sum += b[i];
if(sum >= s)
{
break;
}
}
if(sum >= s)
{
ans= min(ans,mid);
r = mid-1;
}
else l = mid + 1;
}
cout << ans;
}
#include <iostream>
using namespace std;
const int N = 30;
int sx,sy;
int ex,ey;
char a[N][N];
bool vis[N][N];
int n,m;
int ans = 1e9;
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
void dfs(int x,int y,int t)
{
if(x == ex&&y == ey)
{
ans = min(ans,t);
return ;
}
for(int i = 0;i < 4;i++)
{
int nx = x + dx[i];
int ny = y + dy[i];
if(a[nx][ny] =='W')
{
dfs(nx,ny,t+1);
}
if(ny >= 1&&ny <= m&&nx >= 1&&nx <= n&&vis[nx][ny] == 0&&a[nx][ny] == '.')
{
vis[nx][ny] = 1;
dfs(nx,ny,t+1);
vis[nx][ny] = 0;
}
if(ny >= 1&&ny <= m&&nx >= 1&&nx <= m&&vis[nx][ny] == 0&&a[nx][ny] >= '0'&&a[nx][ny] <= '9')
{
vis[nx][ny] = 1;
dfs(nx,ny,t+1+(a[nx][ny] - '0'));
vis[nx][ny] = 0;
}
}
}
int main()
{
cin >> n >> m;
for(int i = 1;i <= n;i++)
{
for(int j = 1;j <= m;j++)
{
cin >> a[i][j];
if(a[i][j] == 'Z')
{
sx = i;
sy = j;
}
if(a[i][j] == 'W')
{
ex = i;
ey = j;
}
}
}
vis[sx][sy] = 1;
dfs(sx,sy,0);
if(ans != 1e9) cout << ans;
else cout << "IMPOSSIBLE";
}
告诉我
全部评论 17
#include <iostream> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i=0;i<n;i++) { cin >> a[n]; } return 0; }2天前 来自 广东
0#include <iostream> using namespace std; int main(){ int h=2200,g=4396; cout <<g+h << endl; cout <<g-h << endl; cout <<g*h << endl; cout <<g/h << endl; cout <<g%h ; return 0; }3天前 来自 浙江
0确实基本不加空格，就拿我在洛谷做的唯一一道紫题说话吧（只不过没用后缀排序用的Hash）：
#include<bits/stdc++.h> using namespace std; #define ui unsigned #define mx 1000005 #define bs 97 #define io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); ui fac[mx]={1},hs[mx]; int n,s[mx]; char c[mx]; ui get(int l,int r){ if(l!=0) return hs[r]-hs[l-1]*fac[r-l+1]; return hs[r]; } bool cmp(int a,int b){ int l=0,r=min(n-a,n-b); while(l<r){ int mid=(l+r+1)/2; if(get(a,a+mid-1)==get(b,b+mid-1)) l=mid; else r=mid-1; } if(a+l==n || b+l==n) return a>b; return c[a+l]<c[b+l]; } int main(){ io; cin>>c; n=strlen(c); for(int i=1;i<=n;i++) fac[i]=fac[i-1]*bs; hs[0]=c[0]+1; for(int i=1;i<n;i++) hs[i]=hs[i-1]*bs+c[i]+1; for(int i=0;i<n;i++) s[i]=i; stable_sort(s,s+n,cmp); for(int i=0;i<n;i++) cout<<s[i]+1<<' '; }4天前 来自 浙江
0
有帮助，赞一个