oj.uz

Submission #589394

# Submission time Handle Problem Language Result Execution time Memory
589394 2022-07-04T14:42:23 Z web Boxes with souvenirs (IOI15_boxes) C++17
10 / 100
 1 ms 300 KB 
#include <iostream>
#include <iterator>
#include <algorithm>
#include <vector>
#include "boxes.h"
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    if(K == 1)
    {
        long long sum = 0;
        long long maxDist = L/2;
        for(int i = 0; i<N; ++i)
        {
            if(p[i] <= maxDist)
            {
                sum+= p[i];
            }
            else
            {
                sum += L - p[i];
            }
            //cout<<"new sum: "<<sum<<endl;
        }
        
        long long maxTravelled = 0;
        sum*=2;
       /* for(int i = 0; i<N; ++i)
        {
            if(min(p[i], L-p[i]) > maxTravelled)
                maxTravelled = min(p[i], L-p[i]);
        }
        sum -= maxTravelled;
        //cout<<"sum without last "<<sum<<endl;
        sum*=2;
        sum+=maxTravelled;*/
        //cout<<"final sum"<<sum<<endl;
        return sum;
    }
    
    return 0;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:26:19: warning: unused variable 'maxTravelled' [-Wunused-variable]
   26 |         long long maxTravelled = 0;
      |                   ^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

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 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -