QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#561945 | #9237. Message | Zanite# | 29.314 | 291ms | 4088kb | C++20 | 3.6kb | 2024-09-13 13:26:18 | 2024-09-13 13:26:18 |
Judging History
answer
#include "message.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define All(x) x.begin(), x.end()
#define debug(x) cout << #x << " = " << x << "\n"
template<typename T> bool chmax(T &u, T v) { if (u < v) { u = v; return true; } return false; }
template<typename T>
ostream& operator<<(ostream& os, const vector<T> &v) {
os << "["; bool _first = true;
for (auto i : v) { if (!_first) { os << ", "; } os << i; _first = false; }
return os << "]";
}
const ll INF = 1'000'000'000'000'000'000;
const int PKT_SIZE = 31;
const int M_SZ_BITS = 10;
void send_message(vector<bool> M, vector<bool> C) {
int S = M.size();
vector<int> free_indices;
for (int i = 0; i < PKT_SIZE; i++) {
if (!C[i]) free_indices.push_back(i);
send_packet(vector<bool>(31, C[i]));
}
vector<bool> T;
for (int i = 0; i < M_SZ_BITS; i++) T.push_back((S-1) & (1 << i));
for (auto i : M) T.push_back(i);
int ptr = 0;
while (ptr < (int)T.size()) {
vector<bool> cur(PKT_SIZE);
for (auto idx : free_indices) if (ptr < (int)T.size()) {
cur[idx] = T[ptr++];
}
send_packet(cur);
}
}
vector<bool> receive_message(vector<vector<bool>> R) {
vector<int> free_indices;
for (int i = 0; i < PKT_SIZE; i++) {
auto &v = R[i];
int c0 = count(v.begin(), v.end(), 0);
int c1 = count(v.begin(), v.end(), 1);
if (c0 > c1) free_indices.push_back(i);
}
// debug(free_indices);
vector<bool> transmitted;
for (int i = PKT_SIZE; i < (int)R.size(); i++) {
for (auto j : free_indices) transmitted.push_back(R[i][j]);
}
int sz = 0;
for (int i = 0; i < M_SZ_BITS; i++) if (transmitted[i]) {
sz |= (1 << i);
}
sz++;
vector<bool> ans;
for (int i = M_SZ_BITS; i < M_SZ_BITS + sz; i++) ans.push_back(transmitted[i]);
return ans;
}
#ifdef Zanite
namespace {
const int PACKET_SIZE = 31;
const int CALLS_CNT_LIMIT = 100;
int calls_cnt;
vector<bool> C(PACKET_SIZE);
vector<vector<bool>> R;
void quit(const char* message) {
printf("%s\n", message);
exit(0);
}
void run_scenario() {
R.clear();
calls_cnt = 0;
int S;
assert(1 == scanf("%d", &S));
vector<bool> M(S);
for (int i = 0; i < S; i++) {
int bit;
assert(1 == scanf("%d", &bit));
assert((bit == 0) || (bit == 1));
M[i] = bit;
}
for (int i = 0; i < PACKET_SIZE; i++) {
int bit;
assert(1 == scanf("%d", &bit));
assert((bit == 0) || (bit == 1));
C[i] = bit;
}
send_message(M, C);
vector<bool> D = receive_message(R);
int K = (int)R.size();
int L = (int)D.size();
printf("%d %d\n", K, L);
for (int i = 0; i < L; i++)
printf("%s%d", (i == 0 ? "" : " "), (D[i] ? 1 : 0));
printf("\n");
}
vector<bool> taint(const vector<bool>& A) {
vector<bool> B = A;
bool bit = 0;
for (int i = 0; i < PACKET_SIZE; i++)
if (C[i] == 1) {
B[i] = bit;
bit = !bit;
}
return B;
}
} // namespace
vector<bool> send_packet(vector<bool> A) {
calls_cnt++;
if (calls_cnt > CALLS_CNT_LIMIT)
quit("Too many calls");
if ((int)A.size() != PACKET_SIZE)
quit("Invalid argument");
vector<bool> B = taint(A);
R.push_back(B);
return B;
}
int main() {
int T;
assert(1 == scanf("%d", &T));
for (int i = 1; i <= T; i++)
run_scenario();
}
#endif
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 10
Accepted
Test #1:
score: 10
Accepted
time: 80ms
memory: 3816kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #2:
score: 10
Accepted
time: 110ms
memory: 3976kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #3:
score: 10
Accepted
time: 125ms
memory: 4008kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #4:
score: 10
Accepted
time: 102ms
memory: 3824kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #5:
score: 10
Accepted
time: 104ms
memory: 3684kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #6:
score: 10
Accepted
time: 31ms
memory: 3968kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #7:
score: 10
Accepted
time: 29ms
memory: 3740kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Subtask #2:
score: 19.314
Acceptable Answer
Test #8:
score: 19.314
Acceptable Answer
time: 234ms
memory: 3796kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2146
result:
points 0.2146
Test #9:
score: 20.331
Acceptable Answer
time: 147ms
memory: 3820kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2259
result:
points 0.2259
Test #10:
score: 19.314
Acceptable Answer
time: 154ms
memory: 4000kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2146
result:
points 0.2146
Test #11:
score: 19.314
Acceptable Answer
time: 291ms
memory: 3832kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2146
result:
points 0.2146
Test #12:
score: 20.331
Acceptable Answer
time: 226ms
memory: 3744kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2259
result:
points 0.2259
Test #13:
score: 19.314
Acceptable Answer
time: 209ms
memory: 3772kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2146
result:
points 0.2146
Test #14:
score: 19.314
Acceptable Answer
time: 140ms
memory: 4000kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2146
result:
points 0.2146
Test #15:
score: 19.314
Acceptable Answer
time: 179ms
memory: 3768kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2146
result:
points 0.2146
Test #16:
score: 20.331
Acceptable Answer
time: 180ms
memory: 4088kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2259
result:
points 0.2259
Test #17:
score: 90
Accepted
time: 92ms
memory: 3764kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #18:
score: 90
Accepted
time: 102ms
memory: 3976kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #19:
score: 90
Accepted
time: 160ms
memory: 4012kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #20:
score: 90
Accepted
time: 150ms
memory: 3748kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #21:
score: 90
Accepted
time: 212ms
memory: 3736kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Test #22:
score: 73.305
Acceptable Answer
time: 182ms
memory: 4000kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.8145
result:
points 0.8145
Test #23:
score: 53.883
Acceptable Answer
time: 155ms
memory: 3804kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.5987
result:
points 0.5987
Test #24:
score: 39.609
Acceptable Answer
time: 220ms
memory: 3832kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.4401
result:
points 0.4401
Test #25:
score: 29.115
Acceptable Answer
time: 176ms
memory: 3988kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.3235
result:
points 0.3235
Test #26:
score: 20.331
Acceptable Answer
time: 253ms
memory: 3744kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2259
result:
points 0.2259
Test #27:
score: 19.314
Acceptable Answer
time: 230ms
memory: 3760kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0.2146
result:
points 0.2146