# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161892 | alexander707070 | Potatoes and fertilizers (LMIO19_bulves) | C++20 | 910 ms | 6728 KiB |
#include<bits/stdc++.h>
#define MAXN 500007
using namespace std;
const long long inf=1e16;
int n,a[MAXN],b[MAXN];
int pos[MAXN],m,sum,suma;
long long dp[2][30007];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
for(int f=1;f<=b[i];f++){
m++; pos[m]=i;
}
suma+=a[i];
}
dp[0][0]=0;
for(int i=1;i<=suma;i++)dp[0][i]=inf;
for(int i=1;i<=n;i++){
sum+=a[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... |