oj.uz

Submission #916402

# Submission time Handle Problem Language Result Execution time Memory
916402 2024-01-25T19:43:43 Z Jakub_Wozniak Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 436 KB 
#include <bits/stdc++.h>
using namespace std;

vector <pair<int,int>> V;

vector<int> construct_permutation(long long n)
{
    long long akt = 200;
    vector <int> v;
    int r[200];

    while (n)
    {
        if (n == 1)
            break;
        if (n % 2)
        {
            v.push_back(0);
        }
        v.push_back(akt);
        n /= 2;
        akt--;
    }

    reverse(v.begin() , v.end());
    
    for(int i = 0 ; i < v.size() ; i++)
    {
        V.push_back({v[i],-i});
    }
    sort(V.begin() , V.end());

    akt = 0;
    for(int i = 0 ; i < V.size() ;i++)
    {
        r[-V[i].second] = akt;
        akt++;
    }


    for(int i = 0 ; i < V.size() ; i++)
    {
        v[i] = r[i]; 
    }
    V.clear();
    return v;
}

Compilation message

perm.cpp: In function 'std::vector<int> construct_permutation(long long int)':
perm.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i = 0 ; i < v.size() ; i++)
      |                     ~~^~~~~~~~~~
perm.cpp:34:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i = 0 ; i < V.size() ;i++)
      |                     ~~^~~~~~~~~~
perm.cpp:41:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int i = 0 ; i < V.size() ; i++)
      |                     ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #2
81.333333333 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 432 KB Output is correct
5 Partially correct 2 ms 344 KB Partially correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Partially correct 2 ms 348 KB Partially correct
9 Correct 1 ms 344 KB Output is correct
10 Partially correct 2 ms 436 KB Partially correct
11 Partially correct 2 ms 348 KB Partially correct
12 Partially correct 2 ms 348 KB Partially correct
13 Partially correct 2 ms 348 KB Partially correct