oj.uz

Submission #1115702

# Submission time Handle Problem Language Result Execution time Memory
1115702 2024-11-20T20:18:11 Z vjudge1 Potatoes and fertilizers (LMIO19_bulves) C++17
0 / 100
 115 ms 141644 KB 
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
 
// #define _GLIBCXX_DEBUG
// #define _GLIBCXX_DEBUG_PEDANTIC
 
#include <iomanip>
#include <cassert>
#include <iostream>
#include <vector>
#include <random>
#include <algorithm>
#include <map>
#include <set>
#include <functional>
#include <array>
#include <numeric>
#include <queue>
#include <deque>
#include <bitset>
#include <cmath>
#include <climits>
#include <cstdint>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/rope>
 
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;
 
 
const int MOD = 998244353;
const long double PI = 3.141592653589793;
using ll = long long;
const ll INF = 1e18;
 
// #define int ll

// --------> sashko123`s defines:

#define itn int     //Vasya sorry :(
#define p_b push_back
#define fi first
#define se second
#define pii std::pair<int, int>
#define oo LLONG_MAX
#define big INT_MAX
#define elif else if

int input()
{
    int x;
    cin >> x;
    return x;
}

// ----------> end of sashko123`s defines (thank you Vasya <3)

// template<typename K, typename V>
// using hash_table = cc_hash_table<K, V, hash<K>>;

// template<typename T>
// using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

const int N = 3001;
const int M = 3000;
ll dp[N][2 * M + 10];

void solve() {
    int n;
	cin >> n;
	vector<int> c(n + 1);
	for (int i = 1; i <= n; i++) {
		int a, b;
		cin >> a >> b;
		c[i] = a - b;
	}
	for (int j = -M; j <= M; j++) {
		dp[0][j + M] = INF;
	}
	dp[0][M] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = -M; j <= M; j++) {
			dp[i][j + M] = INF;
		}
		ll mn = INF;
		for (int j = -M; j <= M; j++) {
			if (j + c[i] >= -M && j + c[i] <= M)
				dp[i][j + c[i] + M] = dp[i - 1][j + M] + abs(j);
		}
		for (int j = M - 1; j >= -M; j--) {
			dp[i][j + M] = min(dp[i][j + M], dp[i][j + M + 1]);
		}
	}
	ll ans = INF;
	for (int j = 0; j <= M; j++)
		ans = min(ans, dp[n][j + M]);
	cout << ans;
}	
 
int32_t main(int32_t argc, const char * argv[]) {
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    // insert code here...

    int tt= 1;
    // std::cin >> tt;
	for (int t = 1; t <= tt; t++) {
		// cout << "Case #" << t << ": ";
        solve();
    }
    return 0;
}

Compilation message

bulves.cpp: In function 'void solve()':
bulves.cpp:90:6: warning: unused variable 'mn' [-Wunused-variable]
   90 |   ll mn = INF;
      |      ^~

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 107 ms 141600 KB Output is correct
3 Incorrect 103 ms 141640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 107 ms 141600 KB Output is correct
3 Incorrect 103 ms 141640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 107 ms 141600 KB Output is correct
3 Correct 2 ms 2808 KB Output is correct
4 Correct 33 ms 47696 KB Output is correct
5 Correct 45 ms 72264 KB Output is correct
6 Correct 108 ms 141640 KB Output is correct
7 Correct 108 ms 141644 KB Output is correct
8 Correct 115 ms 141388 KB Output is correct
9 Incorrect 115 ms 141384 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 107 ms 141600 KB Output is correct
3 Incorrect 103 ms 141640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 107 ms 141600 KB Output is correct
3 Incorrect 103 ms 141640 KB Output isn't correct
4 Halted 0 ms 0 KB -