Submission #3415586


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <db, db> pdd;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;

#define FOR(k,a,b) for(int k=(a); k<=(b); ++k)
#define IFOR(k,a,b) for(int k=(a); k>=(b); --k)
#define REP(k,a) for(int k=0; k<(a);++k)
#define IREP(k,a) for(int k=a-1; k>=(0);--k)
#define SZ(a) int((a).size())
#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define x first
#define y second
#define INF 1000000001
#define INFLONG 1000000000000000000
#define MOD 1000000007
#define MAX 100
#define ITERS 100
#define MAXM 200000
#define MAXN 1000000
#define PI 3.1415926535897932384626
#define ERR -987654321
#define MEM(a,b) memset(a,b,sizeof(a));
#define read1(a) scanf("%d",&a)
#define read2(a,b) scanf("%d%d",&a,&b)
#define read3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define readl1(a) scanf("%lld",&a)
#define readl2(a,b) scanf("%lld%lld",&a,&b)
#define readl3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)

int n, a[MAXN], f[MAXN];
set<int> bit[32];

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    int rn = uniform_int_distribution<int>(0, MAXN)(rng);

    cin>>n;
    REP(i,n) cin>>a[i];

    int p = n-1;
    ll res = 0;
    IREP(i,n) {
        int l = i, r = n-1;
        REP(j,31) {
            if(!(a[i] & (1<<j))) continue;
            if(!bit[j].empty()) r = min(r, (*bit[j].begin())-1);
            bit[j].insert(i);
        }
        f[i] = r;
        p = min(p,r);
        res = (res + p - l + 1);
    }
    cout<<res;
    return 0;
}



Submission Info

Submission Time
Task D - Xor Sum 2
User alokpatra1998
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1827 Byte
Status AC
Exec Time 665 ms
Memory 98944 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 38
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 2304 KB
sample_02.txt AC 1 ms 2304 KB
sample_03.txt AC 1 ms 2304 KB
subtask_1_01.txt AC 1 ms 2304 KB
subtask_1_02.txt AC 1 ms 2304 KB
subtask_1_03.txt AC 19 ms 4992 KB
subtask_1_04.txt AC 2 ms 2432 KB
subtask_1_05.txt AC 122 ms 30208 KB
subtask_1_06.txt AC 197 ms 38528 KB
subtask_1_07.txt AC 3 ms 2944 KB
subtask_1_08.txt AC 121 ms 27008 KB
subtask_1_09.txt AC 39 ms 11008 KB
subtask_1_10.txt AC 41 ms 11520 KB
subtask_1_11.txt AC 94 ms 24064 KB
subtask_1_12.txt AC 253 ms 44800 KB
subtask_1_13.txt AC 8 ms 4608 KB
subtask_1_14.txt AC 6 ms 2560 KB
subtask_1_15.txt AC 10 ms 4608 KB
subtask_1_16.txt AC 2 ms 2304 KB
subtask_1_17.txt AC 23 ms 5120 KB
subtask_1_18.txt AC 43 ms 9856 KB
subtask_1_19.txt AC 267 ms 51968 KB
subtask_1_20.txt AC 665 ms 98944 KB
subtask_1_21.txt AC 158 ms 33664 KB
subtask_1_22.txt AC 380 ms 62080 KB
subtask_1_23.txt AC 57 ms 14464 KB
subtask_1_24.txt AC 59 ms 14464 KB
subtask_1_25.txt AC 125 ms 29184 KB
subtask_1_26.txt AC 275 ms 47744 KB
subtask_1_27.txt AC 23 ms 5120 KB
subtask_1_28.txt AC 23 ms 5120 KB
subtask_1_29.txt AC 23 ms 5120 KB
subtask_1_30.txt AC 23 ms 5120 KB
subtask_1_31.txt AC 23 ms 5120 KB
subtask_1_32.txt AC 23 ms 5120 KB