oj.uz

Submission #972133

# Submission time Handle Problem Language Result Execution time Memory
972133 2024-04-30T07:00:56 Z tamir1 Permutation (APIO22_perm) C++17
71.2154 / 100
 10 ms 1116 KB 
#include "perm.h"
#include <iostream>
#define ll long long
using namespace std;
vector<int> construct_permutation(long long k)
{
	ll t=0,i,j,sum=0,idx=0;
	k--;
	vector<ll> v,u;
	while(true){
		if(t>k) break;
		v.push_back(t);
		t=t*2+1;
	}
	while(k>0){
		for(i=v.size()-1;i>=0;i--){
			if(v[i]<=k){
				u.push_back(i);
				k-=v[i];
				break;
			}
		}
	}
	for(i=0;i<u.size();i++) sum+=u[i];
	vector<int> ans(sum);
	for(i=u.size()-1;i>=0;i--){
		for(j=sum-u[i];j<sum;j++){
			ans[j]=idx;
			idx++;
		}
		sum-=u[i];
	}
	return ans;
}

Compilation message

perm.cpp: In function 'std::vector<int> construct_permutation(long long int)':
perm.cpp:24:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |  for(i=0;i<u.size();i++) sum+=u[i];
      |          ~^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
61.215384618 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Partially correct 1 ms 348 KB Partially correct
4 Partially correct 2 ms 348 KB Partially correct
5 Partially correct 4 ms 604 KB Partially correct
6 Partially correct 4 ms 668 KB Partially correct
7 Partially correct 7 ms 844 KB Partially correct
8 Partially correct 8 ms 1116 KB Partially correct
9 Correct 1 ms 348 KB Output is correct
10 Partially correct 10 ms 1116 KB Partially correct
11 Partially correct 8 ms 856 KB Partially correct
12 Partially correct 7 ms 860 KB Partially correct
13 Partially correct 9 ms 1112 KB Partially correct