# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974390 | 12345678 | Broken Device (JOI17_broken_device) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int kx=65;
long long Bruno( int N, int A[] ){
vector<ll> p(kx);
ll res=0, cnt=0;
p[0]=1;
for (int i=1; i<kx; i++) p[i]=p[i-1]*2;
for (int i=0; i<75; i++) if (A[2*i]) res+=p[cnt]*A[2*i+1], cnt++;
return res;
}