結果
問題 | No.2027 (1, 2, 3, …, N) 's Subset Sum |
ユーザー | hibit_at |
提出日時 | 2022-09-15 16:03:57 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 3,124 bytes |
コンパイル時間 | 1,476 ms |
コンパイル使用メモリ | 116,724 KB |
実行使用メモリ | 6,736 KB |
最終ジャッジ日時 | 2024-05-09 17:16:37 |
合計ジャッジ時間 | 3,705 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 25 ms
6,728 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 25 ms
6,736 KB |
testcase_05 | AC | 26 ms
6,604 KB |
testcase_06 | AC | 25 ms
6,732 KB |
testcase_07 | AC | 10 ms
5,376 KB |
testcase_08 | AC | 22 ms
6,600 KB |
testcase_09 | AC | 10 ms
5,456 KB |
testcase_10 | AC | 14 ms
5,376 KB |
testcase_11 | AC | 11 ms
5,708 KB |
testcase_12 | AC | 12 ms
5,376 KB |
testcase_13 | AC | 8 ms
5,376 KB |
testcase_14 | AC | 4 ms
5,376 KB |
testcase_15 | AC | 14 ms
5,568 KB |
testcase_16 | AC | 16 ms
5,576 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 15 ms
5,376 KB |
testcase_23 | AC | 9 ms
5,376 KB |
testcase_24 | AC | 3 ms
5,376 KB |
testcase_25 | AC | 18 ms
5,964 KB |
testcase_26 | AC | 6 ms
5,376 KB |
ソースコード
#include <algorithm> #include <iostream> #include <iomanip> #include <limits.h> #include <map> #include <math.h> #include <numeric> #include <queue> #include <set> #include <sstream> #include <string> #include <utility> #include <vector> #include <stack> #include <complex> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep1(i, n) for (int i = 1; i < n + 1; i++) #define all(A) A.begin(), A.end() #define itr(A, l, r) A.begin() + l, A.begin() + r #define debug(var) cout << #var << " = " << var << endl; typedef long long ll; template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 != (int)v.size() ? " " : ""); } return os; } template <typename T> ostream &operator<<(ostream &os, const vector<vector<T>> &v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << endl; } return os; } template <typename T> ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v) { for (int i = 0; i < (int)v.size(); i++) { os << "i = " << i << endl; os << v[i]; } return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template <typename T, typename S> ostream &operator<<(ostream &os, map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } cout << endl; return os; } template <typename T> ostream &operator<<(ostream &os, set<T> st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, multiset<T> st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } vector<ll> divisor(ll n) { vector<ll> ans; for (ll i = 1; i * i <= n; i++) { if (n % i == 0) { ans.push_back(i); if (i * i != n) { ans.push_back(n / i); } } } sort(all(ans)); return ans; } int main() { int n; cin >> n; ll s; cin >> s; vector<ll> border = {0}; rep1(i, n) { border.push_back(ll(i) * (i + 1) / 2); } // debug(border); ll lim = lower_bound(all(border), s) - border.begin(); ll eliminate = lim * (lim + 1) / 2 - s; // debug(eliminate); vector<int> ans; rep1(i, lim) { if (i == eliminate) { continue; } ans.push_back(i); } cout << ans.size() << endl; cout << ans << endl; }