Submission #1116520

#TimeUsernameProblemLanguageResultExecution timeMemory
1116520Mher777K blocks (IZhO14_blocks)C++17
0 / 100
1 ms6480 KiB
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <iomanip> #include <array> #include <string> #include <algorithm> #include <cmath> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <vector> #include <stack> #include <queue> #include <deque> #include <bitset> #include <list> #include <iterator> #include <numeric> #include <complex> #include <utility> #include <random> #include <cassert> #include <fstream> using namespace std; mt19937 rnd(time(nullptr)); /* -------------------- Typedefs -------------------- */ typedef int itn; typedef long long ll; typedef unsigned long long ull; typedef double db; typedef float fl; typedef long double ld; /* -------------------- Usings -------------------- */ using vi = vector<int>; using vll = vector<ll>; using mii = map<int, int>; using mll = map<ll, ll>; using pii = pair<int, int>; using pll = pair<ll, ll>; /* -------------------- Defines -------------------- */ #define ff first #define ss second #define pub push_back #define pob pop_back #define puf push_front #define pof pop_front #define mpr make_pair #define yes cout<<"Yes\n" #define no cout<<"No\n" #define all(x) (x).begin(), (x).end() #define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout); /* -------------------- Constants -------------------- */ const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 }; const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 }; const int MAX = int(1e9 + 5); const ll MAXL = ll(1e18) + 5ll; const ll MOD = ll(1000000007); const ll MOD2 = ll(998244353); /* -------------------- Functions -------------------- */ void fastio() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } void precision(int x) { cout.setf(ios::fixed | ios::showpoint); cout.precision(x); } ll gcd(ll a, ll b) { if (a == 0 || b == 0) return(max(a, b)); while (b) { a %= b; swap(a, b); } return a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } ll range_sum(ll a, ll b) { if (a > b) return 0ll; ll dif = a - 1, cnt = b - a + 1; ll ans = ((b - a + 1) * (b - a + 2)) / 2; ans += ((b - a + 1) * dif); return ans; } string dec_to_bin(ll a) { string s = ""; for (ll i = a; i > 0; ) { ll k = i % 2; i /= 2; char c = k + 48; s += c; } if (a == 0) { s = "0"; } reverse(all(s)); return s; } ll bin_to_dec(string s) { ll num = 0; for (int i = 0; i < s.size(); i++) { num *= 2ll; num += (s[i] - '0'); } return num; } ll factorial_by_mod(ll n, ll mod) { ll ans = 1; ll num; for (ll i = 1; i <= n; ++i) { num = i % mod; ans *= num; ans %= mod; } return ans; } bool isPrime(ll a) { if (a == 1) return false; for (ll i = 2; i * i <= a; i++) { if (a % i == 0) return false; } return true; } ll binpow(ll a, ll b) { if (!a) return 0; ll ans = 1; while (b) { if (b & 1) { ans *= a; } b >>= 1; a *= a; } return ans; } ll binpow_by_mod(ll a, ll b, ll mod) { if (!a) return 0; ll ans = 1; while (b) { if (b & 1) { ans *= a; ans %= mod; } b >>= 1; a *= a; a %= mod; } return ans; } /* -------------------- Solution -------------------- */ const int N = 100005, M = 105, L = 20; int a[N], near[N], dp[N][M], st[N][L], pref[N]; int n, k, lg; void bld(int kx) { for (int i = 1; i <= n; ++i) { st[i][0] = dp[i][kx]; } for (int l = 1; l <= lg; ++l) { for (int i = 1; i + (1 << l) - 1 <= n; ++i) { st[i][l] = min(st[i][l - 1], st[i + (1 << (l - 1))][l - 1]); } } } int qry(int l, int r) { int lgx = log2(r - l + 1); return min(st[l][lgx], st[r - (1 << lgx) + 1][lgx]); } void slv() { cin >> n >> k; lg = log2(n); int ans = MAX; for (int i = 1; i <= n; ++i) { cin >> a[i]; pref[i] = max(pref[i - 1], a[i]); } near[n] = n + 1; dp[n][1] = a[n]; for (int i = n - 1; i >= 1; --i) { int ind = i + 1; while (ind <= n) { if (a[ind] > a[i]) break; ind = near[ind]; } near[i] = ind; if (near[ind] == n + 1) { dp[i][1] = a[i]; } else { dp[i][1] = MAX; } } bld(1); for (int kx = 2; kx <= k; ++kx) { for (int i = n; i > n - kx + 1; --i) { dp[i][kx] = MAX; } for (int i = n - kx + 1; i >= 1; --i) { int r = near[i]; if (r == n + 1) --r; dp[i][kx] = qry(i + 1, r) + a[i]; } if (kx == k) break; bld(kx); } for (int i = 1; i <= n; ++i) { if (pref[i] != a[i]) break; ans = min(ans, dp[i][k]); } cout << ans; } void cs() { int tstc = 1; //cin >> tstc; while (tstc--) { slv(); } } void precalc() { return; } int main() { fastio(); precalc(); //precision(0); cs(); return 0; }

Compilation message (stderr)

blocks.cpp: In function 'll range_sum(ll, ll)':
blocks.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
blocks.cpp: In function 'll bin_to_dec(std::string)':
blocks.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...