#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "encoder.h"
#include "encoderlib.h"
void encode(int n, int a[])
{
mt19937 rng(347838713);
rep(i,n){
int x = a[i];
x ^= rng()%256;
rep(bit,4){
int f1 = 1<<bit, f2 = 1<<(bit+4);
int b1 = 0, b2 = 0;
if(x&f1) b1 = 1;
if(x&f2) b2 = 1;
int times = b1|(b2<<1);
int val = i*4+bit;
rep(j,times){
send(val);
}
}
}
}
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "decoder.h"
#include "decoderlib.h"
void decode(int n, int m, int X[])
{
vector<int> cnt(n*4);
rep(i,m){
cnt[X[i]]++;
}
vector<int> a(n);
rep(i,n*4){
int c = cnt[i];
if(!c) conts;
int ind = i/4, bit = i%4;
int f1 = 1<<bit, f2 = 1<<(bit+4);
if(c&1){
a[ind] |= f1;
}
if(c&2){
a[ind] |= f2;
}
}
mt19937 rng(347838713);
rep(i,n){
a[i] ^= rng()%256;
}
rep(i,n){
output(a[i]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
780 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1812 KB |
Output is correct |
2 |
Correct |
2 ms |
1312 KB |
Output is correct |
3 |
Correct |
2 ms |
1312 KB |
Output is correct |
4 |
Correct |
2 ms |
1320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1308 KB |
Output is correct |
2 |
Correct |
2 ms |
1308 KB |
Output is correct |
3 |
Correct |
2 ms |
1316 KB |
Output is correct |
4 |
Correct |
2 ms |
1316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1304 KB |
Output is correct |
2 |
Correct |
2 ms |
1328 KB |
Output is correct |
3 |
Correct |
3 ms |
1364 KB |
Output is correct |
4 |
Correct |
4 ms |
1328 KB |
Output is correct |
5 |
Correct |
3 ms |
1340 KB |
Output is correct |
6 |
Correct |
3 ms |
1328 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
1328 KB |
partially correct P=7.750000 |
2 |
Partially correct |
3 ms |
1332 KB |
partially correct P=6.781250 |
3 |
Partially correct |
3 ms |
1340 KB |
partially correct P=7.030303 |
4 |
Partially correct |
6 ms |
1356 KB |
partially correct P=6.620000 |
5 |
Partially correct |
7 ms |
1368 KB |
partially correct P=6.633333 |
6 |
Partially correct |
6 ms |
1372 KB |
partially correct P=6.682540 |
7 |
Partially correct |
7 ms |
1376 KB |
partially correct P=6.718750 |