oj.uz

답안 #124358

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124358 2019-07-03T08:11:51 Z nxteru 앵무새 (IOI11_parrots) C++14
100 / 100
 12 ms 1784 KB 
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void encode(int n, int m[]){
	ll dp[40][40],rs=0;
	for(int i=0;i<27;i++)dp[0][i]=1;
	for(int i=0;i<35;i++){
		for(int j=0;j<27;j++){
			if(i)dp[i][j]=dp[i-1][j];
			if(j)dp[i][j]+=dp[i][j-1];
		}
	}
	for(int i=0;i<n;i+=7){
		ll s=0,p=0;
		for(int j=i;j<n&&j<i+7;j++,p++){
			s*=256LL;
			s+=ll(m[j]);
		}
		p*=5;
		s++;
		for(int j=p-1;j>=0;j--){
			for(int k=0;k<min(256-rs,27LL);k++){
				if(dp[j][k]>=s){
					send(rs+k);
					if(k>0)s-=dp[j][k-1];
					break;
				}
			}
		}
		rs+=27;
	}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void decode(int n, int l, int x[]){
	ll dp[40][40],rs=0,xs=0;
	sort(x,x+l);
	for(int i=0;i<27;i++)dp[0][i]=1;
	for(int i=0;i<35;i++){
		for(int j=0;j<27;j++){
			if(i)dp[i][j]=dp[i-1][j];
			if(j)dp[i][j]+=dp[i][j-1];;
		}
	}
	for(int i=0;i<n;i+=7){
		ll s=0,p=0;
		for(int j=i;j<n&&j<i+7;j++,p++);
		p*=5;
		for(int j=p-1;j>=0;j--)if(x[xs+j]-rs>0)s+=dp[j][x[xs+j]-rs-1];
		xs+=p;
		rs+=27;
		p/=5;
		for(ll i=p-1;i>=0;i--)output((s>>(i*8LL))&255LL);
	}
}

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1520 KB Output is correct
2 Correct 5 ms 1520 KB Output is correct
3 Correct 5 ms 1520 KB Output is correct
4 Correct 5 ms 1520 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1520 KB Output is correct
2 Correct 5 ms 1520 KB Output is correct
3 Correct 5 ms 1520 KB Output is correct
4 Correct 5 ms 1520 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1520 KB Output is correct
2 Correct 6 ms 1520 KB Output is correct
3 Correct 7 ms 1528 KB Output is correct
4 Correct 8 ms 1776 KB Output is correct
5 Correct 8 ms 1520 KB Output is correct
6 Correct 8 ms 1784 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1528 KB Output is correct - P = 5.000000
2 Correct 7 ms 1776 KB Output is correct - P = 5.000000
3 Correct 7 ms 1776 KB Output is correct - P = 5.000000
4 Correct 10 ms 1776 KB Output is correct - P = 5.000000
5 Correct 12 ms 1776 KB Output is correct - P = 5.000000
6 Correct 11 ms 1784 KB Output is correct - P = 5.000000
7 Correct 11 ms 1776 KB Output is correct - P = 5.000000