oj.uz

Submission #281752

# Submission time Handle Problem Language Result Execution time Memory
281752 2020-08-23T12:20:41 Z ACmachine Ice Hockey World Championship (CEOI15_bobek) C++17
100 / 100
 397 ms 25140 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 

const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

struct AcAutomaton{
    int n; ll m;
    vll a;
	void read_in(){
		cin >> n >> m; 
        a.rsz(n);
        cin >> a;
	}
	void solve(){
        vll pos;
        pos.pb(0);
        vll toinsert;
        REP(i, n/2){
            REP(j, pos.size()){
                if(pos[j] + a[i] <= m) toinsert.pb(pos[j] + a[i]);
            }
            for(auto x : toinsert) pos.pb(x);
            toinsert.clear();
        }
        sort(all(pos));
        //dbg(pos);
        ll ans = 0;
        vll pos2;
        pos2.pb(0);
        FOR(i, n/2, n, 1){
            REP(j, pos2.size()){
                if(pos2[j] + a[i] <= m) toinsert.pb(pos2[j] + a[i]);
            }
            for(auto x : toinsert) pos2.pb(x);
            toinsert.clear();
        }
        //dbg(pos2);
        for(auto el : pos2){
            ans += upper_bound(all(pos), m - el) - pos.begin();
        }
        cout << ans << endl;
	}
};
    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int tcase = 1;
	while(tcase--){
		AcAutomaton solver;
		solver.read_in();
		solver.solve();
	}
    return 0;
}

Compilation message

bobek.cpp: In member function 'void AcAutomaton::solve()':
bobek.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
bobek.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
bobek.cpp:96:13: note: in expansion of macro 'REP'
   96 |             REP(j, pos.size()){
      |             ^~~
bobek.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
bobek.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
bobek.cpp:108:13: note: in expansion of macro 'REP'
  108 |             REP(j, pos2.size()){
      |             ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2548 KB Output is correct
2 Correct 86 ms 6492 KB Output is correct
3 Correct 397 ms 25020 KB Output is correct
4 Correct 76 ms 6496 KB Output is correct
5 Correct 10 ms 1912 KB Output is correct
6 Correct 5 ms 1148 KB Output is correct
7 Correct 0 ms 384 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 3440 KB Output is correct
2 Correct 26 ms 2548 KB Output is correct
3 Correct 151 ms 12616 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 5 ms 1148 KB Output is correct
6 Correct 9 ms 1912 KB Output is correct
7 Correct 0 ms 384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 4588 KB Output is correct
2 Correct 130 ms 8736 KB Output is correct
3 Correct 116 ms 8764 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 48 ms 8676 KB Output is correct
6 Correct 152 ms 25140 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 16952 KB Output is correct
2 Correct 22 ms 2548 KB Output is correct
3 Correct 7 ms 1148 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 5 ms 1148 KB Output is correct
6 Correct 115 ms 16948 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2548 KB Output is correct
2 Correct 74 ms 6496 KB Output is correct
3 Correct 6 ms 1148 KB Output is correct
4 Correct 7 ms 1148 KB Output is correct
5 Correct 65 ms 8668 KB Output is correct
6 Correct 13 ms 2548 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 311 ms 25024 KB Output is correct
2 Correct 26 ms 2548 KB Output is correct
3 Correct 10 ms 1148 KB Output is correct
4 Correct 394 ms 25024 KB Output is correct
5 Correct 77 ms 12628 KB Output is correct
6 Correct 9 ms 1912 KB Output is correct
7 Correct 1 ms 384 KB Output is correct