oj.uz

답안 #602254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
602254 2022-07-22T19:09:19 Z duality 순열 (APIO22_perm) C++17
91.3333 / 100
 6 ms 340 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "perm.h"

vector<int> construct_permutation(long long int k) {
    int i,j,t = 2;
    k--;
    vi best = vi(125,0);
    while (t--) {
        LLI K = k;
        vi curr;
        vlli dp;
        int r = rand() % 80;
        while (K > 0) {
            LLI s = 1;
            vi inv(curr.size());
            for (i = 0; i < curr.size(); i++) inv[curr[i]] = i;
            for (i = 0; i < curr.size(); i++) {
                if (s+dp[inv[i]] > K) break;
                else {
                    if ((t > 1) && (curr.size() == r) && ((rand() % 10) == 0)) break;
                    s += dp[inv[i]];
                }
            }
            int t = i;
            dp.pb(s);
            for (i = 0; i < curr.size(); i++) curr[i] += (curr[i] >= t);
            curr.pb(t);
            K -= dp.back();
        }
        if (curr.size() < best.size()) best = curr;
    }
    return best;
}

Compilation message

perm.cpp: In function 'std::vector<int> construct_permutation(long long int)':
perm.cpp:71:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |             for (i = 0; i < curr.size(); i++) inv[curr[i]] = i;
      |                         ~~^~~~~~~~~~~~~
perm.cpp:72:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             for (i = 0; i < curr.size(); i++) {
      |                         ~~^~~~~~~~~~~~~
perm.cpp:75:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   75 |                     if ((t > 1) && (curr.size() == r) && ((rand() % 10) == 0)) break;
      |                                     ~~~~~~~~~~~~^~~~
perm.cpp:81:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |             for (i = 0; i < curr.size(); i++) curr[i] += (curr[i] >= t);
      |                         ~~^~~~~~~~~~~~~
perm.cpp:60:11: warning: unused variable 'j' [-Wunused-variable]
   60 |     int i,j,t = 2;
      |           ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct

Subtask #2
81.333333333 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Partially correct 3 ms 340 KB Partially correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Partially correct 5 ms 340 KB Partially correct
9 Correct 3 ms 340 KB Output is correct
10 Partially correct 6 ms 336 KB Partially correct
11 Partially correct 5 ms 340 KB Partially correct
12 Partially correct 4 ms 340 KB Partially correct
13 Partially correct 5 ms 340 KB Partially correct