oj.uz

Submission #320765

# Submission time Handle Problem Language Result Execution time Memory
320765 2020-11-09T19:25:26 Z MarcoMeijer Safety (NOI18_safety) C++14
33 / 100
 2000 ms 3704 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;

ll n, h;
ll s[MX];
multiset<ll> st;

void program() {
    IN(n, h);
    RE(i,n) IN(s[i]);

    ll cur0 = 0;
    RE(i,n) {
        multiset<ll> nxtSt;
        int cnt = 0;
        FOR(j,st) {
            if(cnt >= st.size()/2) {
                nxtSt.insert(j+h);
            } else {
                cur0 -= j;
                nxtSt.insert(max(0ll,j-h));
                cur0 += max(0ll, j-h);
            }
            cnt++;
        }
        nxtSt.insert(s[i]); nxtSt.insert(s[i]);
        cur0 += s[i];
        st = nxtSt;
    }

    ll ans = cur0, lst = 0, axel = st.size()/2;
    FOR(i,st) {
        cur0 -= (i-lst)*axel;
        lst = i;
        ans = min(ans, cur0);
        axel--;
        if(axel == 0) break;
    }
    OUTL(ans);
}

Compilation message

safety.cpp: In function 'void program()':
safety.cpp:82:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             if(cnt >= st.size()/2) {
      |                ~~~~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2025 ms 3704 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 24 ms 492 KB Output is correct
14 Correct 23 ms 492 KB Output is correct
15 Correct 22 ms 492 KB Output is correct
16 Correct 24 ms 484 KB Output is correct
17 Correct 20 ms 408 KB Output is correct
18 Correct 14 ms 364 KB Output is correct
19 Correct 22 ms 492 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 24 ms 492 KB Output is correct
14 Correct 23 ms 492 KB Output is correct
15 Correct 22 ms 492 KB Output is correct
16 Correct 24 ms 484 KB Output is correct
17 Correct 20 ms 408 KB Output is correct
18 Correct 14 ms 364 KB Output is correct
19 Correct 22 ms 492 KB Output is correct
20 Correct 20 ms 492 KB Output is correct
21 Correct 24 ms 492 KB Output is correct
22 Correct 17 ms 492 KB Output is correct
23 Correct 17 ms 364 KB Output is correct
24 Correct 21 ms 492 KB Output is correct
25 Correct 18 ms 364 KB Output is correct
26 Correct 24 ms 488 KB Output is correct
27 Correct 26 ms 488 KB Output is correct

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 24 ms 492 KB Output is correct
14 Correct 23 ms 492 KB Output is correct
15 Correct 22 ms 492 KB Output is correct
16 Correct 24 ms 484 KB Output is correct
17 Correct 20 ms 408 KB Output is correct
18 Correct 14 ms 364 KB Output is correct
19 Correct 22 ms 492 KB Output is correct
20 Correct 20 ms 492 KB Output is correct
21 Correct 24 ms 492 KB Output is correct
22 Correct 17 ms 492 KB Output is correct
23 Correct 17 ms 364 KB Output is correct
24 Correct 21 ms 492 KB Output is correct
25 Correct 18 ms 364 KB Output is correct
26 Correct 24 ms 488 KB Output is correct
27 Correct 26 ms 488 KB Output is correct
28 Execution timed out 2085 ms 1228 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 24 ms 492 KB Output is correct
20 Correct 23 ms 492 KB Output is correct
21 Correct 22 ms 492 KB Output is correct
22 Correct 24 ms 484 KB Output is correct
23 Correct 20 ms 408 KB Output is correct
24 Correct 14 ms 364 KB Output is correct
25 Correct 22 ms 492 KB Output is correct
26 Correct 20 ms 492 KB Output is correct
27 Correct 24 ms 492 KB Output is correct
28 Correct 17 ms 492 KB Output is correct
29 Correct 17 ms 364 KB Output is correct
30 Correct 21 ms 492 KB Output is correct
31 Correct 18 ms 364 KB Output is correct
32 Correct 24 ms 488 KB Output is correct
33 Correct 26 ms 488 KB Output is correct
34 Execution timed out 2085 ms 1228 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Execution timed out 2025 ms 3704 KB Time limit exceeded
20 Halted 0 ms 0 KB -