QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#885063 | #9237. Message | yjx120921 | 0 | 0ms | 0kb | C++17 | 1.4kb | 2025-02-06 13:21:09 | 2025-02-06 13:21:17 |
Judging History
answer
#include <bits/stdc++.h>
#include "message.h"
using namespace std;
void send_message(vector<bool> M, vector<bool> C){
M.push_back(0);
while(M.size()<1025)M.push_back(1);
int idx=0;
vector<int> d,pos;
for(int i=0;i<31;i++)if(!C[i])pos.push_back(i);
for(int i=0;i<31;i++)d.push_back(0);
for(int i=0;i<16;i++)d[pos[i]]=(pos[(i+1)%16]-pos[i]+31)%31;
for(int i=1;i<=66;i++){
vector<bool> res;
for(int j=0;j<31;j++){
if(C[j])res.push_back(0);
else{
if(i<d[j])res.push_back(0);
else if(i==d[j])res.push_back(1);
else res.push_back(M[idx++]);
}
}
send_packet(res);
}
}
vector<bool> receive_message(vector<vector<bool> > R){
vector<int> d;
vector<bool> st,ok,res;
for(int i=0;i<31;i++)d.push_back(0),st.push_back(0),ok.push_back(0);
for(int i=0;i<66;i++)
for(int j=0;j<31;j++)if(!d[j]&&R[i][j])d[j]=i+1;
for(int i=0;i<31;i++){
int cur=i,sum=0;
while(!st[cur]){
sum++;
st[cur]=sum;
(cur+=d[cur])%=31;
}
if(sum-st[cur]+1==16){
int curcur=(cur+d[cur])%31;
ok[cur]=1;
while(curcur!=cur){
ok[curcur]=1;
(curcur+=d[curcur])%=31;
}
break;
}
for(int j=0;j<31;j++)st[j]=0;
}
for(int i=0;i<66;i++)
for(int j=0;j<16;j++)if(!ok[j]){
if(st[j])res.push_back(R[i][j]);
else if(R[i][j])st[j]=1;
}
while(res.back())res.pop_back();
res.pop_back();
return res;
}
詳細信息
Subtask #1:
score: 0
Instance #1 Runtime Error
Test #1:
score: 0
Instance #1 Runtime Error
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0 ing with message 'manual RTE, cant read int from grader' Quitting with result code 1
result:
Subtask #2:
score: 0
Instance #1 Runtime Error
Test #8:
score: 0
Instance #1 Runtime Error
Manager to Aisha
Aisha to Manager
Manager to Basma
Basma to Manager
Manager to Checker
0 ing with message 'manual RTE, cant read int from grader' Quitting with result code 1