oj.uz

Submission #238561

# Submission time Handle Problem Language Result Execution time Memory
238561 2020-06-11T21:24:20 Z rqi Candies (JOI18_candies) C++14
100 / 100
 1276 ms 15576 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

typedef vector<vector<ll>> V;

ll A[200005];

int rup2(int a){
    return (a+1)/2;
}

void combmax(vl& a, const vl &b){
    assert(sz(a) >= sz(b));
    for(int i = 0; i < sz(b); i++){
        ckmax(a[i], b[i]);
    }
}

vl comb(vl a, vl b){

    vl c(sz(a)-1+sz(b)-1+1, 0);
    
    for(int i = 0; i < sz(c); i++){
        int lo = max(0, i-(sz(b)-1));
        int hi = min(sz(a)-1, i);
        while(lo < hi){
            //dbg(lo, hi);
            int mid1 = lo+(hi-lo)/3;
            int mid2 = hi-(hi-lo)/3;
            ll val1 = a[mid1]+b[i-mid1];
            ll val2 = a[mid2]+b[i-mid2];
            if(val1 <= val2){
                lo = mid1+1;
            }
            else{
                hi = mid2-1;
            }
        }
        ll val1 = a[lo]+b[i-lo];
        c[i] = val1;
    }
    
    return c;
}

V solve(int L, int R){
    V v;
    if(L == R){
        v = {{0, A[L]}, {0}, {0}, {0}};
        //dbg(L, R, v);
        return v;
    }
    int M = (L+R)/2;

    V q1 = solve(L, M);
    V q2 = solve(M+1, R);

    int sz = (R-L+1);
    vl v0 = vl(rup2(sz)+1, 0);
    vl v1 = vl(rup2(sz-1)+1, 0);
    vl v2 = vl(rup2(sz-1)+1, 0);
    vl v3 = vl(rup2(sz-2)+1, 0);

    combmax(v0, comb(q1[0], q2[2]));
    combmax(v0, comb(q1[1], q2[0]));
    combmax(v1, comb(q1[0], q2[3]));
    combmax(v1, comb(q1[1], q2[1]));
    combmax(v2, comb(q1[2], q2[2]));
    combmax(v2, comb(q1[3], q2[0]));
    combmax(v3, comb(q1[2], q2[3]));
    combmax(v3, comb(q1[3], q2[1]));

    v.pb(v0);
    v.pb(v1);
    v.pb(v2);
    v.pb(v3);

    //dbg(L, R, v);
    return v;
}

int main() {
    setIO();
    int N;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> A[i];
    }
    V v = solve(1, N);
    for(int j = 1; j <= rup2(N); j++){
        ps(v[0][j]);
    }

    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

candies.cpp: In function 'void setIn(std::__cxx11::string)':
candies.cpp:128:31: 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); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
candies.cpp: In function 'void setOut(std::__cxx11::string)':
candies.cpp:129:32: 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
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 520 KB Output is correct
2 Correct 16 ms 512 KB Output is correct
3 Correct 12 ms 512 KB Output is correct
4 Correct 12 ms 512 KB Output is correct
5 Correct 13 ms 640 KB Output is correct
6 Correct 12 ms 512 KB Output is correct
7 Correct 12 ms 640 KB Output is correct
8 Correct 12 ms 512 KB Output is correct
9 Correct 11 ms 512 KB Output is correct
10 Correct 12 ms 512 KB Output is correct
11 Correct 12 ms 512 KB Output is correct
12 Correct 12 ms 512 KB Output is correct
13 Correct 12 ms 512 KB Output is correct
14 Correct 12 ms 512 KB Output is correct
15 Correct 12 ms 512 KB Output is correct
16 Correct 12 ms 512 KB Output is correct
17 Correct 12 ms 564 KB Output is correct
18 Correct 12 ms 512 KB Output is correct
19 Correct 12 ms 512 KB Output is correct
20 Correct 12 ms 512 KB Output is correct

Subtask #2
92.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 520 KB Output is correct
2 Correct 16 ms 512 KB Output is correct
3 Correct 12 ms 512 KB Output is correct
4 Correct 12 ms 512 KB Output is correct
5 Correct 13 ms 640 KB Output is correct
6 Correct 12 ms 512 KB Output is correct
7 Correct 12 ms 640 KB Output is correct
8 Correct 12 ms 512 KB Output is correct
9 Correct 11 ms 512 KB Output is correct
10 Correct 12 ms 512 KB Output is correct
11 Correct 12 ms 512 KB Output is correct
12 Correct 12 ms 512 KB Output is correct
13 Correct 12 ms 512 KB Output is correct
14 Correct 12 ms 512 KB Output is correct
15 Correct 12 ms 512 KB Output is correct
16 Correct 12 ms 512 KB Output is correct
17 Correct 12 ms 564 KB Output is correct
18 Correct 12 ms 512 KB Output is correct
19 Correct 12 ms 512 KB Output is correct
20 Correct 12 ms 512 KB Output is correct
21 Correct 1243 ms 15316 KB Output is correct
22 Correct 1241 ms 15180 KB Output is correct
23 Correct 1238 ms 15304 KB Output is correct
24 Correct 1191 ms 15052 KB Output is correct
25 Correct 1207 ms 15168 KB Output is correct
26 Correct 1189 ms 15164 KB Output is correct
27 Correct 1255 ms 15212 KB Output is correct
28 Correct 1254 ms 15296 KB Output is correct
29 Correct 1249 ms 15436 KB Output is correct
30 Correct 1273 ms 15444 KB Output is correct
31 Correct 1275 ms 15432 KB Output is correct
32 Correct 1276 ms 15168 KB Output is correct
33 Correct 1253 ms 15048 KB Output is correct
34 Correct 1257 ms 15008 KB Output is correct
35 Correct 1254 ms 15176 KB Output is correct
36 Correct 1242 ms 15576 KB Output is correct
37 Correct 1232 ms 15296 KB Output is correct
38 Correct 1229 ms 15288 KB Output is correct
39 Correct 1185 ms 15140 KB Output is correct
40 Correct 1193 ms 15176 KB Output is correct
41 Correct 1183 ms 15180 KB Output is correct
42 Correct 1257 ms 15268 KB Output is correct
43 Correct 1252 ms 15256 KB Output is correct
44 Correct 1255 ms 15308 KB Output is correct
45 Correct 1267 ms 15360 KB Output is correct
46 Correct 1272 ms 15316 KB Output is correct
47 Correct 1264 ms 15304 KB Output is correct
48 Correct 1259 ms 15268 KB Output is correct
49 Correct 1259 ms 15160 KB Output is correct
50 Correct 1256 ms 15016 KB Output is correct