oj.uz

Submission #731035

# Submission time Handle Problem Language Result Execution time Memory
731035 2023-04-26T20:12:34 Z aykhn Rack (eJOI19_rack) C++14
40 / 100
 8 ms 4436 KB 
#include <bits/stdc++.h>

/*
    author: aykhn
    4/24/2023
*/

using namespace std;

typedef long long ll;

#define OPT ios_base::sync_with_stdio(0); \
            cin.tie(0); \
            cout.tie(0)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(v) v.begin(), v.end()
#define mpr make_pair
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount
#define print(v) for(int i = 0; i < v.size(); i++) cout << v[i] << " "; cout<<endl;

const ll mod = 1000000007;

vector<int> v(1048577, 0);
int n, k, val;
int ans;

void f(int i, int from)
{
    if (val == k) ans = i;
    v[i] = val++;
    int pow = (1 << n);

    while (pow > from)
    {
        f(i + pow, pow);
        pow >>= 1;
    }
}

int main()
{
    OPT;
    cin >> n >> k;
    n--;

    val = 1;

    f(1, 0);

    cout << ans << endl;

}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4436 KB Output is correct
5 Correct 3 ms 4436 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4436 KB Output is correct
5 Correct 3 ms 4436 KB Output is correct
6 Correct 3 ms 4436 KB Output is correct
7 Correct 3 ms 4436 KB Output is correct
8 Correct 3 ms 4400 KB Output is correct
9 Correct 4 ms 4436 KB Output is correct
10 Correct 8 ms 4436 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4436 KB Output is correct
5 Correct 3 ms 4436 KB Output is correct
6 Correct 3 ms 4436 KB Output is correct
7 Correct 3 ms 4436 KB Output is correct
8 Correct 3 ms 4400 KB Output is correct
9 Correct 4 ms 4436 KB Output is correct
10 Correct 8 ms 4436 KB Output is correct
11 Incorrect 2 ms 4436 KB Output isn't correct
12 Halted 0 ms 0 KB -