이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#include "encoder.h"
#include "encoderlib.h"
void encode(int n, int m[]){
/*for(int i=0;i<n;i++){
for(int j=0;j<8;j++){
if(m[i]&(1<<j)){
send(j*n+i);
}
}
}*/
int co=0;
map<int,vector<int>> ss;
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
for(int k=0;k<10;k++){
for(int l=0;l<10;l++){
if(i+j+k+l<=7){
ss[co]={i,j,k,l};
co+=1;
}
}
}
}
}
for(int i=0;i<n;i++){
for(int k=0;k<4;k++){
// cout<<ss[m[i]][k]<<":";
for(int j=0;j<ss[m[i]][k];j++){
send(i*4+k);
// cout<<i*4+k<<endl;
}
}
// cout<<endl;
}
}
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#include "decoder.h"
#include "decoderlib.h"
void decode(int n, int l, int x[]){
int co=0;
map<vector<int>,int> ss;
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
for(int k=0;k<10;k++){
for(int l=0;l<10;l++){
if(i+j+k+l<=7){
ss[{i,j,k,l}]=co;
co+=1;
}
}
}
}
}
vector<vector<int>> freq;
for(int i=0;i<n;i++){
freq.pb({0,0,0,0});
}
for(int j=0;j<l;j++){
freq[x[j]/4][x[j]%4]+=1;
}
for(int j=0;j<n;j++){
output(ss[freq[j]]);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |