oj.uz

답안 #287939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
287939 2020-09-01T07:05:32 Z PeppaPig Discharging (NOI20_discharging) C++14
20 / 100
 180 ms 13980 KB 
#include <bits/stdc++.h>

#define long long long

using namespace std;

const int N = 1e6 + 5;

struct CHT {
    struct line {
        long m, c;
        line(long m, long c) : m(m), c(c) {}
        long f(long x) { return m * x + c; }
    };
    vector<line> vec;

    bool bad(line a, line b, line c) {
        return (c.c - a.c) * (a.m - b.m) <= (b.c - a.c) * (a.m - c.m);
    }

    void add(long m, long c) {
        line l(m, c);
        while(vec.size() > 1 && bad(vec[(int)vec.size() - 2], vec.back(), l))
            vec.pop_back();
        vec.emplace_back(l);
    }

    long get_ans(long x) {
        if(vec.empty()) return 1e18;
        int l = 0, r = (int)vec.size() - 1;
        while(l < r) {
            int mid = (l + r) >> 1;
            if(vec[mid].f(x) >= vec[mid + 1].f(x))
                l = mid + 1;
            else r = mid;
        }
        return vec[r].f(x);
    }
} hull;

int n, A[N];
long dp[N];
vector<int> stk;

int main() {
    scanf("%d", &n);
    for(int i = n; i; i--) scanf("%d", A + i);

    for(int i = 1; i <= n; i++) {
        while(!stk.empty() && A[stk.back()] <= A[i])
            stk.pop_back();
        stk.emplace_back(i);
    }
    for(int i = 0; i < (int)stk.size(); i++) {
        hull.add(A[stk[i]], dp[i - 1]);
        dp[i] = hull.get_ans(stk[i]);
    }

    printf("%lld\n", dp[(int)stk.size() - 1]);

    return 0;
}

Compilation message

Discharging.cpp: In function 'int main()':
Discharging.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Discharging.cpp:47:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   47 |     for(int i = n; i; i--) scanf("%d", A + i);
      |                            ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct

Subtask #2
0 / 13.0

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

Subtask #3
0 / 25.0

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

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 13980 KB Output is correct
2 Correct 167 ms 13944 KB Output is correct
3 Correct 167 ms 13816 KB Output is correct
4 Correct 168 ms 13944 KB Output is correct
5 Correct 180 ms 13944 KB Output is correct
6 Correct 161 ms 13816 KB Output is correct
7 Correct 166 ms 13820 KB Output is correct
8 Correct 164 ms 13944 KB Output is correct
9 Correct 168 ms 13820 KB Output is correct
10 Correct 162 ms 13848 KB Output is correct

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Incorrect 1 ms 384 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #6
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Incorrect 1 ms 384 KB Output isn't correct
16 Halted 0 ms 0 KB -