// Bolatulu
#include <bits/stdc++.h>
#include "communication.h"
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define eb emplace_back
#define ins insert
#define F first
#define S second
#define md (tl+tr)/2
#define TL v+v,tl,md
#define TR v+v+1,md+1,tr
#define Tl t[v].l,tl,md
#define Tr t[v].r,md+1,tr
#define all(x) (x).begin(),(x).end()
#define yes cout << "YES\n"
#define no cout << "NO\n"
// #define int long long
#define file(s) freopen(s".in", "r", stdin); freopen(s".out", "w", stdout);
#define ld long double
using namespace std;
int binpow(int a,int n,int M) {
if (n==0)
return 1;
if (n%2!=0)
return (a * binpow(a,n-1,M))%M;
int z=binpow(a,n/2,M);
return (z*z)%M;
}
const ll INF = 1e18+7;
const int N = 1e5+7;
const int M = 1e4+7;
const ld eps = 1e-3;
int h=11,m=30;
void encode(int n,int x) {
for (int j=1;j<m;j++) {
int bit=(x>>j&1),i=0;
bool ok=0;
while (!ok and i<h) {
ok=send(0);
i++;
}
send(bit);
}
}
pair <int,int> decode(int n) {
int ans=0;
for (int j=1;j<m;j++) {
int i=0;
while (i<h and receive()==0)
i++;
ans+=(1<<j)*receive();
}
return {ans,ans+1};
}
/*
signed main() {
// file("jenga");
ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int test = 1;
solve(3);
// cin >> test;
while (test--) {
// solve();
if (test)
cout << '\n';
}
return 0;
}
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
59 ms |
328 KB |
Not correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
585 ms |
328 KB |
Not correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
