oj.uz

Submission #307692

# Submission time Handle Problem Language Result Execution time Memory
307692 2020-09-29T05:56:23 Z kylych03 Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 1172 ms 196436 KB 
#include <bits/stdc++.h>
#include "boxes.h"
//#include "grader.cpp"
//#define int long long
using namespace std;
long long pra[10000001], prb[10000001];
long long delivery(int n, int k, int l, int p[]) {

    long long K = k;
    long long L = l;
    long long N = n;
    vector <long long > a,b;
    sort(p, p+N);
    for(int  i = 0; i < N; i++){
        if(p[i] <= L/2)
            a.push_back(p[i]);
        else
            b.push_back(L-p[i]);
    }
    sort(b.begin(), b.end());
    long long res = 0;

    for(long long  i = 0 ; i < a.size();i++)
        if(i<K)
            pra[i] = a[i]*2;
        else
            pra[i] = a[i] * 2 + pra[i-K];

    for(int  i = 0 ; i < b.size();i++)
        if(i<K)
            prb[i] = b[i]*2;
        else
            prb[i] = b[i] * 2 + prb[i-K];

    if( a.size()==0)
    res = prb[b.size() -1 ];
    else
    if(b.size()==0)
    res = pra[a.size() -1 ];
    else
    res = pra[a.size() - 1] + prb[b.size() -1 ];
    long long x = 0;
    for(long long i  = a.size() - 2, j= 1; j <= K && i>=0 ; j++,i--){
        if(b.size() >= K - j)
            x = prb[b.size() - (K-j)-1];
        else
            x = 0;
        res = min (res, pra[i] + L + x);
    }
    if(K==N)
        res = min (res, L);
    return res;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:23:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(long long  i = 0 ; i < a.size();i++)
      |                            ~~^~~~~~~~~~
boxes.cpp:29:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int  i = 0 ; i < b.size();i++)
      |                      ~~^~~~~~~~~~
boxes.cpp:44:21: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   44 |         if(b.size() >= K - j)
      |            ~~~~~~~~~^~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 90 ms 20784 KB Output is correct
34 Correct 52 ms 24796 KB Output is correct
35 Correct 55 ms 24796 KB Output is correct
36 Correct 92 ms 20832 KB Output is correct
37 Correct 90 ms 20820 KB Output is correct
38 Correct 77 ms 22752 KB Output is correct
39 Correct 90 ms 20828 KB Output is correct
40 Correct 62 ms 20836 KB Output is correct
41 Correct 106 ms 20904 KB Output is correct
42 Correct 70 ms 20956 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 90 ms 20784 KB Output is correct
34 Correct 52 ms 24796 KB Output is correct
35 Correct 55 ms 24796 KB Output is correct
36 Correct 92 ms 20832 KB Output is correct
37 Correct 90 ms 20820 KB Output is correct
38 Correct 77 ms 22752 KB Output is correct
39 Correct 90 ms 20828 KB Output is correct
40 Correct 62 ms 20836 KB Output is correct
41 Correct 106 ms 20904 KB Output is correct
42 Correct 70 ms 20956 KB Output is correct
43 Correct 998 ms 196312 KB Output is correct
44 Correct 526 ms 196248 KB Output is correct
45 Correct 600 ms 196180 KB Output is correct
46 Correct 776 ms 196308 KB Output is correct
47 Correct 917 ms 196412 KB Output is correct
48 Correct 986 ms 196436 KB Output is correct
49 Correct 1006 ms 196308 KB Output is correct
50 Correct 654 ms 196312 KB Output is correct
51 Correct 1172 ms 196408 KB Output is correct
52 Correct 764 ms 196436 KB Output is correct