QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#580260#9237. Messageljga_Compile Error//C++201.2kb2024-09-21 20:46:332024-09-21 20:46:33

Judging History

你现在查看的是最新测评结果

  • [2024-09-21 20:46:33]
  • 评测
  • [2024-09-21 20:46:33]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void send_packet(vector<bool> A);
void send_message(vector<bool> M,vector<bool> C){
	M.push_back(0);
	while(M.size()<1025)
		M.push_back(1);
	
	vector<int> x(31);
	vector<int> p;
	for(int i=0;i<=31;i++)
		if(C[i])
			p.push_back(i);
	for(int i=0;i<15;i++)
		x[i]=p[i+1]-p[i];
	x[p[15]]=31+p[0]-p[15];
	
	int pos=0;
	for(int t=0;t<66;t++){
		vector<bool> m(31);
		for(int i=0;i<31;i++){
			if(x[i]){
				if(x[i]==1)
					m[i]=1;
				else
					m[i]=0;
				x[i]--;
			}
			else{
				m[i]=M[pos++];
			}
		}
		send_packet(m);
	}
}
vector<bool> receive_message(vector<vector<bool> > R){
	vector<bool> f(31);
	vector<int> x(31);
	for(int t=0;t<66;t++){
		for(int i=0;i<31;i++)
			if(!f[i]){
				x[i]++;
				if(R[t][i])
					f[i]=1;
			}
	}
	vector<int> c(31);
	for(int i=0;i<31;i++){
		vector<bool> vis(31);
		int cnt=0;
		for(int u=i;!vis[u];u=(u+x[u])%31){
			vis[u]=1;
			cnt++;
		}
		if(cnt==16){
			for(int u=i;cnt--;u=(u+x[u])%31)
				c[u]=1;
			break;
		}
	}
	vector<bool> m;
	for(int t=0;t<66;t++){
		for(int i=0;i<31;i++){
			if(t[i])
				t[i]--;
			else
				m.push_back(R[t][i]);
		}
	}
	return m;
}

Details

answer.code: In function ‘std::vector<bool> receive_message(std::vector<std::vector<bool> >)’:
answer.code:66:29: error: invalid types ‘int[int]’ for array subscript
   66 |                         if(t[i])
      |                             ^
answer.code:67:34: error: invalid types ‘int[int]’ for array subscript
   67 |                                 t[i]--;
      |                                  ^