oj.uz

Submission #226484

# Submission time Handle Problem Language Result Execution time Memory
226484 2020-04-24T00:08:28 Z rqi Ice Hockey World Championship (CEOI15_bobek) C++14
100 / 100
 89 ms 33288 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 = ll(1e18)+5; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

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 bit(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 

// 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
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
    bool fst = 1; str res = "{";
    F0R(i,sz(v)) {
        if (!fst) res += ", ";
        fst = 0; res += ts(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 T> str ts(T v) {
    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 << to_string(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#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
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

vl canmak1;
vl canmak2;

ll num[45];

int main() {
    setIO();
    int N;
    ll M;
    cin >> N >> M;
    for(int i = 1; i <= N; i++){
        cin >> num[i];
    }
    canmak1.pb(0);
    canmak2.pb(0);
    for(int i = 1; i <= N/2; i++){
        vl to1;
        vl to2;
        for(auto u: canmak1){
            to1.pb(u);
            if(u+num[i] <= M) to2.pb(u+num[i]);
        }
        canmak1.clear();
        int ind1 = 0;
        int ind2 = 0;
        while(ind1 < sz(to1) || ind2 < sz(to2)){
            ll num1, num2;
            if(ind1 == sz(to1)) num1 = INF;
            else num1 = to1[ind1];
            if(ind2 == sz(to2)) num2 = INF;
            else num2 = to2[ind2];
            if(num1 < num2){
                canmak1.pb(num1);
                ind1++;
            }
            else{
                canmak1.pb(num2);
                ind2++;
            }
        }
    }
    for(int i = N/2+1; i <= N; i++){
        vl to1;
        vl to2;
        for(auto u: canmak2){
            to1.pb(u);
            if(u+num[i] <= M) to2.pb(u+num[i]);
        }
        canmak2.clear();
        int ind1 = 0;
        int ind2 = 0;
        while(ind1 < sz(to1) || ind2 < sz(to2)){
            ll num1, num2;
            if(ind1 == sz(to1)) num1 = INF;
            else num1 = to1[ind1];
            if(ind2 == sz(to2)) num2 = INF;
            else num2 = to2[ind2];
            if(num1 < num2){
                canmak2.pb(num1);
                ind1++;
            }
            else{
                canmak2.pb(num2);
                ind2++;
            }
        }
    }

    int ind2 = sz(canmak2)-1;
    ll ans = 0;
    for(int ind1 = 0; ind1 < sz(canmak1); ind1++){
        while(ind2 > 0 && canmak1[ind1]+canmak2[ind2] > M){
            ind2--;
        }
        if(canmak1[ind1]+canmak2[ind2] > M) break;
        ans+=ll(ind2+1);
    }
    ps(ans);
    // 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

bobek.cpp: In function 'void setIn(std::__cxx11::string)':
bobek.cpp:123: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); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bobek.cpp: In function 'void setOut(std::__cxx11::string)':
bobek.cpp:124: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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3220 KB Output is correct
2 Correct 26 ms 8584 KB Output is correct
3 Correct 86 ms 33288 KB Output is correct
4 Correct 25 ms 8620 KB Output is correct
5 Correct 9 ms 2332 KB Output is correct
6 Correct 7 ms 1400 KB Output is correct
7 Correct 4 ms 384 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4492 KB Output is correct
2 Correct 12 ms 3224 KB Output is correct
3 Correct 35 ms 16788 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 1400 KB Output is correct
6 Correct 9 ms 2452 KB Output is correct
7 Correct 5 ms 384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 5684 KB Output is correct
2 Correct 35 ms 12072 KB Output is correct
3 Correct 34 ms 11952 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 35 ms 12072 KB Output is correct
6 Correct 66 ms 33172 KB Output is correct
7 Correct 4 ms 384 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 21032 KB Output is correct
2 Correct 12 ms 3348 KB Output is correct
3 Correct 7 ms 1404 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 1400 KB Output is correct
6 Correct 60 ms 21040 KB Output is correct
7 Correct 4 ms 304 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3348 KB Output is correct
2 Correct 26 ms 8616 KB Output is correct
3 Correct 7 ms 1400 KB Output is correct
4 Correct 7 ms 1404 KB Output is correct
5 Correct 28 ms 11944 KB Output is correct
6 Correct 11 ms 3220 KB Output is correct
7 Correct 5 ms 384 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 33016 KB Output is correct
2 Correct 12 ms 3352 KB Output is correct
3 Correct 7 ms 1400 KB Output is correct
4 Correct 89 ms 33132 KB Output is correct
5 Correct 33 ms 16800 KB Output is correct
6 Correct 9 ms 2452 KB Output is correct
7 Correct 5 ms 384 KB Output is correct