Submission #61556722

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, D;
    cin >> N >> D;
    vector<int> T(N), L(N);
    for (int i = 0; i < N; i++) {
        cin >> T[i] >> L[i];
    }

    for (int i = 1; i <= D; i++) {
        int ans = 0;
        for (int j = 0; j < N; j++) {
            ans = max(ans, T[j] * (L[j] + i));
        }
        cout << ans << endl;
    }
}

Submission Info

Submission Time
Task B - Heavy Snake
User thedekopin0108
Language C++ 20 (gcc 12.2)
Score 200
Code Size 398 Byte
Status AC
Exec Time 1 ms
Memory 3604 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 14
Set Name Test Cases
Sample sample00.txt, sample01.txt
All sample00.txt, sample01.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3400 KiB
sample01.txt AC 1 ms 3516 KiB
testcase00.txt AC 1 ms 3604 KiB
testcase01.txt AC 1 ms 3600 KiB
testcase02.txt AC 1 ms 3476 KiB
testcase03.txt AC 1 ms 3472 KiB
testcase04.txt AC 1 ms 3524 KiB
testcase05.txt AC 1 ms 3520 KiB
testcase06.txt AC 1 ms 3468 KiB
testcase07.txt AC 1 ms 3436 KiB
testcase08.txt AC 1 ms 3600 KiB
testcase09.txt AC 1 ms 3532 KiB
testcase10.txt AC 1 ms 3604 KiB
testcase11.txt AC 1 ms 3464 KiB