# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147632 | xDWaffle | Ljetopica (COI19_ljetopica) | C++11 | 2 ms | 376 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 <bits/stdc++.h>
#define ff(j, a, b) for(int j=a;j<b;j++)
#define pb push_back;
using namespace std;
typedef long long ll;
ll n, k;
ll a, b, path;
ll check_pathing(ll x)
{
return (x<=b && x>=a) ? x : 0;
}
void load_path()
{
path=pow(2, n-1);
ff(j, 0, n-1)
{
char tmp;
cin >> tmp;
if(tmp=='R')
{
path+=pow(2, n-2-j);
}
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |