結果
問題 | No.1443 Andd |
ユーザー | leaf_1415 |
提出日時 | 2021-03-26 22:28:30 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 1,491 ms / 2,000 ms |
コード長 | 4,529 bytes |
コンパイル時間 | 1,706 ms |
コンパイル使用メモリ | 87,404 KB |
実行使用メモリ | 56,688 KB |
最終ジャッジ日時 | 2023-08-19 09:01:22 |
合計ジャッジ時間 | 11,506 ms |
ジャッジサーバーID (参考情報) |
judge9 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 28 ms
4,928 KB |
testcase_04 | AC | 46 ms
5,652 KB |
testcase_05 | AC | 33 ms
4,824 KB |
testcase_06 | AC | 26 ms
4,636 KB |
testcase_07 | AC | 44 ms
5,596 KB |
testcase_08 | AC | 36 ms
5,156 KB |
testcase_09 | AC | 5 ms
4,376 KB |
testcase_10 | AC | 53 ms
6,208 KB |
testcase_11 | AC | 46 ms
5,448 KB |
testcase_12 | AC | 45 ms
5,928 KB |
testcase_13 | AC | 317 ms
17,132 KB |
testcase_14 | AC | 315 ms
16,848 KB |
testcase_15 | AC | 310 ms
16,900 KB |
testcase_16 | AC | 311 ms
16,516 KB |
testcase_17 | AC | 312 ms
15,968 KB |
testcase_18 | AC | 1,382 ms
56,628 KB |
testcase_19 | AC | 1,391 ms
55,240 KB |
testcase_20 | AC | 1,372 ms
56,620 KB |
testcase_21 | AC | 1,342 ms
56,468 KB |
testcase_22 | AC | 1,491 ms
56,688 KB |
ソースコード
#include <iostream> #include <cstdio> #include <cmath> #include <ctime> #include <cstdlib> #include <cassert> #include <vector> #include <list> #include <stack> #include <queue> #include <deque> #include <map> #include <set> #include <bitset> #include <string> #include <algorithm> #include <utility> #include <complex> #define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++) #define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++) #define chmin(x, y) (x) = min((x), (y)) #define chmax(x, y) (x) = max((x), (y)) #define sz(x) ((ll)(x).size()) #define ceil(x, y) (((x)+(y)-1) / (y)) #define all(x) (x).begin(),(x).end() #define outl(...) dump_func(__VA_ARGS__) #define inf 1e18 using namespace std; typedef long long llint; typedef long long ll; typedef pair<ll, ll> P; struct edge{ ll to, cost; edge(){} edge(ll a, ll b){ to = a, cost = b;} }; const ll mod = 1000000007; //const ll mod = 998244353; struct mint{ ll x = 0; mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;} mint(const mint &ope) {x = ope.x;} mint operator-(){return mint(-x);} mint operator+(const mint &ope){return mint(x) += ope;} mint operator-(const mint &ope){return mint(x) -= ope;} mint operator*(const mint &ope){return mint(x) *= ope;} mint operator/(const mint &ope){return mint(x) /= ope;} mint& operator+=(const mint &ope){ x += ope.x; if(x >= mod) x -= mod; return *this; } mint& operator-=(const mint &ope){ x += mod - ope.x; if(x >= mod) x -= mod; return *this; } mint& operator*=(const mint &ope){ x *= ope.x, x %= mod; return *this; } mint& operator/=(const mint &ope){ ll n = mod-2; mint mul = ope; while(n){ if(n & 1) *this *= mul; mul *= mul; n >>= 1; } return *this; } mint inverse(){return mint(1) / *this;} bool operator ==(const mint &ope){return x == ope.x;} bool operator !=(const mint &ope){return x != ope.x;} }; mint modpow(mint a, ll n){ if(n == 0) return mint(1); if(n % 2) return a * modpow(a, n-1); else return modpow(a*a, n/2); } istream& operator >>(istream &is, mint &ope){ ll t; is >> t, ope.x = t; return is; } ostream& operator <<(ostream &os, mint &ope){return os << ope.x;} ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;} bool exceed(ll x, ll y, ll m){return x >= m / y + 1;} void mark(){ cout << "*" << endl; } void yes(){ cout << "Yes" << endl; } void no(){ cout << "No" << endl; } ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);} template<typename T> ostream& operator << (ostream& os, vector<T>& vec) { for(int i = 0; i < vec.size(); i++) { os << vec[i] << (i + 1 == vec.size() ? "" : " "); } return os; } template<typename T> ostream& operator << (ostream& os, deque<T>& deq) { for(int i = 0; i < deq.size(); i++) { os << deq[i] << (i + 1 == deq.size() ? "" : " "); } return os; } template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) { os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& pair_var) { os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) { for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) { os << "(" << itr->first << ", " << itr->second << ")"; itr++; if(itr != map_var.end()) os << ","; itr--; } return os; } template<typename T> ostream& operator << (ostream& os, set<T>& set_var) { for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) { os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--; } return os; } template<typename T> void outa(T a[], ll s, ll t) { for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";} cout << endl; } void dump_func() {cout << endl;} template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) { cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...); } ll n; ll a[20005]; bool b[1<<10], nb[1<<10]; set<ll> S; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; rep(i, 1, n) cin >> a[i]; S.insert(0); b[0] = true; ll add = 0, N = 1<<10; rep(i, 1, n){ add += a[i]; rep(j, 0, N-1) nb[j] = false; rep(j, 0, N-1) nb[(j+a[i])%N] |= b[j]; rep(j, 0, N-1) if(b[j]) S.insert((j&a[i])-add), nb[j&a[i]] = true; rep(j, 0, N-1) b[j] = nb[j]; outl(sz(S)); } return 0; }