Submission #300954

#TimeUsernameProblemLanguageResultExecution timeMemory
300954errorgornParrots (IOI11_parrots)C++14
52 / 100
4 ms1536 KiB
#include "encoder.h" #include "encoderlib.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define ii pair<ll,ll> #define iii pair<ii,ll> #define fi first #define se second #define endl '\n' #define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--)) #define all(x) (x).begin(),(x).end() #define sz(x) (int)(x).size() void encode(int n, int arr[]){ vector<int> bits; rep(x,0,n){ int curr=arr[x]; rep(y,0,8){ bits.push_back(curr&1); curr>>=1; } } rep(x,0,n*8){ send(x<<1|bits[x]); } }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define ii pair<ll,ll> #define iii pair<ii,ll> #define fi first #define se second #define endl '\n' #define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--)) #define all(x) (x).begin(),(x).end() #define sz(x) (int)(x).size() void decode(int n, int l, int arr[]){ vector<int> bits(l); rep(x,0,l){ bits[arr[x]>>1]=arr[x]&1; } reverse(all(bits)); rep(x,0,n){ int curr=0; rep(y,0,8){ curr|=bits.back()<<y; bits.pop_back(); } output(curr); } }
#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...