oj.uz

Submission #118394

# Submission time Handle Problem Language Result Execution time Memory
118394 2019-06-18T22:12:43 Z JustasZ Boxes with souvenirs (IOI15_boxes) C++14
25 / 100
 2 ms 384 KB 
    #include "boxes.h"
    #include <bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    #define pb push_back
    #define all(a) a.begin(), a.end()
    #define sz(a) (int)a.size()
    #define x first
    #define y second
    #define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
    #define rd() abs((int)rng())
    using namespace std;
    using namespace __gnu_pbds;
    template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
    typedef long long ll;
    typedef long double ld;
    typedef pair<int, int>pii;
    const int maxn = 1e5 + 100;
    const int mod = 1e9 + 7;
    mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
    ll delivery(int n, int k, int l, int pos[])
    {
    	sort(pos, pos + n);
    	vector<ll>pref(n + 1, 0), suf(n + 1, 0);
    	for(int i = 1; i <= n; i++)
    	{
    		pref[i] = pos[i - 1] * 2;
    		if(i - k >= 1)
    			pref[i] += pref[i - k];
    	}
    	for(int i = n; i >= 1; i--)
    	{
    		suf[i] = (l - pos[i - 1]) * 2;
    		if(i + k <= n)
    			suf[i] += suf[i + k];
    	}
    	ll ans = 1e18;
    	for(int i = 1; i < n; i++)
    	{
    		ans = min(ans, pref[i] + suf[i + 1]);
    		ll a = pref[i] + l;
    		if(i + k + 1 <= n)
    			a += suf[i + k + 1];
    		ans = min(ans, a);
    		a = suf[i] + l;
    		if(i - k - 1 >= 1)
    			a += pref[i - k - 1];
    		ans = min(ans, a);
    	}
    	ans = min(ans, pref[n]);
    	ans = min(ans, suf[1]);
    	return ans;
    }

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 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 384 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 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 384 KB Output is correct

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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