제출 #188627

#제출 시각아이디문제언어결과실행 시간메모리
188627awlintqaa앵무새 (IOI11_parrots)C++14
81 / 100
15 ms2032 KiB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #include <bits/stdc++.h> using namespace std; #define sqr 500 #define mid (l+r)/2 #define pb push_back #define ppb pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define ins insert #define era erase #define C continue #define mem(dp,i) memset(dp,i,sizeof(dp)) #define mset multiset typedef long long ll; typedef long double ld; typedef pair<int,int> pi; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; const ll mod=1000000007;//998244353; const ll inf=1e18*4; const ld pai=acos(-1); #include "encoder.h" #include "encoderlib.h" map<pi,int>id12; map<int,pi>id21; void fill(){ int num=0; for(int i=0;i<32;i++){ for(int j=0;j<8;j++){ id12[{i,j}]=num; id21[num]={i,j}; num++; } } } void encode(int N, int M[]){ fill(); for(int i=0;i<N;i++){ int x=M[i]; for(int j=0;j<8;j++){ if((x&(1<<j)))send(id12[{i,j}]); } } }
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #include <bits/stdc++.h> using namespace std; #define sqr 500 #define mid (l+r)/2 #define pb push_back #define ppb pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define ins insert #define era erase #define C continue #define mem(dp,i) memset(dp,i,sizeof(dp)) #define mset multiset typedef long long ll; typedef long double ld; typedef pair<int,int> pi; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; const ll mod=1000000007;//998244353; const ll inf=1e18*4; const ld pai=acos(-1); #include "decoder.h" #include "decoderlib.h" map<pi,int>id12; map<int,pi>id21; void fill(){ int num=0; for(int i=0;i<32;i++){ for(int j=0;j<8;j++){ id12[{i,j}]=num; id21[num]={i,j}; num++; } } } int ret[39]; void decode(int N, int L, int X[]){ mem(ret,0); fill(); for(int i=0;i<L;i++){ int x=X[i]; pi ans=id21[x]; ret[ans.fi]+=(1<<ans.se); } for(int i=0;i<N;i++){ output(ret[i]); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...