oj.uz

Submission #132284

# Submission time Handle Problem Language Result Execution time Memory
132284 2019-07-18T16:15:10 Z reda Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 8 ms 376 KB 
#include<bits/stdc++.h>
#define MIN(a,b) ((a) < (b) ? (a) : (b))
#include"boxes.h"
using namespace std ;
long long  delivery( int n , int  k , int  l , int pos[])
{
    if(k==1){
   
    vector<int> arr(n);
    for(int i=0;i<n;i++)
    {
        arr[i]=MIN(-pos[i]+l , pos[i]  );

    }
    int c=0;
    while (*min_element(arr.begin(),arr.end())!= (int)1e9+5)
    {
    	//cout<<*min_element(pos.begin(),pos.end())<<endl;
        c+=*min_element(arr.begin(),arr.end())*2;
        *min_element(arr.begin(),arr.end())=(int)1e9+5;
    }
    return c;
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 8 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 8 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 8 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 8 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -