oj.uz

Submission #1071803

# Submission time Handle Problem Language Result Execution time Memory
1071803 2024-08-23T11:26:15 Z zh_h Snail (NOI18_snail) C++17
25 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
#define lint long long
#define pb push_back
#define mp make_pair
using namespace std;
lint MOD = 1e9 + 7;
int INF = 1e9;



int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    lint height, n;
    cin >> height >> n;
    vector<lint> p;
    lint ave=0;
    lint day0 = 0;
    for(lint i = 0; i < n; i ++){
        lint temp;
        cin >> temp;
        p.pb(temp);
        ave += temp;
        day0 += temp;
        if(day0 < 0){day0 = 0;}
    }

    if(ave <= 0){
        bool check = false;
        lint total = 0;
        for(lint j = 0; j < 2; j ++){
            for(lint i = 0; i < n; i ++){
                total += p[i];
                if(total < 0){total = 0;}
                // cout << total << endl;
                if(total >= height){check = true; cout << j << " " << i; break;}
            }
            if(total >= height){break;}
        }

        if(!check){cout << -1 << " " << -1;}
    }
    else{
        // cout << "hehe\n";
        lint highest = 0;
        lint count = day0;
        for(lint i = 0; i < n; i ++){
            count += p[i];
            highest = max(highest, count);
        }

        highest -= day0;

        // cout << height << " " << day0 << " " << highest << " " << ave << endl;

        lint N = (height - day0 - highest + ave - 1)/ave;

        lint total = (N*ave)+day0;
        // cout << N << " " << total << endl;

        for(int i = 0; i < n; i ++){
            // cout << "haha ";
            total += p[i];
            if(total >= height){
                // cout << total << endl;
                cout << N+1 << " " << i;
                break;
            }
        }
        

    }

    return 0;
}

// 10 3
// 2 -10 8
// 1 0
 
// 5 1
// -1
// -1 -1
 
// 5 2
// 4 -2
// 1 0
 
// 3 1
// 1
// 2 0

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 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 #4
0 / 17.0

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

Subtask #5
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -