oj.uz

답안 #1091681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091681 2024-09-21T19:40:36 Z svm Snail (NOI18_snail) C++14
37 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>

#define TASK "snail"

using namespace std;

#define fst first
#define snd second

typedef long long int64;
typedef pair<int, int> pii;

int64 rdiv(int64 a, int64 b) {
    if (a <= 0) return 0;
    return (a + b - 1)/ b;
}

int main() {
    #ifndef ONLINE_JUDGE
    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);
    #endif
    cin.tie(0)->sync_with_stdio(false);
    int64 h; int n;
    cin >> h >> n;
    vector<int64> p (n + 5);
    int64 sum_p = 0, max_p = 0;
    for (int i = 0; i < n; i++) {
        cin >> p[i];
        sum_p += p[i];
        max_p = max(max_p, sum_p);
    }
    if (sum_p <= 0) {
        cout << "-1 -1\n";
        return 0;
    }
    int64 day = rdiv(h - max_p, sum_p);
    int64 curr_height = day * sum_p;
    if (curr_height >= h) {
        cout << day - 1 << ' ' << n - 1 << '\n';
        return 0;
    }
    for (int i = 0; i < n; i++) {
        curr_height += p[i];
        if (curr_height >= h) {
            cout << day << ' ' << i << '\n';
            return 0;
        }
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 Correct 0 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 344 KB Output is correct
6 Correct 1 ms 424 KB Output is correct

Subtask #3
0 / 25.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct

Subtask #5
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 424 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -