Şimdi Ara

Soru için yardım###C Programlama###

Sıcak Fırsatlarda Tıklananlar

Editörün Seçtiği Fırsatlar

Kärcher SC 3 Upright Buharlı Temizlik Makinesi, 3,5 Bar, 75 m² temizleme alanı : Amazon.com.tr: Ev ve Yaşam https://www.amazon.com.tr/dp/B0CGF9B2JT 5 ay önce paylaşıldı

Jack & Jones Erkek JACASHFORD MESH BACKPACK Çanta, Lacivert : Amazon.com.tr: Moda https://www.amazon.com.tr/gp/product/B0CHR1ZS41 2 sa. önce paylaşıldı

Süvari Erkek Slim Kalıp Armürlü Ceket Ct2021600306-m09 50 Fiyatları ve Özellikleri https://www.n11.com/urun/suvari-erkek-slim-kalip-armurlu-ceket-ct2021600306-m09-42154334 dün paylaşıldı

Daha Fazla

Bu Konudaki Kullanıcılar: Daha Az

2 Misafir - 2 Masaüstü

5 sn

2
Cevap

0
Favori

499
Tıklama

Daha Fazla
İstatistik

Konu İstatistikleri Yükleniyor

Konuya Özel

0 oy

Öne Çıkar

Cevapla

Sayfa: 1

Giriş

Mesaj

A terrain which has elevation differences is flooded with water. The water raises to some given
level (elevation). This leaves some part of the terrain above water as well as some parts under
water. So, it is quite possible that islands may form. You are supposed to count the islands and
provide one coordinate per island that belongs to that island.
It is possible to have lakes on an island but is assured that those lakes do not have further
islands in them (so The “Van” lake is possible but the island of “Akdamar” is impossible).
Furthermore you shall assume that somehow all waters secretly obey the Pascal principle (“Bile¸sik
kaplar prensibi”).

PROBLEM

You will be given the terrain information as a 512 × 512 1 byte elevation matrix M. M[x][y]
is holding the height of the point (x, y) (0 _ x, y < 512 and are integers). Furthermore 0 _
M[x][y] < 128 8x and 8y. You will also be given a height of water level W (0 < W < 128). You
shall assume that any point of the terrain that has an a height that is smaller or equal to W is
under water. You will determine how many islands are formed, output this count (n), and in
addition to this output n many lines each having a coordinate of a point of one island. You have
to provide one and only one coordinate per island. Which point you choose on an island is up to
you.
If a piece of terrain is partially (or fully) located (touching) at the edge(s) of the 512 × 512
grid, still it will count as an island. An island is the collection of terrain points, above water,
from which you can find a path to any other without having to pass the path through water. A
path is an ordered set of points where successive points have either their X coordinates the same
and their Y coordinates different only by one in magnitude (so can be y − 1 or y + 1); or have
their Y coordinates the same and have their X coordinates different only by one in magnitude
(so can be x − 1 or x + 1). But not both of them: in other words they have to touch either in
the X direction or in the Y direction, and not in the diagonal.

SPECIFICATIONS
• The first line of the input contains a single integer, the W value.
• From the following line (or lines) you will read 262144 (which is 512 × 512) integers of the
matrix M in row order. You are advised to skip over all white spaces.
• You are expected to output the count of islands n on the first line of the output.
• Then, on each of the following n many lines there will be an x value followed by an y. Each
line is a point on one of the islands.
• There will be no error in the input, so you do not need to perform any error check.
• There will be at most 100 islands.
• You can allocate only one array in your program. Namely, a 512 × 512 char array.

• Dynamic memory allocation is forbidden.
• The use of files throughout your program is forbidden