oj.uz

답안 #213635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
213635 2020-03-26T09:58:21 Z PeppaPig Semiexpress (JOI17_semiexpress) C++14
0 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>

#define long long long

using namespace std;

const int N = 3e3+5;

struct item {
    long cnt, idx; int pos;
    item(long cnt, long idx, int pos) : cnt(cnt), idx(idx), pos(pos) {}
    friend bool operator<(const item &a, const item &b) {
        return a.cnt < b.cnt;
    }
};

int n, m, k;
long A, B, C, T, ans;
long st[N], dist[N];

long get_cnt(int i, long l, long r) {
    long t = (l - st[i]) * C + dist[i];
    if(t > T) return 0;
    return min((T - t) / A + 1, r - l + 1);
}

int main() {
    scanf("%d %d %d", &n, &m, &k); 
    scanf("%lld %lld %lld %lld", &A, &B, &C, &T);
    /*for(int i = 1; i <= m; i++) {
        scanf("%lld", st + i);
        if(i > 1) dist[i] = B * (st[i] - st[i-1]) + dist[i-1];
    }
    if(dist[m] <= T) ++ans;
    priority_queue<item> Q;
    for(int i = 1; i < m; i++) if(dist[i] <= T) {
        if(dist[i] + (st[i + 1] - st[i] - 1) * A <= T) {
            ans += st[i + 1] - st[i];
            continue;
        }
        long add = (T - dist[i]) / A + 1;
        ans += add;
        Q.emplace(get_cnt(i, st[i] + add, st[i + 1] - 1), st[i] + add, i);
    }
    k -= m;
    for(int i = 1; i <= k; i++) {
        item now = Q.top(); Q.pop();
        ans += now.cnt;
        long pos = now.idx + now.cnt;
        if(pos >= st[now.pos + 1]) continue;
        Q.emplace(get_cnt(now.pos, pos, st[now.pos + 1] - 1), pos, now.pos);   
    }
    printf("%lld\n", ans - 1);*/

    return 0;
}

Compilation message

semiexpress.cpp: In function 'int main()':
semiexpress.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &k); 
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld %lld %lld", &A, &B, &C, &T);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 18.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 52.0

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