A N bulbs
Problem Description
N bulbs are in a row from left to right,some are on, and some are off.The first bulb is the most left one. And the last one is the most right one.they are numbered from 1 to n,from left to right. 阅读全文 »
Codeforces Round #336(Div.2) (1/5) (Div.1) (0/5)
maksyuki 发表于 比赛 分类，标签: 比赛-codeforces
26
12月
2015
A Saitama Destroys Hotel
Saitama accidentally destroyed a hotel again. To repay the hotel company, Genos has volunteered to operate an elevator in one of its other hotels. The elevator is special — it starts on the top floor, can only move down, and has infinite capacity. Floors are numbered from 0 to s and elevator initially starts on floor s at time 0.
The elevator takes exactly 1 second to move down exactly 1 floor and negligible time to pick up passengers. Genos is given a list detailing when and on which floor passengers arrive. Please determine how long in seconds it will take Genos to bring all passengers to floor 0.
Input
The first line of input contains two integers n and s (1 ≤ n ≤ 100, 1 ≤ s ≤ 1000) — the number of passengers and the number of the top floor respectively.
The next n lines each contain two space-separated integers fi and ti (1 ≤ fi ≤ s, 1 ≤ ti ≤ 1000) — the floor and the time of arrival in seconds for the passenger number i.
Output
Print a single integer — the minimum amount of time in seconds needed to bring all the passengers to floor 0.
Sample test(s)
input
3 7
2 1
3 8
5 2
output
11
input
5 10
2 77
3 33
8 21
9 12
10 64
output
79
Note
In the first sample, it takes at least 11 seconds to bring all passengers to floor 0. Here is how this could be done:
- Move to floor 5: takes 2seconds.
- Pick up passenger 3.
- Move to floor 3: takes 2seconds.
- Wait for passenger 2to arrive: takes 4seconds.
- Pick up passenger 2.
- Go to floor 2: takes 1second.
- Pick up passenger 1.
- Go to floor 0: takes 2seconds.
This gives a total of 2 + 2 + 4 + 1 + 2 = 11 seconds.
题目类型：简单模拟
算法分析：先按照楼层排序，最后从上到下模拟计算即可
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 |
/************************************************* Author :supermaker Created Time :2015/12/24 0:11:13 File Location :C:\Users\abcd\Desktop\TheEternalPoet **************************************************/ #pragma comment(linker, "/STACK:102400000,102400000") #include <set> #include <bitset> #include <list> #include <map> #include <stack> #include <queue> #include <deque> #include <string> #include <vector> #include <ios> #include <iostream> #include <fstream> #include <sstream> #include <iomanip> #include <algorithm> #include <utility> #include <complex> #include <numeric> #include <functional> #include <cmath> #include <ctime> #include <climits> #include <cstdarg> #include <cstdio> #include <cstdlib> #include <cstring> #include <cctype> #include <cassert> using namespace std; #define CFF freopen ("aaa.txt", "r", stdin) #define CPPFF ifstream cin ("aaa.txt") #define DB(ccc) cout << #ccc << " = " << ccc << endl #define PB push_back #define MP(A, B) make_pair(A, B) typedef long long LL; typedef unsigned long long ULL; typedef double DB; typedef pair <int, int> PII; typedef pair <int, bool> PIB; const int INF = 0x7F7F7F7F; const int MOD = 1e9 + 7; const double EPS = 1e-10; const double PI = 2 * acos (0.0); const int maxn = 1e5 + 6666; struct node { int a, b; }; bool operator < (const node &a, const node &b) { return a.a < b.a; }; node aa[maxn]; int main() { //CFF; //CPPFF; int n, s; while (scanf ("%d%d", &n, &s) != EOF) { for (int i = 1; i <= n; i++) scanf ("%d%d", &aa[i].a, &aa[i].b); sort (aa + 1, aa + 1 + n); LL res = 0, tt = 0; aa[n+1].a = s, aa[n+1].b = 0; aa[0].a = 0, aa[0].b = 0; for (int i = n + 1; i >= 1; i--) { res += aa[i].a - aa[i-1].a; tt += aa[i].a - aa[i-1].a; if (tt < aa[i-1].b) { res += aa[i-1].b - tt; int ta = aa[i-1].b - tt; tt += ta; } } printf ("%I64d\n", res); } return 0; } |