oj.uz

답안 #1058249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058249 2024-08-14T09:06:11 Z kachim2 Bikeparking (EGOI24_bikeparking) C++17
0 / 100
 1000 ms 4956 KB 
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main(){
    ll n;
    cin >> n;
    vector<ll> slots(n);
    vector<ll> users(n);
    for(ll i = 0; i < n; i++){
        cin >> slots[i];
    }
    for(ll i = 0; i < n; i++){
        cin >> users[i];
    }
    ll happy = 0;
    for(ll i = 0; i < n; i++){
        
        for(int j = 0;  j < i; j++){
            ll x= min(slots[j], users[i]);
            slots[j]-=x;
            users[i]-=x;
            happy+=x;
        }
        //ll x= min(slots[i], users[i]);
        //slots[i]-=x;
        //users[i]-=x;
        for(int j = i+1;  j < n; j++){
            ll x= min(slots[j], users[i]);
            slots[j]-=x;
            users[i]-=x;
            happy-=x;
        }
    }
    happy -= accumulate(users.begin(), users.end(), ll(0));
    cout << happy;
}

Subtask #1
0.0 / 16.0

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

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Execution timed out 1094 ms 4956 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

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

Subtask #5
0.0 / 32.0

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