# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242160 | thecodingwizard | Brunhilda’s Birthday (BOI13_brunhilda) | C++11 | 586 ms | 44792 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>
using namespace std;
#define ii pair<int, int>
#define f first
#define s second
int A[100000];
int dp[10000001];
set<ii> transitions;
int main() {
int m, q; cin >> m >> q;
for (int i = 0; i < m; i++) cin >> A[i];
for (int i = 0; i < 10000001; i++) dp[i] = -1;
dp[0] = 0;
int nxtStart = 0, nxtVal = 0;
for (int i = 0; i < m; i++) {
nxtVal = max(nxtVal, A[i]);
transitions.insert({A[i],A[i]});
}
while (nxtStart != -1) {
int begin = nxtStart, end = begin + nxtVal;
nxtStart = -1;
nxtVal = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |