oj.uz

답안 #322339

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
322339 2020-11-14T13:36:32 Z saarang123 Solar Storm (NOI20_solarstorm) C++14
10 / 100
 2000 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int MXN = 1e6 + 2;
ll dp[MXN][52];
signed main() {
    std::ios::sync_with_stdio(0);
    std::cout.tie(0);
    std::cin.tie(0);
    int n, s, k;
    cin >> n >> s >> k;
    vector<ll> a(n + 1), d(n + 1);
    vector<array<ll, 2>> c(n + 1);
    for(int i = 1; i < n; i++) cin >> d[i];
    for(int i = 1; i <= n; i++) cin >> a[i], a[i] += a[i - 1]; //prefix sums
    vector<ll> p(n + 1);
    for(int i = 1; i <= n; i++) p[i] = p[i - 1] + d[i - 1];
    //cout << "prefix sums: ";
    //for(int i = 1; i <= n; i++) cout << p[i] << ' '; cout << '\n';
    for(int i = 1; i <= n; i++) {
        int id = lower_bound(p.begin(), p.end(), p[i] + k) - p.begin();
        if(id > n || p[id] > p[i] + k) id--;
        //cout << id << ' ';
        c[i][0] += a[id] - a[i];
        c[i][1] = id + 1;
        id = lower_bound(p.begin(), p.end(), p[i] - k) - p.begin();
        c[i][0] += a[i] - a[id];
        if(id) c[i][0] += a[id] - a[id - 1];
        //cout << id << ' ' << c[i][0] << '\n';
    }
    for(int i = 1; i <= s; i++) dp[n][i] = a[n] - a[n - 1];
    for(int i = n - 1; i; i--) {
        for(int j = s; j; j--) {
            int nxt = c[i][1];
            dp[i][j] = c[i][0] + dp[nxt][j - 1];
        }
    }
    //cout << "dp:\n";
    //for(int i = 1; i <= n; i++) { for(int j = 0; j <= s; j++) cout << dp[i][j] << ' '; cout << '\n';}
    ll ans = 0;
    array<int, 2> best;
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j <= s; j++) {
            if(ans < dp[i][j]) ans = dp[i][j], best = {i, j};
        }
    }
    vector<int> shield;
    function<void(int i, int j)> out = [&] (int i, int j) {
        if(j == 0) return;
        shield.push_back(i);
        out(c[i][1], j - 1);
    };
    out(best[0], best[1]);
    //cout << ans << '\n';
    cout << shield.size() << '\n';
    for(int x : shield) cout << x << ' '; cout << '\n';
    return 0;
}

Compilation message

SolarStorm.cpp: In function 'int main()':
SolarStorm.cpp:57:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   57 |     for(int x : shield) cout << x << ' '; cout << '\n';
      |     ^~~
SolarStorm.cpp:57:43: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   57 |     for(int x : shield) cout << x << ' '; cout << '\n';
      |                                           ^~~~
SolarStorm.cpp:42:19: warning: 'best.std::array<int, 2>::_M_elems[0]' may be used uninitialized in this function [-Wmaybe-uninitialized]
   42 |     array<int, 2> best;
      |                   ^~~~
SolarStorm.cpp:42:19: warning: 'best.std::array<int, 2>::_M_elems[1]' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 7 ms 4460 KB Output is correct
3 Correct 6 ms 4972 KB Output is correct
4 Correct 3 ms 2284 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 4 ms 3948 KB Output is correct
7 Correct 4 ms 4332 KB Output is correct
8 Correct 6 ms 4972 KB Output is correct
9 Correct 4 ms 3308 KB Output is correct
10 Correct 6 ms 4716 KB Output is correct
11 Correct 6 ms 4972 KB Output is correct
12 Correct 3 ms 2156 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 192 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 7 ms 4460 KB Output is correct
3 Correct 6 ms 4972 KB Output is correct
4 Correct 3 ms 2284 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 4 ms 3948 KB Output is correct
7 Correct 4 ms 4332 KB Output is correct
8 Correct 6 ms 4972 KB Output is correct
9 Correct 4 ms 3308 KB Output is correct
10 Correct 6 ms 4716 KB Output is correct
11 Correct 6 ms 4972 KB Output is correct
12 Correct 3 ms 2156 KB Output is correct
13 Runtime error 192 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2050 ms 44048 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 7 ms 4460 KB Output is correct
3 Correct 6 ms 4972 KB Output is correct
4 Correct 3 ms 2284 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 4 ms 3948 KB Output is correct
7 Correct 4 ms 4332 KB Output is correct
8 Correct 6 ms 4972 KB Output is correct
9 Correct 4 ms 3308 KB Output is correct
10 Correct 6 ms 4716 KB Output is correct
11 Correct 6 ms 4972 KB Output is correct
12 Correct 3 ms 2156 KB Output is correct
13 Runtime error 56 ms 9580 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 7 ms 4460 KB Output is correct
3 Correct 6 ms 4972 KB Output is correct
4 Correct 3 ms 2284 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 4 ms 3948 KB Output is correct
7 Correct 4 ms 4332 KB Output is correct
8 Correct 6 ms 4972 KB Output is correct
9 Correct 4 ms 3308 KB Output is correct
10 Correct 6 ms 4716 KB Output is correct
11 Correct 6 ms 4972 KB Output is correct
12 Correct 3 ms 2156 KB Output is correct
13 Runtime error 192 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 7 ms 4460 KB Output is correct
3 Correct 6 ms 4972 KB Output is correct
4 Correct 3 ms 2284 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 4 ms 3948 KB Output is correct
7 Correct 4 ms 4332 KB Output is correct
8 Correct 6 ms 4972 KB Output is correct
9 Correct 4 ms 3308 KB Output is correct
10 Correct 6 ms 4716 KB Output is correct
11 Correct 6 ms 4972 KB Output is correct
12 Correct 3 ms 2156 KB Output is correct
13 Runtime error 192 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -