# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1045791 | hirayuu_oj | Uplifting Excursion (BOI22_vault) | C++17 | 742 ms | 524288 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 rep(i,n) for(ll i=0; i<(n); i++)
#define rng(i,l,r) for(ll i=(l); i<(r); i++)
#define all(x) x.begin(),x.end()
using ll=long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll M,L;
cin>>M>>L;
vector<ll> A(M*2+1);
rep(i,M*2+1) {
cin>>A[i];
}
if(L<0) {
L=-L;
rep(i,M) {
swap(A[i],A[M*2-i]);
}
}
const ll mx=600000;
vector<vector<ll>> dp(M+2,vector<ll>(mx+1,-(1LL<<60)));
dp[M+1][0]=0;
for(ll i=M; i>0; i--) {
rep(j,i) {
ll cnt=0;
deque<pair<ll,ll>> deq;
for(ll k=j; k<=mx; k+=i) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |