Pagini recente » Cod sursa (job #1489068) | Cod sursa (job #2221812) | Cod sursa (job #2425819) | Cod sursa (job #1580415) | Cod sursa (job #2282259)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
typedef long long ll;
const int N=100000+5;
int n;
ll cnt;
int v[N];
int aib[N];
inline void add(int p,int x)
{
for(int i=p;i<=n;i+=i&(-i))
{
aib[i]+=x;
}
}
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 70000) {
fwrite(buff, 1, 70000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[70000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
int main()
{
fin>>n>>cnt;
for(int i=1;i<=n;i++)
{
ll lft=n-i;
ll x=lft*(lft-1)/2;
if(cnt<=x)
{
v[i]=0;
}
else
{
v[i]=cnt-x;
}
cnt-=v[i];
}
for(int i=1;i<=n;i++)
{
v[i]++;
int r=0,pas=(1<<16);
int now=0;
while(pas)
{
if(r+pas<=n)
{
int id=r+pas;
if(id+now+aib[id]<v[i])
{
r+=pas;
now+=aib[id];
}
}
pas>>=1;
}
r++;
add(r,-1);
fout<<r<<" ";
}
fout<<"\n";
return 0;
}