QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#423883#67. Two Transportationsnot_clever_sylQJCompile Error//C++205.6kb2024-05-28 18:48:452024-05-28 18:48:46

Judging History

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

  • [2024-05-28 18:48:46]
  • 评测
查看
  • [2024-05-28 18:48:45]
  • 提交

Azer

#include"Azer.h"
#include<bits/stdc++.h> 
using namespace std;
namespace my{
	const int MAXN=2005;
	void send_to(int x,bool v){
		(x?SendA:SendB)(v);
	}
	struct machine{
		int n;
		int id;
		struct edge{
			int v,w;
		};
		vector<edge>e[MAXN];
		inline void send(bool v){
			send_to(!id,v);
		}
		inline void send_node(int u){
//			if(id)cerr<<"\t\t";
//			cerr<<id<<" send node "<<u<<'\n';
			for(int i=10;i>=0;--i)send((u>>i)&1);
		}
		inline void send_w(int w){
//			if(id)cerr<<"\t\t";
//			cerr<<id<<" send edge "<<w<<'\n';
			for(int i=8;i>=0;--i)send((w>>i)&1);
		}
		int nc,rv;
		inline void receive(bool v){
			rv=(rv<<1)|v;
			--nc;
			if(!nc){
//				if(id)cerr<<"\t\t";
//				cerr<<id<<" receive "<<rv<<'\n';
				chk();
			}
		}
		inline void build(int u,int v,int w){
			e[u].emplace_back(edge{v,w});
			e[v].emplace_back(edge{u,w});
		}
		int state;
		int dis[MAXN];
		bool vis[MAXN];
		int u;
		int last_w;
		priority_queue<pair<int,int> >pq;
		int myw,otherw;
		void _chk(){
			if(state==0){
				state=1;
				nc=0;
			}
			else if(state==1){
				while(!pq.empty()&&vis[u=pq.top().second])pq.pop();
				if(pq.empty()){
					myw=506;
				}
				else{
					myw=dis[u]-last_w;
				}
				send_w(myw);
				state=2;
				nc=9;
			}
			else if(state==2){
				otherw=rv;
				rv=0;
				if(min(myw,otherw)>505){
					state=-1;
					nc=0;
					return;
				}
				last_w+=min(myw,otherw);
				if(
				(otherw<myw)||(otherw==myw&&id==1) 
				){
					state=3;
					nc=11;
				}
				else{
					send_node(u);
					state=4;
					nc=0;
				}
			}
			else if(state==3){
				u=rv;
				rv=0;
				dis[u]=last_w;
				state=4;
				nc=0;
			}
			else if(state==4){
				vis[u]=true;
				upd(u);
				state=1;
				nc=0;
			}
		}
		void chk(){
			while(!nc&&state!=-1)_chk();
		}
		void upd(int u){
			for(auto it:e[u]){
				if(!vis[it.v]&&dis[u]+it.w<dis[it.v]) {
					dis[it.v]=dis[u]+it.w;
					pq.push(make_pair(-dis[it.v],it.v));
				}
			}
		}
		inline void init(){
			last_w=0;
			memset(dis,0x3f,sizeof(dis));
			dis[0]=0;
			u=0;
			upd(0);
			state=1;
			nc=0;
			chk();
		}
		vector<int>answer(){
			return vector<int>(dis,dis+n);
		}
	}a[2];
	inline void receive(int x,bool v){
		a[x].receive(v);
	}
	inline void init(int x,int n,int m,vector<int>u,vector<int>v,vector<int>w){
		a[x].n=n;
		a[x].id=x;
		for(int i=0;i<m;++i)a[x].build(u[i],v[i],w[i]);
		a[x].init();
	}
};
std::vector<int>Answer(){
	return my::a[0].answer();
}
void InitA(int N, int A, std::vector<int> U, std::vector<int> V, std::vector<int> C){
	my::init(0,N,A,U,V,C);
}
void ReceiveA(bool x){
	my::receive(0,x);
}
void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D){
	my::init(1,N,B,S,T,D);
}
void ReceiveB(bool x){
	my::receive(1,x);
}
Source code, Language: C++20

Baijan

#include"Baijan.h"
#include<bits/stdc++.h> 
using namespace std;
namespace my{
	const int MAXN=2005;
	void send_to(int x,bool v){
		(x?SendA:SendB)(v);
	}
	struct machine{
		int n;
		int id;
		struct edge{
			int v,w;
		};
		vector<edge>e[MAXN];
		inline void send(bool v){
			send_to(!id,v);
		}
		inline void send_node(int u){
//			if(id)cerr<<"\t\t";
//			cerr<<id<<" send node "<<u<<'\n';
			for(int i=10;i>=0;--i)send((u>>i)&1);
		}
		inline void send_w(int w){
//			if(id)cerr<<"\t\t";
//			cerr<<id<<" send edge "<<w<<'\n';
			for(int i=8;i>=0;--i)send((w>>i)&1);
		}
		int nc,rv;
		inline void receive(bool v){
			rv=(rv<<1)|v;
			--nc;
			if(!nc){
//				if(id)cerr<<"\t\t";
//				cerr<<id<<" receive "<<rv<<'\n';
				chk();
			}
		}
		inline void build(int u,int v,int w){
			e[u].emplace_back(edge{v,w});
			e[v].emplace_back(edge{u,w});
		}
		int state;
		int dis[MAXN];
		bool vis[MAXN];
		int u;
		int last_w;
		priority_queue<pair<int,int> >pq;
		int myw,otherw;
		void _chk(){
			if(state==0){
				state=1;
				nc=0;
			}
			else if(state==1){
				while(!pq.empty()&&vis[u=pq.top().second])pq.pop();
				if(pq.empty()){
					myw=506;
				}
				else{
					myw=dis[u]-last_w;
				}
				send_w(myw);
				state=2;
				nc=9;
			}
			else if(state==2){
				otherw=rv;
				rv=0;
				if(min(myw,otherw)>505){
					state=-1;
					nc=0;
					return;
				}
				last_w+=min(myw,otherw);
				if(
				(otherw<myw)||(otherw==myw&&id==1) 
				){
					state=3;
					nc=11;
				}
				else{
					send_node(u);
					state=4;
					nc=0;
				}
			}
			else if(state==3){
				u=rv;
				rv=0;
				dis[u]=last_w;
				state=4;
				nc=0;
			}
			else if(state==4){
				vis[u]=true;
				upd(u);
				state=1;
				nc=0;
			}
		}
		void chk(){
			while(!nc&&state!=-1)_chk();
		}
		void upd(int u){
			for(auto it:e[u]){
				if(!vis[it.v]&&dis[u]+it.w<dis[it.v]) {
					dis[it.v]=dis[u]+it.w;
					pq.push(make_pair(-dis[it.v],it.v));
				}
			}
		}
		inline void init(){
			last_w=0;
			memset(dis,0x3f,sizeof(dis));
			dis[0]=0;
			u=0;
			upd(0);
			state=1;
			nc=0;
			chk();
		}
		vector<int>answer(){
			return vector<int>(dis,dis+n);
		}
	}a[2];
	inline void receive(int x,bool v){
		a[x].receive(v);
	}
	inline void init(int x,int n,int m,vector<int>u,vector<int>v,vector<int>w){
		a[x].n=n;
		a[x].id=x;
		for(int i=0;i<m;++i)a[x].build(u[i],v[i],w[i]);
		a[x].init();
	}
};
std::vector<int>Answer(){
	return my::a[0].answer();
}
void InitA(int N, int A, std::vector<int> U, std::vector<int> V, std::vector<int> C){
	my::init(0,N,A,U,V,C);
}
void ReceiveA(bool x){
	my::receive(0,x);
}
void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D){
	my::init(1,N,B,S,T,D);
}
void ReceiveB(bool x){
	my::receive(1,x);
}
Source code, Language: C++20

Details 

Azer.code: In function ‘void my::send_to(int, bool)’:
Azer.code:7:12: error: ‘SendB’ was not declared in this scope; did you mean ‘SendA’?
    7 |   (x?SendA:SendB)(v);
      |            ^~~~~
      |            SendA
grader_Azer.cpp: In function ‘int main(int, char**)’:
grader_Azer.cpp:37:13: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
   37 |   char *t = "/dev/null";
      |             ^~~~~~~~~~~
English 繁體中文 简体中文

Server Time: 2025-01-20 16:29:45 | OpenSource Project