# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464020 | CyberCow | Rack (eJOI19_rack) | C++17 | 13 ms | 8460 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 <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <string>
#include <cmath>
#include <map>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <stack>
using namespace std;
using ll = long long;
int a[2000000];
int b[2000000];
int erk = 1;
void rec(int p, int qan)
{
if (p >= erk)
{
a[p - erk] = qan;
}
else
{
rec(p * 2, (qan + 1) / 2);
rec(p * 2 + 1, qan / 2);
}
}
void rec1(int p, int qan)
{
if (p >= erk)
{
b[p - erk] = qan;
}
else
{
rec1(p * 2, (qan + 1) / 2);
rec1(p * 2 + 1, qan / 2);
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, i, j, k;
cin >> n >> k;
for ( i = 0; i < n; i++)
{
erk *= 2;
}
rec(1, k);
rec1(1, k - 1);
i = 0;
while (a[i] == b[i])
{
i++;
}
cout << i + 1;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |