oj.uz

Submission #470128

# Submission time Handle Problem Language Result Execution time Memory
470128 2021-09-03T04:41:57 Z Cross_Ratio Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 534 ms 214704 KB 
#include <bits/stdc++.h>
using namespace std;
#include "boxes.h"
const long long int INF = 1e18;
long long int A[50000006];
long long int B[50000006];
long long int cnt1 = 1, cnt2 = 1;
long long int C[50000006];
long long int D[50000006];
long long N, K, L;
long long delivery(int N1, int K1, int L1, int* P) {
    int i, j;
    N = N1;
    K = K1;
    L = L1;
    for(i=0;i<N;i++) {
        if(P[i] <= L/2) {
            A[cnt1++] = P[i];
        }
        else B[cnt2++] = L - P[i];
    }
    reverse(B + 1, B + cnt2);
    for(i=0;i<cnt1;i++) {
        if(!i) C[i] = 0;
        else if(i < K) C[i] = 2 * A[i];
        else C[i] = C[i-K] + 2*A[i];
    }
    for(i=0;i<cnt2;i++) {
        if(!i) D[i] = 0;
        else if(i < K) D[i] = 2 * B[i];
        else D[i] = D[i-K] + 2*B[i];
    }
    //for(i=0;i<cnt1;i++) cout << A[i] <<' ' << C[i] << '\n';
    //for(i=0;i<cnt2;i++) cout << B[i] << ' ' << D[i] << '\n';
    long long int ans = INF;
    ans = C[cnt1-1] + D[cnt2-1];
    for(i=max(cnt1-1-K,0LL);i<cnt1;i++) {
        j = max(0LL, cnt2 - K - 1+ (cnt1 - 1 - i) );
        long long int c = cnt1 - i + cnt2 - j - 2;
        long long ans2 = C[i] + D[j] + (c - 1 + K) / K * L;
        assert(ans2 >= 0);
        ans = min(ans, ans2);
    }
    for(i=max(cnt1-1-2*K,0LL);i<cnt1;i++) {
        j = max(0LL, cnt2 - 2*K - 1+ (cnt1 - 1 - i) );
        long long int c = cnt1 - i + cnt2 - j - 2;
        long long ans2 = C[i] + D[j] + (c - 1 + K) / K * L;
        assert(ans2 >= 0);
        ans = min(ans, ans2);
    }
    return ans;
    for(i=max(cnt1-1-K,0LL);i<cnt1;i++) {
        for(j=max(cnt2-1-K,0LL);j<cnt2;j++) {
            long long int c = cnt1 - i + cnt2 - j - 2;
            long long ans2 = C[i] + D[j] + (c - 1 + K) / K * L;
            assert(ans2 >= 0);
            ans = min(ans, ans2);
        }
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:37:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   37 |     for(i=max(cnt1-1-K,0LL);i<cnt1;i++) {
      |           ~~~^~~~~~~~~~~~~~
boxes.cpp:38:16: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   38 |         j = max(0LL, cnt2 - K - 1+ (cnt1 - 1 - i) );
      |             ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:44:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   44 |     for(i=max(cnt1-1-2*K,0LL);i<cnt1;i++) {
      |           ~~~^~~~~~~~~~~~~~~~
boxes.cpp:45:16: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   45 |         j = max(0LL, cnt2 - 2*K - 1+ (cnt1 - 1 - i) );
      |             ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:52:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   52 |     for(i=max(cnt1-1-K,0LL);i<cnt1;i++) {
      |           ~~~^~~~~~~~~~~~~~
boxes.cpp:53:18: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   53 |         for(j=max(cnt2-1-K,0LL);j<cnt2;j++) {
      |               ~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 56 ms 19888 KB Output is correct
34 Correct 20 ms 20004 KB Output is correct
35 Correct 20 ms 19988 KB Output is correct
36 Correct 59 ms 19928 KB Output is correct
37 Correct 58 ms 19912 KB Output is correct
38 Correct 50 ms 19904 KB Output is correct
39 Correct 45 ms 20004 KB Output is correct
40 Correct 26 ms 19908 KB Output is correct
41 Correct 55 ms 19896 KB Output is correct
42 Correct 27 ms 19908 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 56 ms 19888 KB Output is correct
34 Correct 20 ms 20004 KB Output is correct
35 Correct 20 ms 19988 KB Output is correct
36 Correct 59 ms 19928 KB Output is correct
37 Correct 58 ms 19912 KB Output is correct
38 Correct 50 ms 19904 KB Output is correct
39 Correct 45 ms 20004 KB Output is correct
40 Correct 26 ms 19908 KB Output is correct
41 Correct 55 ms 19896 KB Output is correct
42 Correct 27 ms 19908 KB Output is correct
43 Correct 521 ms 195968 KB Output is correct
44 Correct 214 ms 214704 KB Output is correct
45 Correct 213 ms 199912 KB Output is correct
46 Correct 526 ms 208376 KB Output is correct
47 Correct 515 ms 208372 KB Output is correct
48 Correct 517 ms 207140 KB Output is correct
49 Correct 482 ms 205896 KB Output is correct
50 Correct 278 ms 201784 KB Output is correct
51 Correct 534 ms 207096 KB Output is correct
52 Correct 273 ms 203020 KB Output is correct