oj.uz

답안 #237150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
237150 2020-06-04T21:13:05 Z rqi Candies (JOI18_candies) C++14
8 / 100
 62 ms 31872 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
}

ll A[2005];
ll dp[2005][2005]; //just ate a candy <= i, j eaten so far, max possible answer
ll ans[2005];

/*
When do we not eat the max?
dp transition optimization?
*/
int main() {
    setIO();
    int N;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> A[i];
    }

    for(int i = 0; i <= N; i++){
        for(int j = 0; j <= N; j++){
            dp[i][j] = -INF;
        }
    }
    dp[0][0] = 0;
    dp[1][1] = A[1];

    for(int i = 2; i <= N; i++){
        for(int j = 1; j <= i; j++){
            ckmax(dp[i][j], dp[i-2][j-1]+A[i]);
        }
        for(int j = 0; j <= i; j++){
            ckmax(dp[i-1][j], dp[i-2][j]);
        }
    }

    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            ckmax(ans[i], dp[j][i]);
        }
    }

    for(int i = 1; i <= (N+1)/2; i++){
        ps(ans[i]);
    }

    // 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

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 31868 KB Output is correct
2 Correct 59 ms 31736 KB Output is correct
3 Correct 59 ms 31872 KB Output is correct
4 Correct 60 ms 31744 KB Output is correct
5 Correct 61 ms 31872 KB Output is correct
6 Correct 60 ms 31872 KB Output is correct
7 Correct 52 ms 31844 KB Output is correct
8 Correct 59 ms 31744 KB Output is correct
9 Correct 59 ms 31864 KB Output is correct
10 Correct 60 ms 31872 KB Output is correct
11 Correct 57 ms 31864 KB Output is correct
12 Correct 60 ms 31744 KB Output is correct
13 Correct 61 ms 31744 KB Output is correct
14 Correct 58 ms 31744 KB Output is correct
15 Correct 61 ms 31744 KB Output is correct
16 Correct 59 ms 31744 KB Output is correct
17 Correct 61 ms 31744 KB Output is correct
18 Correct 60 ms 31864 KB Output is correct
19 Correct 62 ms 31864 KB Output is correct
20 Correct 61 ms 31732 KB Output is correct

Subtask #2
0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 31868 KB Output is correct
2 Correct 59 ms 31736 KB Output is correct
3 Correct 59 ms 31872 KB Output is correct
4 Correct 60 ms 31744 KB Output is correct
5 Correct 61 ms 31872 KB Output is correct
6 Correct 60 ms 31872 KB Output is correct
7 Correct 52 ms 31844 KB Output is correct
8 Correct 59 ms 31744 KB Output is correct
9 Correct 59 ms 31864 KB Output is correct
10 Correct 60 ms 31872 KB Output is correct
11 Correct 57 ms 31864 KB Output is correct
12 Correct 60 ms 31744 KB Output is correct
13 Correct 61 ms 31744 KB Output is correct
14 Correct 58 ms 31744 KB Output is correct
15 Correct 61 ms 31744 KB Output is correct
16 Correct 59 ms 31744 KB Output is correct
17 Correct 61 ms 31744 KB Output is correct
18 Correct 60 ms 31864 KB Output is correct
19 Correct 62 ms 31864 KB Output is correct
20 Correct 61 ms 31732 KB Output is correct
21 Runtime error 7 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -