結果
問題 | No.1505 Zero-Product Ranges |
ユーザー |
![]() |
提出日時 | 2021-05-14 22:10:23 |
言語 | C++14 (gcc 11.2.0 + boost 1.78.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 2,794 bytes |
コンパイル時間 | 1,627 ms |
使用メモリ | 4,760 KB |
最終ジャッジ日時 | 2022-11-25 18:37:41 |
合計ジャッジ時間 | 3,966 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
3,380 KB |
testcase_01 | AC | 1 ms
3,452 KB |
testcase_02 | AC | 1 ms
3,452 KB |
testcase_03 | AC | 23 ms
4,736 KB |
testcase_04 | AC | 23 ms
4,720 KB |
testcase_05 | AC | 10 ms
3,704 KB |
testcase_06 | AC | 10 ms
3,628 KB |
testcase_07 | AC | 7 ms
3,704 KB |
testcase_08 | AC | 9 ms
3,620 KB |
testcase_09 | AC | 8 ms
3,700 KB |
testcase_10 | AC | 8 ms
3,664 KB |
testcase_11 | AC | 10 ms
3,640 KB |
testcase_12 | AC | 8 ms
3,716 KB |
testcase_13 | AC | 14 ms
3,968 KB |
testcase_14 | AC | 13 ms
3,904 KB |
testcase_15 | AC | 22 ms
4,756 KB |
testcase_16 | AC | 26 ms
4,692 KB |
testcase_17 | AC | 25 ms
4,624 KB |
testcase_18 | AC | 26 ms
4,624 KB |
testcase_19 | AC | 2 ms
3,504 KB |
testcase_20 | AC | 1 ms
3,452 KB |
testcase_21 | AC | 1 ms
3,540 KB |
testcase_22 | AC | 25 ms
4,760 KB |
testcase_23 | AC | 24 ms
4,628 KB |
testcase_24 | AC | 24 ms
4,672 KB |
testcase_25 | AC | 23 ms
4,364 KB |
testcase_26 | AC | 24 ms
4,756 KB |
testcase_27 | AC | 23 ms
4,388 KB |
testcase_28 | AC | 23 ms
4,360 KB |
testcase_29 | AC | 25 ms
4,756 KB |
testcase_30 | AC | 25 ms
4,692 KB |
testcase_31 | AC | 24 ms
4,688 KB |
testcase_32 | AC | 14 ms
3,876 KB |
testcase_33 | AC | 12 ms
3,844 KB |
testcase_34 | AC | 15 ms
3,928 KB |
testcase_35 | AC | 11 ms
3,700 KB |
testcase_36 | AC | 11 ms
3,700 KB |
testcase_37 | AC | 13 ms
3,980 KB |
testcase_38 | AC | 13 ms
3,944 KB |
testcase_39 | AC | 13 ms
3,904 KB |
testcase_40 | AC | 14 ms
3,896 KB |
testcase_41 | AC | 14 ms
3,976 KB |
testcase_42 | AC | 3 ms
3,640 KB |
testcase_43 | AC | 3 ms
3,532 KB |
testcase_44 | AC | 3 ms
3,560 KB |
testcase_45 | AC | 3 ms
3,440 KB |
testcase_46 | AC | 2 ms
3,616 KB |
testcase_47 | AC | 3 ms
3,372 KB |
testcase_48 | AC | 3 ms
3,632 KB |
testcase_49 | AC | 2 ms
3,420 KB |
testcase_50 | AC | 3 ms
3,548 KB |
testcase_51 | AC | 3 ms
3,572 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> //#include <atcoder/all> using namespace std; //using namespace atcoder; #define DEBUG #ifdef DEBUG template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << '{'; for(int i = 0; i < (int)v.size(); i++) { if(i) { os << ','; } os << v[i]; } os << '}'; return os; } void debugg() { cerr << endl; } template <class T, class... Args> void debugg(const T &x, const Args &... args) { cerr << " " << x; debugg(args...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef pair<int,int> pii; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = (1<<30)-1; const ll linf = 1LL<<61; const int MAX = 510000; int dy[8] = {0,1,0,-1,1,-1,-1,1}; int dx[8] = {-1,0,1,0,1,-1,1,-1}; const double pi = acos(-1); const double eps = 1e-9; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T> inline void print(T &a){ int sz = a.size(); for(auto itr = a.begin(); itr != a.end(); itr++){ cout << *itr; sz--; if(sz) cout << " "; } cout << "\n"; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){ cout << a << " " << b << "\n"; } template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } void mark() {cout << "#" << "\n";} ll pcount(ll x) {return __builtin_popcountll(x);} const int mod = 1e9 + 7; //const int mod = 998244353; int main(){ ll n; cin >> n; vl a(n); rep(i,n) cin >> a[i]; ll ans = n*(n+1)/2; rep(i,n){ if(a[i] == 0) continue; ll j=i+1; while(j<n && a[j]==1) j++; ans -= (j-i)*(j-i+1)/2; i = j; } cout << ans << endl; }