# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
943923 | penguin133 | Potatoes and fertilizers (LMIO19_bulves) | C++17 | 116 ms | 21280 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 int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int dp[2][30005];
int n, A[500005], B[500005];
void solve(){
cin >> n;
for(int i = 1; i <= n; i++)cin >> A[i] >> B[i], A[i] -= B[i], A[i] += A[i - 1];
/*
for(int i = 1; i <= n; i++){
for(int j = 0; j <= 30000; j++){
if(j)dp[i & 1][j] = min(dp[i & 1][j - 1], dp[(i - 1) & 1][j] + abs(A[i] - j));
else dp[i & 1][j] = dp[(i - 1) & 1][j] + abs(A[i] - j);
}
}
*/
int ans = 0;
priority_queue <int> pq;
for(int i = 1; i <= n; i++){
Compilation message (stderr)
# | 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... |