Submission #867327

#TimeUsernameProblemLanguageResultExecution timeMemory
867327efedmrlrGroup Photo (JOI21_ho_t3)C++17
44 / 100
5040 ms2908 KiB
#include <bits/stdc++.h> using namespace std; #define n_l '\n' #define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } #define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl #define lli long long int #define MP make_pair #define pb push_back #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++) #pragma GCC optimize("O1,O2,O3") void fastio() { ios_base::sync_with_stdio(false); cin.tie(NULL); } const double EPS = 0.00001; const int INF = 1e17+500; const int N = 1e5+5; const int M = 3e5+5; const int ALPH = 26; const int LGN = 25; const int MOD = 1e9+7; int n,m,q; vector<int> h, dp; vector<vector<int> > cost; struct SegTree { vector<int> data; int sz; SegTree(int sz) { this->sz = sz; data.resize(4*(sz + 1)); } void update(int tl, int tr, int v ,int ind ,int val) { if(tl == tr) { data[v] += val; return; } int tm = (tl + tr) / 2; if(ind <= tm) { update(tl, tm, v*2, ind, val); } else { update(tm+1, tr ,v*2+1, ind, val); } data[v] = data[v*2] + data[v*2+1]; } void update(int ind ,int val) { update(0, sz, 1, ind ,val); } int query(int tl, int tr, int v, int l, int r) { if(tl >= l && tr <= r) { return data[v]; } if(tl > r || tr < l) { return 0; } int tm = (tl + tr) >> 1; return query(tl, tm, v*2, l, r) + query(tm+1, tr, v*2+1, l, r); } int query(int l, int r) { return query(0, sz, 1, l, r); } int order(int x) { return query(0, x); } void insert(int x) { if(query(x,x)) return; update(x, 1); } void erase(int x) { if(query(x,x) == 0) return; update(x, -1); } }; void calc_cost(int x, int y) { vector<int> nwh; vector<array<int,2> > ord; for(int i = 1; i<=n; i++) { if(h[i] < x) continue; nwh.pb(h[i]); if(h[i] <= y) { ord.pb({h[i] , (int)nwh.size() - 1}); } } SegTree st(nwh.size()); for(int i = 0; i<nwh.size(); i++) { st.insert(i); } sort(ord.rbegin(), ord.rend()); int cst = 0; for(int i = 0; i<ord.size(); i++) { cst += st.order(ord[i][1]) - 1; st.erase(ord[i][1]); } cost[x][y] = cst; } inline void solve() { cin >> n; h.resize(n+1); dp.assign(n+1, INF); for(int i = 1; i<=n; i++) { cin>>h[i]; } cost.assign(n+1, vector<int>(n+1,0)); for(int i = 1; i<=n; i++) { for(int j = i; j<=n; j++) { calc_cost(i,j); } } dp[0] = 0; for(int i = 1 ;i<=n; i++) { for(int j = 0; j<i; j++) { dp[i] = min(dp[i] , dp[j] + cost[j+1][i]); } } cout<<dp[n]<<"\n"; } signed main() { fastio(); int test = 1; //cin>>test; while(test--) { solve(); } }

Compilation message (stderr)

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
Main.cpp: At global scope:
Main.cpp:23:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.000000000000005e+17' to '2147483647' [-Woverflow]
   23 | const int INF = 1e17+500;
      |                 ~~~~^~~~
Main.cpp: In function 'void calc_cost(int, int)':
Main.cpp:96:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |     for(int i = 0; i<nwh.size(); i++) {
      |                    ~^~~~~~~~~~~
Main.cpp:102:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     for(int i = 0; i<ord.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...
#Verdict Execution timeMemoryGrader output
Fetching results...