oj.uz

답안 #557700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557700 2022-05-05T20:11:13 Z Sam_a17 Ice Hockey World Championship (CEOI15_bobek) C++14
100 / 100
 497 ms 20832 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) x.clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount

#define pb push_back
#define pf push_front
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque<T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}

// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }

  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
long long n, m;

void solve_() {
  cin >> n >> m;
  vector<long long> a(n);
  for(auto &val: a) cin >> val;

  int firsthalf = n / 2;
  int secondhalf = n / 2;

  if(n & 1) {
    firsthalf++;
  }

  vector<long long> firstSubset, secondSubset;
  for(int mask = 0; mask < (1 << firsthalf); mask++) {
    long long s = 0;
    for(int i = 0; i < firsthalf; i++) {
      if(mask & (1 << i)) {
        s += a[i];
      }
    }
    firstSubset.push_back(s);
  }

  for(int mask = 0; mask < (1 << secondhalf); mask++) {
    long long s = 0;
    for(int i = 0; i < secondhalf; i++) {
      if(mask & (1 << i)) {
        s += a[i + firsthalf];
      }
    }
    secondSubset.push_back(s);
  }

  sort(all(secondSubset));
  long long answ = 0;
  for(auto i: firstSubset) {
    if(m < i) continue;
    auto it = upper_bound(all(secondSubset), m - i) - secondSubset.begin();
    answ += it;
  }

  printf("%lld\n", answ);
}

int main() {
  setIO("");

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

bobek.cpp: In function 'void setIO(std::string)':
bobek.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bobek.cpp:68:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bobek.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bobek.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 316 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 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 2256 KB Output is correct
2 Correct 93 ms 5448 KB Output is correct
3 Correct 497 ms 20804 KB Output is correct
4 Correct 91 ms 5452 KB Output is correct
5 Correct 13 ms 1596 KB Output is correct
6 Correct 6 ms 984 KB Output is correct
7 Correct 12 ms 1492 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 2896 KB Output is correct
2 Correct 30 ms 2256 KB Output is correct
3 Correct 168 ms 10544 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 6 ms 856 KB Output is correct
6 Correct 12 ms 1492 KB Output is correct
7 Correct 12 ms 1620 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 4432 KB Output is correct
2 Correct 158 ms 8476 KB Output is correct
3 Correct 146 ms 8520 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 69 ms 8516 KB Output is correct
6 Correct 223 ms 20764 KB Output is correct
7 Correct 72 ms 8504 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 16728 KB Output is correct
2 Correct 28 ms 2384 KB Output is correct
3 Correct 9 ms 984 KB Output is correct
4 Correct 1 ms 284 KB Output is correct
5 Correct 6 ms 984 KB Output is correct
6 Correct 175 ms 16684 KB Output is correct
7 Correct 13 ms 1620 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 2348 KB Output is correct
2 Correct 86 ms 5368 KB Output is correct
3 Correct 9 ms 984 KB Output is correct
4 Correct 9 ms 984 KB Output is correct
5 Correct 79 ms 8484 KB Output is correct
6 Correct 19 ms 2268 KB Output is correct
7 Correct 208 ms 20832 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 398 ms 20720 KB Output is correct
2 Correct 33 ms 2368 KB Output is correct
3 Correct 9 ms 984 KB Output is correct
4 Correct 452 ms 20780 KB Output is correct
5 Correct 116 ms 10528 KB Output is correct
6 Correct 15 ms 1492 KB Output is correct
7 Correct 26 ms 2904 KB Output is correct