Cod sursa(job #3122709)

Utilizator PowerPlantNICOLAS ANDREI MANASIA PowerPlant Data 20 aprilie 2023 10:19:44
Problema Order Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 3.06 kb
#include <bits/stdc++.h>
#include <stdio.h>
#include <ctype.h>
#define lsb(x) ((x ^ (x-1)) & x)

using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        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 n;
int aib[30030];
bool vis[30030];
void update(int idx,int val)
{
    for(;idx<=n;idx+=lsb(idx))
        aib[idx]+=val;
    return ;
}

int query(int idx)
{
    int sum=0;
    for(;idx>0;idx-=lsb(idx))
        sum+=aib[idx];
    return sum;
}

int look(int k)
{
    int pos=0;
    for(int bit=16;bit>=0;--bit)
    {
        if(pos+(1<<bit)<=n && aib[pos+(1<<bit)]<k){
            pos+=(1<<bit);
            k-=aib[pos];
        }
    }
    return pos+1;

}



int main()
{
    InParser fin("order.in");
    OutParser fout("order.out");
    fin>>n;
    for(int i=1;i<=n;++i)
        update(i,1);
    int p=1;
    for(int i=1;i<=n;++i)
    {
        p=(p+i-1)%(n-i+1)+1;
        int x=look(p);
        update(x,-1);
        fout<<x<<" ";
        --p;
    }

    return 0;
}