| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 585499 | 79brue | Ancient Machine (JOI21_ancient_machine) | C++17 | 56 ms | 9568 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 "Anna.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
namespace nAnna{
int n;
int arr[100005];
int first0=-1, last2=-1, last1=-1;
bool bits[200005];
ll bitSeq[2002];
ll DP[100][2];
ll calc(vector<bool> v){
assert(v.size() == 63);
ll val = 0;
for(int i=0; i<63; i++){
if(v[i] == 1) val += DP[63-i][0];
}
return val;
}
void Anna(int N, vector<char> _s){
n = N;
for(int i=0; i<n; i++) arr[i] = _s[i] - 'X';
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||