Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

Problem G: Garbage Collection

Garbage truck is collecting garbage on its route starting at the dump and collecting garbage from pick up points in order (closest first). Garbage truck returns to the dump and empties its contents if it either

1. is full or
2. cannnot load the garbage at the current point because it will put the load over the weight limit (the truck driver has no way of knowing the weight of the garbage at a particular pick up point until the truck reaches that point) or
3. there are no more pick up points left

The pick up run ends when the truck returns to the dump after the case #3. In the case where both rule #1 and rule #3 apply, we consider only the latter one (the run is over). Also note that there are no partial pick ups (e.g. this is not allowed: get a portion of garbage at some point until truck is full and come back for the rest).

Given the weight limit that truck can carry and the list of pick up points with garbage weights, what is the distance that the truck will cover following the rules above?

Input Format

Input starts with an integer T on the first line, the number of test cases. Each case starts with the line with two integers W and N, the weight limit and the number of pick up points, respectively.
Then N lines follow, each containing integers x_i and w_i, the distance from the dump and the weight of the garbage at the pick up point respectively.
Constraints are as given: 1<=W<=1000, 1<=N<=1000, 0<x_i<=100,000, 1<=w_i<=W. Distances are distinct and given in order, i.e. for each i<j, x_i<x_j.

Output Format

For each test case output an integer on a line - the distance covered by the garbage truck.

Sample Input

3
2 2
1 1
2 2
6 3
1 1
2 2
3 3
3 3
1 2
2 2
3 1

Sample Output

8
6
10

---

Darko Aleksic
ACPC 2012

題目描述：

模擬垃圾車走的規則，計算走的總距離。
策略，滿的時候回去原點 0, 裝不下的時候回去原點 0, 所有點都被裝了回去原點 0

#include <stdio.h>

int main() {
    int testcase, w, n;
    int x[1005], ww[1005];
    int i, j;
    scanf("%d", &testcase);
    while(testcase--) {
        scanf("%d %d", &w, &n);
        for(i = 0; i < n; i++)
            scanf("%d %d", &x[i], &ww[i]);
        int v = 0, ret = 0;
        for(i = 0; i < n; i++) {
            if(v + ww[i] == w) {
                ret += x[i] + x[i];
                v = 0;
            } else if(v + ww[i] > w) {
                ret += x[i] + x[i];
                v = ww[i];
            } else {
                v += ww[i];
            }
        }
        if(v)   ret += x[n-1] + x[n-1];
        printf("%d\n", ret);
    }
    return 0;
}