# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537101 | qwerasdfzxcl | Semiexpress (JOI17_semiexpress) | C++14 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
struct Block{
ll l, r, t, i;
Block(){}
Block(ll _l, ll _r, ll _t, ll _i): l(_l), r(_r), t(_t), i(_i) {}
bool operator<(const Block &B) const{
return r-l > B.r - B.l;
}
};
int a[3030];
signed main(){
int n, m, k;
scanf("%lld %lld %lld", &n, &m, &k);
int A, B, C;
scanf("%lld %lld %lld", &A, &B, &C);
ll T;
scanf("%lld", &T);
for (int i=1;i<=m;i++) scanf("%lld", a+i);
int ans = -1;
if (T>=B*(a[m]-1)) ans++;
priority_queue<Block> pq;
for (int i=1;i<m;i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |