| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1351110 | MMihalev | Broken Device 2 (JOI22_device2) | C++20 | 258 ms | 21312 KiB |
#include "Anna.h"
#include <utility>
#include <vector>
using namespace std;
const int BITS=60;
int Declare()
{
return ((BITS)*(BITS+1))/2;
}
std::pair<std::vector<int>, std::vector<int> > Anna(long long A)
{
vector<int>X,digs;
while(A!=0)
{
digs.push_back(A%2);
A/=2;
}
int times=1;
for(int d:digs)
{
int curtimes=times;
while(curtimes--)
{
X.push_back(d);
}
times++;
}
return make_pair(X,X);
}
#include "Bruno.h"
#include <utility>
#include <vector>
using namespace std;
long long Bruno(std::vector<int> u)
{
long long ans=0;
int bit=0;
int cnt0=0,cnt1=0;
for(int d:u)
{
if(d==0)cnt0++;
else cnt1++;
if(cnt0==bit+1)
{
cnt0-=2*(bit+1);
bit++;
}
if(cnt1==bit+1)
{
cnt1-=2*(bit+1);
ans+=(1<<bit);
bit++;
}
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
