oj.uz

Submission #693053

# Submission time Handle Problem Language Result Execution time Memory
693053 2023-02-02T10:09:13 Z saayan007 Solar Storm (NOI20_solarstorm) C++17
28 / 100
 225 ms 40940 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;

#define fur(i, a, b) for(ll i = a; i <= (ll) b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll) b; --i)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define nl "\n"

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

    ll n, s, k;
    cin >> n >> s >> k;
    ll d[n];
    fur(i, 1, n - 1) {
        cin >> d[i];
    }

    ll v[n + 1];
    fur(i, 1, n) {
        cin >> v[i];
    }

    ll x[n + 1];
    x[1] = 0;
    fur(i, 2, n) {
        x[i] = x[i - 1] + d[i - 1];
    }
    // fur(i, 1, n) {
        // cout << x[i] << ' ';
    // }
    // cout << nl;
    // fur(i, 1, n) {
        // cout << v[i] << ' ';
    // }
    // cout << nl;

    ll res = 0;
    ll best = 0;
    ll sum[n + 1];
    sum[0] = 0;
    fur(i, 1, n) {
        sum[i] = v[i] + sum[i - 1];
    }
    fur(i, 1, n) {
        ll r = upper_bound(x + 1, x + n + 1, x[i] + k) - x - 1;
        ll l = lower_bound(x + 1, x + n + 1, x[i] - k) - x - 1;
        if(sum[r] - sum[l] > res) {
            res = sum[r] - sum[l];
            best = i;
        }
    }
    cout << 1 << nl << best << nl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 27108 KB Output is correct
2 Correct 107 ms 17364 KB Output is correct
3 Correct 131 ms 18580 KB Output is correct
4 Correct 142 ms 20256 KB Output is correct
5 Correct 164 ms 23692 KB Output is correct
6 Correct 224 ms 31392 KB Output is correct
7 Correct 143 ms 20812 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 150 ms 27108 KB Output is correct
14 Correct 107 ms 17364 KB Output is correct
15 Correct 131 ms 18580 KB Output is correct
16 Correct 142 ms 20256 KB Output is correct
17 Correct 164 ms 23692 KB Output is correct
18 Correct 224 ms 31392 KB Output is correct
19 Correct 143 ms 20812 KB Output is correct
20 Correct 123 ms 24780 KB Output is correct
21 Correct 174 ms 30092 KB Output is correct
22 Correct 214 ms 35996 KB Output is correct
23 Correct 156 ms 34444 KB Output is correct
24 Correct 156 ms 33204 KB Output is correct
25 Correct 181 ms 33316 KB Output is correct
26 Correct 130 ms 24908 KB Output is correct
27 Correct 174 ms 31788 KB Output is correct
28 Correct 188 ms 31456 KB Output is correct
29 Correct 225 ms 40940 KB Output is correct
30 Correct 207 ms 33496 KB Output is correct
31 Correct 167 ms 29452 KB Output is correct

Subtask #4
0 / 8.0

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

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Incorrect 3 ms 468 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 150 ms 27108 KB Output is correct
14 Correct 107 ms 17364 KB Output is correct
15 Correct 131 ms 18580 KB Output is correct
16 Correct 142 ms 20256 KB Output is correct
17 Correct 164 ms 23692 KB Output is correct
18 Correct 224 ms 31392 KB Output is correct
19 Correct 143 ms 20812 KB Output is correct
20 Correct 123 ms 24780 KB Output is correct
21 Correct 174 ms 30092 KB Output is correct
22 Correct 214 ms 35996 KB Output is correct
23 Correct 156 ms 34444 KB Output is correct
24 Correct 156 ms 33204 KB Output is correct
25 Correct 181 ms 33316 KB Output is correct
26 Correct 130 ms 24908 KB Output is correct
27 Correct 174 ms 31788 KB Output is correct
28 Correct 188 ms 31456 KB Output is correct
29 Correct 225 ms 40940 KB Output is correct
30 Correct 207 ms 33496 KB Output is correct
31 Correct 167 ms 29452 KB Output is correct
32 Correct 206 ms 39460 KB Output is correct
33 Incorrect 173 ms 30164 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 150 ms 27108 KB Output is correct
14 Correct 107 ms 17364 KB Output is correct
15 Correct 131 ms 18580 KB Output is correct
16 Correct 142 ms 20256 KB Output is correct
17 Correct 164 ms 23692 KB Output is correct
18 Correct 224 ms 31392 KB Output is correct
19 Correct 143 ms 20812 KB Output is correct
20 Correct 123 ms 24780 KB Output is correct
21 Correct 174 ms 30092 KB Output is correct
22 Correct 214 ms 35996 KB Output is correct
23 Correct 156 ms 34444 KB Output is correct
24 Correct 156 ms 33204 KB Output is correct
25 Correct 181 ms 33316 KB Output is correct
26 Correct 130 ms 24908 KB Output is correct
27 Correct 174 ms 31788 KB Output is correct
28 Correct 188 ms 31456 KB Output is correct
29 Correct 225 ms 40940 KB Output is correct
30 Correct 207 ms 33496 KB Output is correct
31 Correct 167 ms 29452 KB Output is correct
32 Incorrect 176 ms 25220 KB Output isn't correct
33 Halted 0 ms 0 KB -