#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define st first
#define nd second
#define pb push_back
#define pq priority_queue
#define all(x) begin(x), end(x)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
#include "communication.h"
vector<int> V = {1,1,0,0,1,0,0,0,0,0,1,1,1,1,1,1,1,0,1,0,1,0,0,1,0,0,1,0,0,1,1,0,1,0,1,0,1,1,1,0,1,1,0,1,1,0,1,1,1,0,1,0,0,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0,0,0,0,0,0,1,0,0,1,0,1,1,0,0,0,1,1};
//bool aux[250];
/*
vector<int> v;
int send(int x){
cout<<x<<" SENDED"<<endl;
int c;
cin >> c;
v.pb(c);
return c;
}
int P = 0;
int receive(){
cout<<"SEND ME"<<endl;
int c;
return v[P++];
}
*/
void encode(int N, int X){
srand(N);
int pos = 0;
while(pos < 2){
int bit = 0;
if(X & (1<<pos)) bit = 1;
int c = rand() + pos;
int nxt = V[c%100];
if(c % 2){
int r = send(nxt);
if(r != nxt){
send(bit);
++pos;
}
}
else{
int r1 = send(bit);
int r2 = send(bit);
if(r1 == r2){
++pos;
}
}
}
}
std::pair<int, int> decode(int N){
srand(N);
int pos = 0;
int X = 0;
while(pos < 2){
int c = rand() + pos;
int nxt = V[c%100];
if(c % 2){
int r = receive();
if(r != nxt){
int bit = receive();
if(bit == 1) X |= (1<<pos);
++pos;
}
}
else{
int r1 = receive();
int r2 = receive();
if(r1 == r2){
if(r1 == 1) X |= (1<<pos);
++pos;
}
}
}
return {X, X};
}/*
int main(){
encode(10, 1);
decode(10);
}
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
1816 KB |
Output is correct |
| 2 |
Correct |
35 ms |
1668 KB |
Output is correct |
| 3 |
Correct |
19 ms |
1716 KB |
Output is correct |
| 4 |
Correct |
15 ms |
1944 KB |
Output is correct |
| 5 |
Correct |
20 ms |
1784 KB |
Output is correct |
| 6 |
Incorrect |
3 ms |
200 KB |
Not correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
49 ms |
220 KB |
Not correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
