# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61159 | 2018-07-25T09:34:57 Z | gusfring | Semiexpress (JOI17_semiexpress) | C++14 | 4 ms | 808 KB |
#include<cstdio> #include<vector> #include<algorithm> using namespace std; const int MAX_M = 305; int N, M, K; long long A, B, C; long long T; int s[MAX_M]; int nums[MAX_M * MAX_M]; int c = 0; int getNums(int l, int r){ int res = 0; long long t = B * l; int id = l; int cnt = 0; while(id < r){ long long x = T - t; if(x < 0) break; x /= A; long long nxt = id + x + 1; nxt = min((long long)r, nxt); if(id == l) res = nxt - id; else nums[c++] = nxt - id; t += C * (nxt - id); id = nxt; cnt++; if(cnt > K - M) break; } return res; } int solve(){ int ans = B * s[M - 1] <= T ? 1 : 0; for(int i = 0; i < M - 1; ++i){ ans += getNums(s[i], s[i + 1]); } sort(nums, nums + c); reverse(nums, nums + c); for(int i = 0; i < K - M; ++i){ ans += nums[i]; } return ans - 1; } void input(){ scanf("%d%d%d", &N, &M, &K); scanf("%lld%lld%lld", &A, &B, &C); scanf("%lld", &T); for(int i = 0; i < M; ++i){ scanf("%d", s + i); s[i]--; } } int main(){ input(); int ans = solve(); printf("%d\n", ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 452 KB | Output is correct |
3 | Correct | 2 ms | 452 KB | Output is correct |
4 | Correct | 2 ms | 648 KB | Output is correct |
5 | Correct | 2 ms | 648 KB | Output is correct |
6 | Correct | 4 ms | 696 KB | Output is correct |
7 | Correct | 3 ms | 696 KB | Output is correct |
8 | Correct | 3 ms | 696 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 452 KB | Output is correct |
3 | Correct | 2 ms | 452 KB | Output is correct |
4 | Correct | 2 ms | 648 KB | Output is correct |
5 | Correct | 2 ms | 648 KB | Output is correct |
6 | Correct | 4 ms | 696 KB | Output is correct |
7 | Correct | 3 ms | 696 KB | Output is correct |
8 | Correct | 3 ms | 696 KB | Output is correct |
9 | Correct | 3 ms | 744 KB | Output is correct |
10 | Correct | 2 ms | 744 KB | Output is correct |
11 | Correct | 3 ms | 744 KB | Output is correct |
12 | Correct | 3 ms | 744 KB | Output is correct |
13 | Correct | 2 ms | 744 KB | Output is correct |
14 | Correct | 2 ms | 744 KB | Output is correct |
15 | Correct | 3 ms | 808 KB | Output is correct |
16 | Correct | 2 ms | 808 KB | Output is correct |
17 | Correct | 2 ms | 808 KB | Output is correct |
18 | Correct | 2 ms | 808 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 452 KB | Output is correct |
3 | Correct | 2 ms | 452 KB | Output is correct |
4 | Correct | 2 ms | 648 KB | Output is correct |
5 | Correct | 2 ms | 648 KB | Output is correct |
6 | Correct | 4 ms | 696 KB | Output is correct |
7 | Correct | 3 ms | 696 KB | Output is correct |
8 | Correct | 3 ms | 696 KB | Output is correct |
9 | Correct | 3 ms | 744 KB | Output is correct |
10 | Correct | 2 ms | 744 KB | Output is correct |
11 | Correct | 3 ms | 744 KB | Output is correct |
12 | Correct | 3 ms | 744 KB | Output is correct |
13 | Correct | 2 ms | 744 KB | Output is correct |
14 | Correct | 2 ms | 744 KB | Output is correct |
15 | Correct | 3 ms | 808 KB | Output is correct |
16 | Correct | 2 ms | 808 KB | Output is correct |
17 | Correct | 2 ms | 808 KB | Output is correct |
18 | Correct | 2 ms | 808 KB | Output is correct |
19 | Execution timed out | 3 ms | 808 KB | Time limit exceeded (wall clock) |
20 | Halted | 0 ms | 0 KB | - |