oj.uz

Submission #102223

# Submission time Handle Problem Language Result Execution time Memory
102223 2019-03-23T15:58:39 Z Leonardo_Paes Boxes with souvenirs (IOI15_boxes) C++11
10 / 100
 3 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 3e7 + 10;

typedef long long ll;

long long delivery(int N, int K, int L, int positions[MAXN]){

    long long x = N, sum=0;

    long long ini=0, fim=N-1;

    for(long long i=x; i>1; i-=K){
      //  cout << sum << endl;
        if(ini+(K-1)<=N-1 and fim-(K-1)>=0 and (2ll*(positions[ini+(K-1)]))<(2ll*(L-positions[fim-(K-1)]))){
            sum+=2ll*(positions[ini+(K-1)]);
            ini+=K;
        }
        else if (2ll*(L-positions[fim-(K-1)]) < L){
            sum+=2ll*(L-positions[fim-(K-1)]);
            fim-=K;
        }
        else{
            sum+=L;
            ini+=K;
        }
    }
    if(ini>N)positions[ini]=0;
    if(fim<0)fim=0, positions[fim]=0;
    sum+=min(2ll*positions[ini], 2ll*(L-positions[fim]));

    return sum;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 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 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Incorrect 3 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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