oj.uz

Submission #597597

# Submission time Handle Problem Language Result Execution time Memory
597597 2022-07-16T11:19:23 Z boris_mihov Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 340 KB 
#include "perm.h"
#include <iostream>
typedef long long llong;

int unused = 120;
std::vector < int > ans;
std::vector < int > construct_permutation(llong k)
{
    ans.clear();
    unused = 120;
    bool flag = false;
    for (int bit = 59 ; bit >= 0 ; --bit)
    {
        if ((k & (1LL << bit)) == 0) continue;
        if (!flag)
        {
            flag = 1;
            for (int i = unused - bit + 1 ; i <= unused ; ++i)
            {
                ans.push_back(i);
            }
            unused -= bit;
            continue;
        }
        ans.insert(ans.begin() + (int)(ans.size() - bit), unused--);
    }

    for (int &i : ans) i -= unused + 1;
	return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
81.333333333 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Partially correct 1 ms 340 KB Partially correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Partially correct 1 ms 300 KB Partially correct
9 Correct 1 ms 296 KB Output is correct
10 Partially correct 2 ms 340 KB Partially correct
11 Partially correct 2 ms 300 KB Partially correct
12 Partially correct 1 ms 340 KB Partially correct
13 Partially correct 1 ms 340 KB Partially correct