oj.uz

Submission #60830

# Submission time Handle Problem Language Result Execution time Memory
60830 2018-07-24T19:06:09 Z dukati8 Boxes with souvenirs (IOI15_boxes) C++14
20 / 100
 2 ms 380 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a; i<int(b); i++)
#define all(x) x.begin(),x.end()

long long delivery(int N, int K, int L, int p[]) {
    if (K==1) {
      long long tot=0;
      rep(i,0,N) {
        tot+=2*min(p[i],L-p[i]);
      }
      return tot;
    }
    map<long long,int> places;
    long long biggestplace=0;
    rep(i,0,N) {
      long long curr=p[i];
      biggestplace=max(biggestplace,curr);
      if (places.find(curr)!=places.begin()) places[curr]++;
      else places[curr]=1;
    }

    map<int,long long> dpthing; //This dp should be, for every possible amount of boxes that chould have been transported
    //to all the teams before and including the place we are at, minimum time to get there with those boxes
    dpthing.insert(make_pair(0,0));
    long long prevplace=0;
    long long extratime=0;
    int need=0;
    for (auto a:places) {
      long long loc=a.first;
      int amount=a.second;
      extratime+=(amount/K)*2*min(loc,L-loc);
      amount%=K;
      if (amount==0) continue;
      long long mintime=1000000000000000;
      need+=amount;
      vector<int> rem;
      for (auto b:dpthing) {
        int have=b.first;
        mintime=min(mintime,b.second);
        if (have>=need) break;
        rem.push_back(have);
      }
      for (auto b:rem) {
        dpthing.erase(b);
      }
      //Now everything in dpthing has enough for this new location, they move there and increase time by the distance
      extratime+=min(loc-prevplace,L-loc+prevplace);
      //We can also go back and fetch new boxes, this should be added to the previous smallest mintime
      mintime+=min(prevplace,L-prevplace) + min(loc,L-loc); //Time to go back and fetch more and go to new place
      mintime-=min(loc-prevplace,L-loc+prevplace); //This was added to extratime instead
      dpthing.insert(make_pair(need-amount+K,mintime)); //We would have need-amount+K after that
      prevplace=loc;
    }
    //Now we take the least value in dpthing, add time to get back and extratime to it
    long long best=1000000000000000;
    for (auto a:dpthing) {
      best=min(best,a.second);
    }
    return best + min(prevplace,L-prevplace) + extratime;

}

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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 296 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 296 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 296 KB Output is correct
10 Correct 2 ms 252 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Incorrect 2 ms 376 KB Output isn't correct
17 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 296 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 296 KB Output is correct
10 Correct 2 ms 252 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Incorrect 2 ms 376 KB Output isn't correct
17 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 296 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 296 KB Output is correct
10 Correct 2 ms 252 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Incorrect 2 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -