Submission #960305

#TimeUsernameProblemLanguageResultExecution timeMemory
960305penguin133Parrots (IOI11_parrots)C++17
81 / 100
3 ms1732 KiB
#include <bits/stdc++.h> using namespace std; //#define int long long #define pi pair<int, int> #define pii pair<int, pi> #define fi first #define se second #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #endif mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); #include "encoder.h" #include "encoderlib.h" void encode(int N, int M[]) { if(N <= 32){ for(int i = 0; i < N; i++){ for(int j = 0; j < 8; j++){ if(M[i] >> j & 1){ send(i * 8 + j); } } } } }
#include <bits/stdc++.h> using namespace std; //#define int long long #define pi pair<int, int> #define pii pair<int, pi> #define fi first #define se second #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #endif mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); #include "decoder.h" #include "decoderlib.h" void decode(int N, int L, int X[]) { int ans[300] = {0}; if(N <= 32){ for(int i = 0; i < L; i++){ int t = X[i] / 8, t1 = X[i] % 8; ans[t] += (1<<t1); } for(int i = 0; i < N; i++)output(ans[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...