oj.uz

답안 #873734

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873734 2023-11-15T14:44:34 Z 12345678 앵무새 (IOI11_parrots) C++17
17 / 100
 2000 ms 175816 KB 
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O3", "unroll-loops")
using namespace std;

#define ll long long
const int nx=67, kx=256;

struct bignum
{
	vector<ll> val;
	bignum(): val(nx, 0){}
	bignum(ll x)
	{
		val.assign(nx, 0);
		for (int i=0; i<nx&&x>0; i++)
		{
			val[i]=x%kx;
			x/=kx;
		}
	}
	bignum &operator+=(const bignum &rhs)
	{
		ll carry=0;
		for (int i=0; i<nx; i++)
		{
			val[i]+=rhs.val[i]+carry;
			carry=val[i]/kx;
			val[i]-=carry*kx;
		}
		return *this;
	}
	bignum &operator-=(const bignum &rhs)
	{
		ll carry=0;
		for (int i=0; i<nx; i++)
		{
			val[i]-=rhs.val[i]+carry;
			carry=0;
			if (val[i]<0) {
				val[i]+=kx;
				carry++;
			}
		}
		return *this;
	}
	bignum &operator*=(const ll &rhs)
	{
		ll carry=0;
		for (int i=0; i<nx; i++)
		{
			val[i]*=rhs;
			val[i]+=carry;
			carry=val[i]/kx;
			val[i]-=carry*kx;
		}
		return *this;
	}
	friend bignum operator+(const bignum &lhs, const bignum &rhs) {return bignum(lhs)+=rhs;}
	friend bignum operator-(const bignum &lhs, const bignum &rhs) {return bignum(lhs)+=rhs;}
	friend bignum operator*(const bignum &lhs, const ll &rhs) {return bignum(lhs)*=rhs;}
	friend bignum operator*(const ll &lhs, const bignum &rhs) {return bignum(rhs)*=lhs;}
	int cmp(const bignum &rhs) {
		for (int i=nx-1; i>=0; i--)
		{
			if (val[i]<rhs.val[i]) return -1;
			if (val[i]>rhs.val[i]) return 1;
		}
		return 0;
	}
	bool operator<(const bignum &rhs) {return cmp(rhs)==-1;}
	bool operator>(const bignum &rhs) {return cmp(rhs)==1;}
	bool operator<=(const bignum &rhs) {return cmp(rhs)!=1;}
	bool operator>=(const bignum &rhs) {return cmp(rhs)!=-1;}
	bool operator==(const bignum &rhs) {return cmp(rhs)==0;}
	bool operator!=(const bignum &rhs) {return cmp(rhs)!=0;}
	string to_str()
	{
		auto res=val;
		while (res.size()>1&&res.back()==0) res.pop_back();
		reverse(res.begin(), res.end());
		string s="";
		for (auto x:res) s+=to_string(x)+" ";
		s.pop_back();
		return s;
	}
};


void encode(int N, int M[])
{
    bignum vl, tmp;
    vector<vector<bignum>> dp(580, vector<bignum> (270));
    for (int i=0; i<N; i++) vl.val[i]=M[N-1-i];
    for (int i=0; i<580; i++)
    {
        for (int j=0; j<=min(i, 269); j++)
        {
            if (j==0||j==i) dp[i][j]=1;
            else dp[i][j]=dp[i-1][j]+dp[i-1][j-1];
        }
    }
    vector<int> s(kx+1);
    int left=320;
    for (int i=0; i<kx; i++)
    {
        tmp=0;
        for (int j=left; j>=0; j--)
        {
            if (dp[kx-i-1+left-j][kx-i-1]+tmp>vl)
            {
                vl-=tmp;
                s[i]=j;
                left-=j;
                break;
            }
            tmp+=dp[kx-i-1+left-j][kx-i-1];
        }
    }
    s[kx]=left;
    for (int i=0; i<kx; i++) for (int j=0; j<s[i+1]; j++) send(i);
}

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O3", "unroll-loops")
using namespace std;

#define ll long long

const int nx=67, kx=256;

struct bignum
{
	vector<ll> val;
	bignum(): val(nx, 0){}
	bignum(ll x)
	{
		val.assign(nx, 0);
		for (int i=0; i<nx&&x>0; i++)
		{
			val[i]=x%kx;
			x/=kx;
		}
	}
	bignum &operator+=(const bignum &rhs)
	{
		ll carry=0;
		for (int i=0; i<nx; i++)
		{
			val[i]+=rhs.val[i]+carry;
			carry=val[i]/kx;
			val[i]-=carry*kx;
		}
		return *this;
	}
	bignum &operator-=(const bignum &rhs)
	{
		ll carry=0;
		for (int i=0; i<nx; i++)
		{
			val[i]-=rhs.val[i]+carry;
			carry=0;
			if (val[i]<0) {
				val[i]+=kx;
				carry++;
			}
		}
		return *this;
	}
	bignum &operator*=(const ll &rhs)
	{
		ll carry=0;
		for (int i=0; i<nx; i++)
		{
			val[i]*=rhs;
			val[i]+=carry;
			carry=val[i]/kx;
			val[i]-=carry*kx;
		}
		return *this;
	}
	friend bignum operator+(const bignum &lhs, const bignum &rhs) {return bignum(lhs)+=rhs;}
	friend bignum operator-(const bignum &lhs, const bignum &rhs) {return bignum(lhs)+=rhs;}
	friend bignum operator*(const bignum &lhs, const ll &rhs) {return bignum(lhs)*=rhs;}
	friend bignum operator*(const ll &lhs, const bignum &rhs) {return bignum(rhs)*=lhs;}
	int cmp(const bignum &rhs) {
		for (int i=nx-1; i>=0; i--)
		{
			if (val[i]<rhs.val[i]) return -1;
			if (val[i]>rhs.val[i]) return 1;
		}
		return 0;
	}
	bool operator<(const bignum &rhs) {return cmp(rhs)==-1;}
	bool operator>(const bignum &rhs) {return cmp(rhs)==1;}
	bool operator<=(const bignum &rhs) {return cmp(rhs)!=1;}
	bool operator>=(const bignum &rhs) {return cmp(rhs)!=-1;}
	bool operator==(const bignum &rhs) {return cmp(rhs)==0;}
	bool operator!=(const bignum &rhs) {return cmp(rhs)!=0;}
	string to_str()
	{
		auto res=val;
		while (res.size()>1&&res.back()==0) res.pop_back();
		reverse(res.begin(), res.end());
		string s="";
		for (auto x:res) s+=to_string(x)+" ";
		s.pop_back();
		return s;
	}
};

void decode(int N, int L, int X[])
{
    bignum res=0;
    int sm=0;
    vector<int> s(kx+1, 0);
    for (int i=0; i<L; i++) s[X[i]+1]++, sm++;
    s[0]=320-sm;
    vector<vector<bignum>> dp(580, vector<bignum> (270));
    for (int i=0; i<580; i++)
    {
        for (int j=0; j<=min(i, 269); j++)
        {
            if (j==0||j==i) dp[i][j]=1;
            else dp[i][j]=dp[i-1][j]+dp[i-1][j-1];
        }
    }
    int left=320;
    for (int i=0; i<kx; i++)
    {
        for (int j=left; j>s[i]; j--)
        {
            res+=dp[kx-i-1+left-j][kx-i-1];
        }
        left-=s[i];
    }
    res+=s[kx];
    vector<int> ans(N, 0);
    for (int i=0; i<N; i++) ans[N-1-i]=res.val[i];
    for (int i=0; i<N; i++) output(ans[i]);
}

/*
10
1 1 2 1 2 3 1 7 10 9
*/

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 858 ms 175816 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2068 ms 87944 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2066 ms 88028 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2051 ms 88020 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2060 ms 87968 KB Time limit exceeded
2 Execution timed out 2076 ms 88132 KB Time limit exceeded
3 Execution timed out 2044 ms 88200 KB Time limit exceeded
4 Execution timed out 2033 ms 87984 KB Time limit exceeded
5 Execution timed out 2050 ms 87980 KB Time limit exceeded
6 Execution timed out 2016 ms 88132 KB Time limit exceeded
7 Execution timed out 2045 ms 88236 KB Time limit exceeded