oj.uz

답안 #574727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
574727 2022-06-09T10:40:22 Z MohammadAghil Ice Hockey World Championship (CEOI15_bobek) C++14
50 / 100
 192 ms 20820 KB 
      #include <bits/stdc++.h>
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
    using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
    #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
      #define per(i,r,l) for(int i = (r); i >= (l); i--)
        #define rep(i,l,r) for(int i = (l); i < (r); i++)
           #define all(x) x.begin(), x.end()
              #define sz(x) (int)(x).size()
                  #define pb push_back
                      #define ss second
                           #define ff first
                                   void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 1<<9, maxk = 101, lg = 21, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}

vector<ll> slv(vector<ll> a){
     vector<ll> res{0}; int n = sz(a);
     rep(i,1,1<<n){
          int f = __builtin_ctz(i);
          res.pb(res[i^(1<<f)] + a[f]); 
     }
     sort(all(res));
     return res;
}

int main(){
     cin.tie(0) -> sync_with_stdio(0); 
     ll n, m; cin >> n >> m;
     vector<ll> a(n);
     rep(i,0,n) cin >> a[i];
     vector<ll> resl = slv(vector<ll>(begin(a), begin(a) + (n>>1))), resr = slv(vector<ll>(begin(a) + (n>>1), end(a)));
     ll ans = 0, ptr = sz(resr)-1;
     for(int c: resl){
          if(c > m) break;
          while(c + resr[ptr] > m) ptr--;
          ans += ptr + 1;
     }
     cout << ans << '\n';
     return 0; 
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 2004 KB Output is correct
2 Correct 47 ms 5468 KB Output is correct
3 Correct 192 ms 20816 KB Output is correct
4 Correct 48 ms 5340 KB Output is correct
5 Correct 6 ms 1620 KB Output is correct
6 Correct 6 ms 984 KB Output is correct
7 Correct 10 ms 1620 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2908 KB Output is correct
2 Correct 15 ms 2008 KB Output is correct
3 Correct 67 ms 10580 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 984 KB Output is correct
6 Correct 10 ms 1620 KB Output is correct
7 Correct 10 ms 1624 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 3540 KB Output is correct
2 Correct 66 ms 6608 KB Output is correct
3 Correct 65 ms 6600 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 36 ms 6624 KB Output is correct
6 Correct 146 ms 20820 KB Output is correct
7 Correct 61 ms 6608 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 155 ms 12748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 2008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 181 ms 20820 KB Output isn't correct
2 Halted 0 ms 0 KB -