oj.uz

Submission #60740

# Submission time Handle Problem Language Result Execution time Memory
60740 2018-07-24T15:46:42 Z Flugan42 Boxes with souvenirs (IOI15_boxes) C++14
50 / 100
 2000 ms 12528 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

ll n,myL,k;
vi a;

long long find(ll h, ll v){
  if (h+v > n) return inf;
  ll l = n-h-v;
  ll res = ((l+k-1)/k)*myL;
  ll cur = h-1;
  while(cur >= 0){
    res += a[cur]*2;
    cur -= k;
  }
  cur = n-v;
  while (cur < n){
    res += (myL-a[cur])*2;
    cur += k;
  }
  return res;
}

long long delivery(int N, int K, int L, int p[]) {
  ll best = inf; n = N, myL = L, k = K;
  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) best = min(best, find(h,v));
  return best;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 236 ms 380 KB Output is correct
3 Correct 221 ms 376 KB Output is correct
4 Correct 126 ms 376 KB Output is correct
5 Correct 209 ms 256 KB Output is correct
6 Correct 222 ms 388 KB Output is correct
7 Correct 214 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 416 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 36 ms 376 KB Output is correct
4 Correct 10 ms 376 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 10 ms 424 KB Output is correct
7 Correct 11 ms 476 KB Output is correct

Subtask #3
15.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 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 348 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 236 ms 380 KB Output is correct
3 Correct 221 ms 376 KB Output is correct
4 Correct 126 ms 376 KB Output is correct
5 Correct 209 ms 256 KB Output is correct
6 Correct 222 ms 388 KB Output is correct
7 Correct 214 ms 376 KB Output is correct
8 Correct 11 ms 416 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 36 ms 376 KB Output is correct
11 Correct 10 ms 376 KB Output is correct
12 Correct 10 ms 376 KB Output is correct
13 Correct 10 ms 424 KB Output is correct
14 Correct 11 ms 476 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 11 ms 256 KB Output is correct
24 Correct 7 ms 296 KB Output is correct
25 Correct 35 ms 372 KB Output is correct
26 Correct 10 ms 380 KB Output is correct
27 Correct 18 ms 376 KB Output is correct
28 Correct 12 ms 376 KB Output is correct
29 Correct 10 ms 376 KB Output is correct
30 Correct 10 ms 376 KB Output is correct
31 Correct 11 ms 376 KB Output is correct
32 Correct 10 ms 256 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 236 ms 380 KB Output is correct
3 Correct 221 ms 376 KB Output is correct
4 Correct 126 ms 376 KB Output is correct
5 Correct 209 ms 256 KB Output is correct
6 Correct 222 ms 388 KB Output is correct
7 Correct 214 ms 376 KB Output is correct
8 Correct 11 ms 416 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 36 ms 376 KB Output is correct
11 Correct 10 ms 376 KB Output is correct
12 Correct 10 ms 376 KB Output is correct
13 Correct 10 ms 424 KB Output is correct
14 Correct 11 ms 476 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 11 ms 256 KB Output is correct
24 Correct 7 ms 296 KB Output is correct
25 Correct 35 ms 372 KB Output is correct
26 Correct 10 ms 380 KB Output is correct
27 Correct 18 ms 376 KB Output is correct
28 Correct 12 ms 376 KB Output is correct
29 Correct 10 ms 376 KB Output is correct
30 Correct 10 ms 376 KB Output is correct
31 Correct 11 ms 376 KB Output is correct
32 Correct 10 ms 256 KB Output is correct
33 Execution timed out 2024 ms 12528 KB Time limit exceeded
34 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 236 ms 380 KB Output is correct
3 Correct 221 ms 376 KB Output is correct
4 Correct 126 ms 376 KB Output is correct
5 Correct 209 ms 256 KB Output is correct
6 Correct 222 ms 388 KB Output is correct
7 Correct 214 ms 376 KB Output is correct
8 Correct 11 ms 416 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 36 ms 376 KB Output is correct
11 Correct 10 ms 376 KB Output is correct
12 Correct 10 ms 376 KB Output is correct
13 Correct 10 ms 424 KB Output is correct
14 Correct 11 ms 476 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 11 ms 256 KB Output is correct
24 Correct 7 ms 296 KB Output is correct
25 Correct 35 ms 372 KB Output is correct
26 Correct 10 ms 380 KB Output is correct
27 Correct 18 ms 376 KB Output is correct
28 Correct 12 ms 376 KB Output is correct
29 Correct 10 ms 376 KB Output is correct
30 Correct 10 ms 376 KB Output is correct
31 Correct 11 ms 376 KB Output is correct
32 Correct 10 ms 256 KB Output is correct
33 Execution timed out 2024 ms 12528 KB Time limit exceeded
34 Halted 0 ms 0 KB -