1.题目链接。题目的大意就是一张地图上，有很多个标志，其中@代表的是有油田，*代表的是没有油田。并且一个油田的八个方向相连的油田
原创
2022-07-01 10:17:58
23阅读
Oil Deposits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 48366 Accepted Submission(s): 27816 Problem Description The GeoSurvComp geol...
转载
2019-03-08 15:24:00
82阅读
2评论
#include
#include
原创
2023-08-23 10:28:51
64阅读
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16742 Accepted Submission(s): 9626
Problem Description
The GeoSurvComp
原创
2023-08-15 17:31:24
46阅读
2011-12-26 09:33:25地址：http://acm.hdu.edu.cn/showproblem.php?pid=1241题意：给map，求'@'的联通片数。mark：注意相邻是指周围8格区域内。循环内套bfs或dfs都可以。代码：# include <stdio.h>char graph[110][110] ;int n, m ;void dfs (int x, int y){ int i, xx, yy ; int tab[8][2] = {-1, -1, -1, 0, -1, 1, 0, -1, 0, 1, ...
转载
2012-01-06 23:46:00
49阅读
Problem DescriptionThe GeoSurvComp with one large rectangular region of land at a time, and creates a
原创
2023-06-28 19:21:51
49阅读
http://acm.hdu.edu.cn/showproblem.php?pid=1241水题#include "stdio.h"#include "string.h"#include "stdlib.h"#include "math.h"int m,n;int i,j,k,visit[100][100];char a[100][100];int main(){
原创
2023-03-03 12:45:08
77阅读
一、内容 The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divi...
原创
2022-02-03 09:47:36
175阅读
Oil Deposits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22931 Accepted Submission(s): 13213
转载
2016-05-20 21:49:00
44阅读
2评论
#include<stdio.h>#include<string.h>char a[110][110];int f[8][2]={{0,1},{0,-1},{-1,1},{-1,0},{-1,-1},{1,-1},{1,0},{1,1}};int m,n;int dfs(int i,int j){ for(int k=0;k<8;k++) { int x=i+f[k][0]; int y=j+f[k][1]; if(x>=0&&y>=0&&x<m&&y<n&&a[x][y]==
转载
2013-05-09 18:10:00
39阅读
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of
转载
2017-07-25 07:47:00
54阅读
HDU 1241 Oil Deposits
原创
2021-08-30 17:40:59
70阅读
Oil DepositsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11360Accepted Submission(s): 6626Probl...
转载
2015-12-24 10:36:00
83阅读
2评论
# 平台架构1241解析
在软件开发中，平台架构是一个至关重要的概念。平台架构指的是软件系统中各个组件之间的关系和交互方式。在平台架构1241中，数字代表了不同组件之间的层级关系，其中1代表最底层，4代表最顶层。通过这种层级结构，我们可以更好地组织和管理软件系统，提高系统的可维护性和可扩展性。
## 平台架构1241的解析
平台架构1241共包含四个层级：平台层（1）、服务层（2）、应用层（
原创
2024-05-19 04:45:02
60阅读
Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. Gime, and creates
原创
2022-11-10 00:00:24
21阅读
LightOJ - 1241PinocchioTime Limit: 500MS Memory Limit:
原创
2016-04-30 18:13:28
51阅读
D - Oil Deposits Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1241 D - Oil Deposits Submit Status P
转载
2016-07-28 19:07:00
26阅读
2评论
$flood-fill$裸题 \(DFS\) const int N=110; char g[N][N]; bool vis[N][N]; int n,m; bool check(int x,int y) { return x>=0 && x<n && y>=0 && y<m; } void dfs
转载
2020-12-18 22:50:00
63阅读
一、内容 The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divi...
原创
2021-08-27 14:21:13
209阅读
题目链接： https://vjudge.ppsucxtt.cn/problem/HDU-
1241 思路： 深搜找连通图数即可 代码： #include <iostream> #include <queue> #include <cstring> #include <algorithm> #incl ...
转载
2021-08-09 22:59:00
41阅读
2评论
