【免费】Codeforces题库201-294资源-CSDN文库

Codeforces

4星 · 超过85%的资源需积分: 0 115 浏览量 2013-04-11 10:40:05 上传评论收藏 4.13MB PDF 举报

资源详情

资源评论

CODEFORCES PROBLEMSET

#201-#294

2013-4-11

Sorted by Jerry Xu in Shanghai

Codeforces is a Russian website dedicated to competitive programming. It was created and

is currently maintained by group of sportsmen from Saratov State University led by Mikhail

Mirzayanov.

Codeforces provides to all users following main services:

Participation in the short (2-hours) contests, so-called "Codeforces Rounds", held about

once a week;

Ability to solve problems from previous contests for training purposes;

"Polygon" for creating and testing problems;

Kind of social-networking by using of internal public blogs.

Contestants are rated by system similar to ELO. There are usually no prizes for winners,

though 100 winners of 100-th Codeforces Round received a T-Shirt. Some bigger contests

(mostly country internal) are hosted on Codeforces base, among them "Yandex Algorithm

2011", provided by Yandex - one of biggest Russian IT-companies.

Website: Codeforces.com

that the square in the north-west corner has coordinates (1, 1) and the square in

the south-east corner has coordinates (n, m). See the picture in the notes for

clarifications.

Before the game show the organizers offer Yura to occupy any of the

(n + 1)·(m + 1) intersection points of the dividing lines. After that he can start

guessing the cars. After Yura chooses a point, he will be prohibited to move along

the parking lot before the end of the game show. As Yura is a car expert, he will

always guess all cars he is offered, it's just a matter of time. Yura knows that to

guess each car he needs to spend time equal to the square of the euclidean

distance between his point and the center of the square with this car, multiplied by

some coefficient characterizing the machine's "rarity" (the rarer the car is, the harder

it is to guess it). More formally, guessing a car with "rarity" c placed in a square

whose center is at distance d from Yura takes c·d

seconds. The time Yura spends

on turning his head can be neglected.

It just so happened that Yura knows the "rarity" of each car on the parking lot in

advance. Help him choose his point so that the total time of guessing all cars is the

smallest possible.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 1000) — the sizes of the

parking lot. Each of the next n lines contains m integers: the j-th number in the i-th

line describes the "rarity" c

(0 ≤ c

≤ 100000) of the car that is located in the

square with coordinates (i, j).

Output

In the first line print the minimum total time Yura needs to guess all offered cars. In

the second line print two numbers l

and l

(0 ≤ l

≤ n, 0 ≤ l

≤ m) — the numbers of

dividing lines that form a junction that Yura should choose to stand on at the

beginning of the game show. If there are multiple optimal starting points, print the

point with smaller l

. If there are still multiple such points, print the point with smaller

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is

preferred to use the cin, cout streams or the %I64d specifier.

Sample test(s)

Input

剩余699页未读，继续阅读

评论收藏

内容反馈

ZhEngYuana

2014-04-04

比价有用对我有些用处的

Codeforces 题库 201-294

评论1

最新资源

Codeforces 题库 201-294

评论1

最新资源

相关推荐

Codeforces 题库 101-200

Codeforces 题库 001-100

leetcode题库-cp-wiki:cp维基

leetcode题库-Coding.Python:基于Python的Leetcode、Codeforces部分题解和数据结构、算法专题

CodeforcesGrabber:Codeforces 竞赛的捕食者

leetcode题库-NTU_ACM:NTU_ACM

leetcode下载-Qu.Code:问题代码

leetcode双人赛----:---

leetcode双人赛-acm-challenge-workbook:acm-挑战-工作簿

leetcode双人赛-C:acm-挑战-工作簿

leetcode双人赛-algorithm:算法

Qt上位机软件串口通讯，视频源码，免费下载

代码随想录算法PDF.rar

张玉生《C语言程序设计》双色版 C语言程序设计理论教材习题参考答案.pdf

cloud compare用户手册（中文+英文）

CRC8/CRC16/CRC32常见几个标准的算法及C语言实现

STM32F4 ADC采样FFT运算测试代码

第十二届蓝桥杯大赛模拟赛（第三期）.pdf

Qt Qss三套样式文件 qss.zip

C++读取excel数据

点云粗配准算法

2021csp-j初赛试题及答案.docx

基于STM32F103+ADS1292的心率实时显示（串口助手），心电图波形

C++语言程序设计第五版郑莉

点云完全配准算法比较

Halcon实战视频教程，超人视觉，初级和高级版视频，无密码高清

【C++】开发软件资料集.zip

通俗易懂的校园导航系统

STM32F103开发的无刷直流电机控制FOC