oj.uz

답안 #784326

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784326 2023-07-16T02:58:08 Z Cookie Solar Storm (NOI20_solarstorm) C++14
62 / 100
 388 ms 127308 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("FEEDING.INP");
ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
using u128 = __uint128_t;
const int x[4] = {1, -1, 0, 0};
const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 7, inf = 1e16;
const int mxn = 1e6 + 5;
 
int n, s; ll k;
int up[mxn + 1][20], tor[mxn + 1];
ll d[mxn + 1], pd[mxn + 1], pv[mxn + 1], v[mxn + 1];
signed main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> s >> k;
    for(int i = 2; i <= n; i++){
        cin >> d[i]; pd[i] = pd[i - 1] + d[i];
    }
    for(int i = 1; i <= n; i++){
        cin >> v[i]; pv[i] = pv[i - 1] + v[i];
    }
    int r = 1;
    for(int i = 1; i <= n; i++){
        r = max(r, i);
        while(r <= n && pd[r] - pd[i] <= k)r++;
        tor[i] = r - 1; 
        //cout << tor[i] << " ";
    }
    for(int i = 1; i <= n; i++){
        up[i][0] = tor[tor[i]];
    }
    
    for(int i = 1; i < 19; i++){
        for(int j = 1; j <= n; j++){
            up[j][i] = up[min(up[j][i - 1] + 1, n)][i - 1];
        }
    }
    
    ll ans = 0, idl = 0;
    for(int i = 1; i <= n; i++){
        int r = i;
        for(int j = 0; j < 20; j++){
            if(s & (1 << j)){
                r = up[r][j] + 1;
                if(r == n + 1)break;
            }
        }
        r--;
        if(pv[r] - pv[i - 1] > ans){
            ans = pv[r] - pv[i - 1];
            idl = i;
        }
    }
    vt<int>res;
    while(idl <= n && s--){
        res.pb(tor[idl]); idl = up[idl][0] + 1;
    }
    cout << sz(res) << "\n";
    for(auto i: res){
        cout << i << " ";
    }
    return(0);
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 1364 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 2 ms 1364 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 1 ms 724 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 97804 KB Output is correct
2 Correct 136 ms 66964 KB Output is correct
3 Correct 159 ms 71700 KB Output is correct
4 Correct 166 ms 78156 KB Output is correct
5 Correct 195 ms 91560 KB Output is correct
6 Correct 272 ms 122132 KB Output is correct
7 Correct 183 ms 80740 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 1364 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 2 ms 1364 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 208 ms 97804 KB Output is correct
14 Correct 136 ms 66964 KB Output is correct
15 Correct 159 ms 71700 KB Output is correct
16 Correct 166 ms 78156 KB Output is correct
17 Correct 195 ms 91560 KB Output is correct
18 Correct 272 ms 122132 KB Output is correct
19 Correct 183 ms 80740 KB Output is correct
20 Correct 150 ms 69444 KB Output is correct
21 Correct 211 ms 85040 KB Output is correct
22 Correct 219 ms 100952 KB Output is correct
23 Correct 219 ms 101624 KB Output is correct
24 Correct 200 ms 93932 KB Output is correct
25 Correct 210 ms 93904 KB Output is correct
26 Correct 188 ms 70032 KB Output is correct
27 Correct 207 ms 89936 KB Output is correct
28 Correct 234 ms 88980 KB Output is correct
29 Correct 331 ms 115556 KB Output is correct
30 Correct 265 ms 94724 KB Output is correct
31 Correct 205 ms 82988 KB Output is correct

Subtask #4
0 / 8.0

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

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 1364 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 2 ms 1364 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 2 ms 1496 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 2 ms 1200 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 3 ms 1364 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 3 ms 1620 KB Output is correct
22 Correct 3 ms 1492 KB Output is correct
23 Correct 2 ms 1364 KB Output is correct
24 Correct 2 ms 1324 KB Output is correct
25 Correct 3 ms 1364 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 2 ms 1236 KB Output is correct
29 Correct 2 ms 1108 KB Output is correct
30 Correct 2 ms 1364 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 1364 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 2 ms 1364 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 208 ms 97804 KB Output is correct
14 Correct 136 ms 66964 KB Output is correct
15 Correct 159 ms 71700 KB Output is correct
16 Correct 166 ms 78156 KB Output is correct
17 Correct 195 ms 91560 KB Output is correct
18 Correct 272 ms 122132 KB Output is correct
19 Correct 183 ms 80740 KB Output is correct
20 Correct 150 ms 69444 KB Output is correct
21 Correct 211 ms 85040 KB Output is correct
22 Correct 219 ms 100952 KB Output is correct
23 Correct 219 ms 101624 KB Output is correct
24 Correct 200 ms 93932 KB Output is correct
25 Correct 210 ms 93904 KB Output is correct
26 Correct 188 ms 70032 KB Output is correct
27 Correct 207 ms 89936 KB Output is correct
28 Correct 234 ms 88980 KB Output is correct
29 Correct 331 ms 115556 KB Output is correct
30 Correct 265 ms 94724 KB Output is correct
31 Correct 205 ms 82988 KB Output is correct
32 Correct 254 ms 110948 KB Output is correct
33 Correct 184 ms 85028 KB Output is correct
34 Correct 310 ms 116920 KB Output is correct
35 Correct 189 ms 70336 KB Output is correct
36 Correct 199 ms 75372 KB Output is correct
37 Correct 227 ms 83060 KB Output is correct
38 Correct 388 ms 126340 KB Output is correct
39 Correct 233 ms 94844 KB Output is correct
40 Correct 328 ms 127308 KB Output is correct

Subtask #7
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 1364 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 2 ms 1364 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 208 ms 97804 KB Output is correct
14 Correct 136 ms 66964 KB Output is correct
15 Correct 159 ms 71700 KB Output is correct
16 Correct 166 ms 78156 KB Output is correct
17 Correct 195 ms 91560 KB Output is correct
18 Correct 272 ms 122132 KB Output is correct
19 Correct 183 ms 80740 KB Output is correct
20 Correct 150 ms 69444 KB Output is correct
21 Correct 211 ms 85040 KB Output is correct
22 Correct 219 ms 100952 KB Output is correct
23 Correct 219 ms 101624 KB Output is correct
24 Correct 200 ms 93932 KB Output is correct
25 Correct 210 ms 93904 KB Output is correct
26 Correct 188 ms 70032 KB Output is correct
27 Correct 207 ms 89936 KB Output is correct
28 Correct 234 ms 88980 KB Output is correct
29 Correct 331 ms 115556 KB Output is correct
30 Correct 265 ms 94724 KB Output is correct
31 Correct 205 ms 82988 KB Output is correct
32 Incorrect 239 ms 92000 KB Output isn't correct
33 Halted 0 ms 0 KB -