oj.uz

답안 #1054226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054226 2024-08-12T07:46:41 Z Kipras Safety (NOI18_safety) C++17
0 / 100
 8 ms 2520 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;

const ll maxC = 5010;

ll n, h;
vector<ll> diffs;

ll res = 1e18;
ll median = 0;
void solve() {
    vector<ll> a;
    for(int i = 0; i < n; i++) {
        ll aa;
        cin>>aa;
        a.push_back(aa);
        median+=aa;
    }
    median=(median+n/2)/n;
    res = 0;
    for(auto i : a) {
        res+=abs(i-median);
    }
    cout<<res<<"\n";
}

int main() {

    ios_base::sync_with_stdio(false);cin.tie(nullptr);

    cin>>n>>h;
    if(h==0) {
        solve();
        return 0;
    }
    ll aa;
    cin>>aa;
    for(int i = 0; i < n-1; i++) {
        ll bb;
        cin>>bb;
        diffs.push_back(bb-aa);
        //cout<<diffs.back()<<" ";
        aa=bb;
    }
    //cout<<"\n\n\n";


    ll lowB=0, highB=0;

    if(diffs[0]>0) {
        lowB=-diffs[0];
    }else {
        highB=-diffs[0];
    }
    diffs.push_back(0);
    ll lRes = 0;
    for(int i = 0; i < n-1; i++) {
        if(diffs[i]==0)continue;
        ll v = abs(diffs[i]);
        if(h>=v)continue;
        ll di = v-h;
        if(diffs[i]<0) {
            diffs[i]+=di;
            diffs[i+1]-=di;
        }else if(diffs[i]>0) {
            diffs[i]-=di;
            diffs[i+1]+=di;
        }
        //cout<<i<<" "<<di<<" "<<tmp[i]<<"\n";
        lRes+=di;
    }
    res=min(res, lRes);


    cout<<res<<endl;
    return 0;

}

Compilation message

safety.cpp: In function 'int main()':
safety.cpp:50:8: warning: variable 'lowB' set but not used [-Wunused-but-set-variable]
   50 |     ll lowB=0, highB=0;
      |        ^~~~
safety.cpp:50:16: warning: variable 'highB' set but not used [-Wunused-but-set-variable]
   50 |     ll lowB=0, highB=0;
      |                ^~~~~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 2520 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -