oj.uz

Submission #60722

# Submission time Handle Problem Language Result Execution time Memory
60722 2018-07-24T15:18:36 Z Flugan42 Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 231 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef long double lld;
#define rep(i,a,b) for(ll i = a; i < b; i++)
#define per(i,a,b) for(ll i = a; i >= b; i--)
#define all(x) x.begin(),x.end()
#define sz(x) (ll)(x).size()
#define trav(a,x) for(auto a : x)
#define inf 1000000000000000000

long long delivery(int N, int K, int L, int p[]) {
  ll best = inf,n = N,cur,res;
  vi a;
  rep(i,0,n) {
    if (p[i] == 0) n--;
    else a.push_back(p[i]);
  }

  rep(h,0,n+1) rep(v,0,n+1){
    if (h+v > n) break;
    ll l = n-h-v;
    res = ((l+K-1)/K)*L;
    cur = h-1;
    while(cur >= 0){
      res += a[cur]*2;
      cur -= K;
    }
    cur = n-v;
    while (cur < n){
      res += (L-a[cur])*2;
      cur += K;
    }
    best = min(best,res);
  }

  return best;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
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 Correct 211 ms 376 KB Output is correct
3 Correct 231 ms 256 KB Output is correct
4 Incorrect 109 ms 376 KB Output isn't correct
5 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 Correct 211 ms 376 KB Output is correct
3 Correct 231 ms 256 KB Output is correct
4 Incorrect 109 ms 376 KB Output isn't correct
5 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 Correct 211 ms 376 KB Output is correct
3 Correct 231 ms 256 KB Output is correct
4 Incorrect 109 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -