Submission #62124939


Source Code Expand

// Example program
#include <iostream>
#include <string>
using namespace std;

int n, d, t[103], l[103];

int main()
{
    cin >> n >> d;
    for(int i=1; i<=n; i++) {
        cin >> t[i] >> l[i];
    }
    for(int k=1; k<=d; k++) {
        int mx=0;
        for(int i=1; i<=n; i++) {
            mx=max(mx,t[i]*(l[i]+k));
        }
        cout << mx << '\n';
    }
}

Submission Info

Submission Time
Task B - Heavy Snake
User alimq
Language C++ 20 (gcc 12.2)
Score 200
Code Size 388 Byte
Status AC
Exec Time 1 ms
Memory 3644 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 3428 KiB
sample01.txt AC 1 ms 3492 KiB
testcase00.txt AC 1 ms 3452 KiB
testcase01.txt AC 1 ms 3444 KiB
testcase02.txt AC 1 ms 3432 KiB
testcase03.txt AC 1 ms 3444 KiB
testcase04.txt AC 1 ms 3552 KiB
testcase05.txt AC 1 ms 3464 KiB
testcase06.txt AC 1 ms 3456 KiB
testcase07.txt AC 1 ms 3440 KiB
testcase08.txt AC 1 ms 3644 KiB
testcase09.txt AC 1 ms 3500 KiB
testcase10.txt AC 1 ms 3492 KiB
testcase11.txt AC 1 ms 3436 KiB