QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#575132 | #9237. Message | maxrgby | 10 | 182ms | 4048kb | C++20 | 2.9kb | 2024-09-19 10:48:52 | 2024-09-19 10:48:53 |
Judging History
answer
// Source: https://kill.yourself/time/right-now
#include <bits/stdc++.h>
#include "message.h"
using namespace std;
// vector<vector<bool>> hehe;
void send_message(vector<bool> m, vector<bool> c){
vector<bool> zero (31,0);
vector<bool> one (31,1);
for(auto i : m){
if(i){
send_packet(one);
}else{
send_packet(zero);
}
}
}
vector<bool> receive_message(vector<vector<bool>> r){
vector<bool> ans;
for(auto i : r){
int zero = 0;
int one = 0;
for(auto j : i){
if(j){
one++;
}else{
zero++;
}
}
if(zero > one){
ans.push_back(0);
}else{
ans.push_back(1);
}
}
return ans;
}
// vector<bool> send_packet(vector<bool> e){
// for(int i = 2;i < 17;i += 1){
// e[i] = !e[i];
// }
// hehe.push_back(e);
// return e;
// }
// void send_message(vector<bool> m, vector<bool> c){
// int nxt[31];
// int diff = 0;
// for(int i = 0;i < 31;i++){
// nxt[i] = 66;
// if(c[i]){
// continue;
// }
// for(int j = 1;j < 31;j++){
// if(!c[(i+j)%31]){
// nxt[i] = j;
// diff += j;
// break;
// }
// }
// }
// bool tmp = !m.back();
// while(m.size() < 1025){
// m.push_back(tmp);
// }
// vector<bool> ret[66];
// for(int i = 0;i < 66;i++){
// ret[i].resize(31);
// }
// int pos = 0;
// for(int i = 0;i < 31;i++){
// for(int j = 0;j < nxt[i]-1;j++){
// ret[j][i] = 0;
// }
// ret[nxt[i]-1][i] = 1;
// for(int j = nxt[i];j < 66;j++){
// ret[j][i] = m[pos++];
// }
// }
// for(int i = 0;i < 66;i++){
// vector<bool> tmp = send_packet(ret[i]);
// for(int j = 0;j < 31;j++){
// if(tmp[j] != ret[i][j] && !c[i]){
// //assert(false);
// }
// }
// }
// }
// vector<bool> receive_message(vector<vector<bool>> r){
// int nxt[31];
// for(int i = 0;i < 31;i++){
// nxt[i] = 66;
// for(int j = 0;j < 66;j++){
// if(r[j][i]){
// nxt[i] = (i+j+1)%31;
// break;
// }
// }
// }
// int good = -1;
// for(int i = 0;i < 31;i++){
// int u = i;
// for(int j = 0;j < 16;j++){
// u = nxt[u];
// }
// if(u == i){
// good = i;
// break;
// }
// }
// vector<bool> ret;
// for(int i = 0;i < 16;i++){
// int j = 0;
// while(j < 66 and !r[j][good]){
// j++;
// }
// j++;
// while(j < 66){
// ret.push_back(r[j][good]);
// j++;
// }
// good = nxt[good];
// }
// char c = ret.back();
// while(!ret.empty() and ret.back() == c){
// ret.pop_back();
// }
// return ret;
// }
// int main() {
// int n;
// cin >> n;
// vector<bool> a;
// vector<bool> c(31,0);
// for(int i = 0;i < n;i++){
// char c;
// cin >> c;
// a.push_back(c-'0');
// }
// for(int i = 2;i < 17;i += 1){
// c[i] = 1;
// }
// send_message(a,c);
// vector<bool> ans = receive_message(hehe);
// assert(ans == a);
// for(auto i : ans){
// cout << i << " ";
// }
// }
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 10
Accepted
Test #1:
score: 10
Accepted
time: 150ms
memory: 3868kb
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: 83ms
memory: 4048kb
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: 182ms
memory: 3772kb
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: 80ms
memory: 3768kb
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: 97ms
memory: 4048kb
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: 93ms
memory: 3812kb
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: 24ms
memory: 3828kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
1
result:
points 1.0
Subtask #2:
score: 0
Wrong Answer
Test #8:
score: 0
Wrong Answer
time: 1ms
memory: 3788kb
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0 ing with message 'Used too many days' Sending secret with code DIE to mgr2sol[0] Sending secret with code DIE to mgr2sol[1] Quitting with result code 1
result:
wrong output format Extra information in the output file