oj.uz

Submission #728428

# Submission time Handle Problem Language Result Execution time Memory
728428 2023-04-22T11:28:37 Z AndrijaM Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn=2e5+10;

long long delivery(int n, int K, int l, int p[])
{
    long long ans=0;
    int k=K;
    for(int i=0;i<n;i++)
    {
        if(k==0)
        {
            k=K;
            ans+=min(2*p[i-1],l);
        }
        k--;
    }
    if(k!=0)
    ans+=min(2*p[n-1],l);
    return ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -