# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602626 | CSQ31 | Uplifting Excursion (BOI22_vault) | C++17 | 446 ms | 1748 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 all(a) a.begin(),a.end()
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
typedef long long int ll;
ll a[5000];
ll take[5000];
struct item{
ll w = 0,v = 0,c = 0;
item(){}
item(ll a,ll b,ll _c){
w = a;
v = b;
c = _c;
}
};
int main()
{
ll m,L;
cin>>m>>L;
for(int i=-m;i<=m;i++)cin>>a[i+m];
//greedy sol and optimal sol distance small
ll neg = 0,pos = 0;
for(ll i=-m;i<=0;i++)neg+=i*a[i+m];
for(ll i=0;i<=m;i++)pos+=i*a[i+m];
if(L>pos || L < neg){
cout<<"impossible";
return 0;
}
if(neg){
# | 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... |