oj.uz

Submission #210222

# Submission time Handle Problem Language Result Execution time Memory
210222 2020-03-16T21:52:46 Z caoash Bigger segments (IZhO19_segments) C++14
100 / 100
 245 ms 54364 KB 
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 500005;
const ld PI = 4*atan((ld)1);
ll pre[MX]; pl dp[MX]; 
ll qry(int l, int r){
 l--; r--;
 if(l == 0) return pre[r]; 
 else return pre[r]-pre[l-1];
}
//12 19 18 20 17 2 3 2 1 2 11 5 8
int main() {
   setIO(); 
   int N; re(N);   
   vl a(N);
   fax(i,N) re(a[i]);
   priority_queue<pair<pl,ll>, vector<pair<pl,ll>>, greater<pair<pl,ll>>> pend; set<pair<pl,ll>> can;
   pre[0] = a[0];
   f0x(i,1,N){
    pre[i] = pre[i-1] + a[i];
   }
   dp[0] = mp(0,0); can.insert(mp(mp(0,0),0));
   f0x(i,1,N+1){
    while(!pend.empty()){
      pair<pl,ll> tp = pend.top();
      if(pre[i-1] >= tp.f.f){
        can.insert(mp(mp(tp.f.s, pre[tp.s-1]), tp.s));
        pend.pop();
      }
      else{
        break;
      }
    }
    auto best = *(--can.end()); 
    dp[i] = mp(best.f.f+1, pre[i-1]-best.f.s);
    //dbg(i,dp[i], pre[i-1]);
    pend.push(mp(mp(2*dp[i].s+pre[best.s-1], dp[i].f),i));
   }
   pr(dp[N].f);
}

Compilation message

segments.cpp: In function 'void io::setIn(std::__cxx11::string)':
segments.cpp:133:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
segments.cpp: In function 'void io::setOut(std::__cxx11::string)':
segments.cpp:134:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 380 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 380 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 632 KB Output is correct
32 Correct 7 ms 632 KB Output is correct
33 Correct 7 ms 632 KB Output is correct
34 Correct 6 ms 632 KB Output is correct
35 Correct 6 ms 632 KB Output is correct
36 Correct 6 ms 632 KB Output is correct
37 Correct 6 ms 632 KB Output is correct
38 Correct 6 ms 632 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 6 ms 632 KB Output is correct
41 Correct 6 ms 632 KB Output is correct
42 Correct 6 ms 632 KB Output is correct
43 Correct 6 ms 632 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 6 ms 632 KB Output is correct

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 380 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 632 KB Output is correct
32 Correct 7 ms 632 KB Output is correct
33 Correct 7 ms 632 KB Output is correct
34 Correct 6 ms 632 KB Output is correct
35 Correct 6 ms 632 KB Output is correct
36 Correct 6 ms 632 KB Output is correct
37 Correct 6 ms 632 KB Output is correct
38 Correct 6 ms 632 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 6 ms 632 KB Output is correct
41 Correct 6 ms 632 KB Output is correct
42 Correct 6 ms 632 KB Output is correct
43 Correct 6 ms 632 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 6 ms 632 KB Output is correct
46 Correct 17 ms 6636 KB Output is correct
47 Correct 48 ms 9972 KB Output is correct
48 Correct 54 ms 10616 KB Output is correct
49 Correct 45 ms 10552 KB Output is correct
50 Correct 50 ms 10744 KB Output is correct
51 Correct 49 ms 10744 KB Output is correct
52 Correct 26 ms 5496 KB Output is correct
53 Correct 18 ms 3448 KB Output is correct
54 Correct 42 ms 9976 KB Output is correct
55 Correct 49 ms 10748 KB Output is correct
56 Correct 41 ms 10232 KB Output is correct
57 Correct 46 ms 11244 KB Output is correct
58 Correct 45 ms 10864 KB Output is correct
59 Correct 45 ms 10360 KB Output is correct
60 Correct 46 ms 10360 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 380 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 632 KB Output is correct
32 Correct 7 ms 632 KB Output is correct
33 Correct 7 ms 632 KB Output is correct
34 Correct 6 ms 632 KB Output is correct
35 Correct 6 ms 632 KB Output is correct
36 Correct 6 ms 632 KB Output is correct
37 Correct 6 ms 632 KB Output is correct
38 Correct 6 ms 632 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 6 ms 632 KB Output is correct
41 Correct 6 ms 632 KB Output is correct
42 Correct 6 ms 632 KB Output is correct
43 Correct 6 ms 632 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 6 ms 632 KB Output is correct
46 Correct 17 ms 6636 KB Output is correct
47 Correct 48 ms 9972 KB Output is correct
48 Correct 54 ms 10616 KB Output is correct
49 Correct 45 ms 10552 KB Output is correct
50 Correct 50 ms 10744 KB Output is correct
51 Correct 49 ms 10744 KB Output is correct
52 Correct 26 ms 5496 KB Output is correct
53 Correct 18 ms 3448 KB Output is correct
54 Correct 42 ms 9976 KB Output is correct
55 Correct 49 ms 10748 KB Output is correct
56 Correct 41 ms 10232 KB Output is correct
57 Correct 46 ms 11244 KB Output is correct
58 Correct 45 ms 10864 KB Output is correct
59 Correct 45 ms 10360 KB Output is correct
60 Correct 46 ms 10360 KB Output is correct
61 Correct 71 ms 29876 KB Output is correct
62 Correct 171 ms 39464 KB Output is correct
63 Correct 232 ms 48616 KB Output is correct
64 Correct 245 ms 51832 KB Output is correct
65 Correct 219 ms 52216 KB Output is correct
66 Correct 235 ms 52088 KB Output is correct
67 Correct 194 ms 41720 KB Output is correct
68 Correct 99 ms 21112 KB Output is correct
69 Correct 197 ms 48376 KB Output is correct
70 Correct 243 ms 52128 KB Output is correct
71 Correct 192 ms 49272 KB Output is correct
72 Correct 220 ms 54364 KB Output is correct
73 Correct 217 ms 52072 KB Output is correct
74 Correct 213 ms 50548 KB Output is correct
75 Correct 217 ms 50680 KB Output is correct