oj.uz

Submission #152559

# Submission time Handle Problem Language Result Execution time Memory
152559 2019-09-08T12:35:43 Z username Two Transportations (JOI19_transportations) C++14
0 / 100
 12 ms 2088 KB 
#include "Azer.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define REP(i,j,k) for(int i=(j);i<(k);++i)
#define RREP(i,j,k) for(int i=int(j)-1;i>=(k);--i)
#define ALL(a) a.begin(),a.end()
#define pb push_back
#define f first
#define s second
#define de(...) cerr<<__VA_ARGS__
#define ar(a,s,t) {REP(__i,s,t)de(a[__i]<<' ');de(endl);}

namespace{
	const int maxn=2009,inf=1e9;
	int n,ls=0,t=0,fin=0,r,tmp,d[maxn];
	bitset<maxn>c;
	vector<pii>g[maxn];
	priority_queue<pii,vector<pii>,greater<pii>>pq;
	
	void send(int x,int l){RREP(i,l,0)SendA((x>>i)&1);}
	void rlx(int u,int x){
		d[u]=x;
		c[u]=1;
		++fin;
		ls=d[u];
		REP(i,0,g[u].size()){
			pii&ee=g[u][i];
			if(d[u]+ee.s>d[ee.f]){
				d[ee.f]=d[u]+ee.s;
				pq.push({d[ee.f],ee.f});
			}
		}
	}
	void proc(){
		if(t==0||t==21){
			while(pq.size()&&c[pq.top().s])pq.pop();
			send(pq.size()?pq.top().f-ls:511,9);
			t=1;
		}else if(t==9){
			r+=ls;
			if(pq.empty()||r<pq.top().f)tmp=r;
			else{
				pii tt=pq.top();pq.pop();
				send(tt.s,11);
				t+=11;
				rlx(tt.s,tt.f);
			}
		}else rlx(r,tmp);
	}
}

void InitA(int _n,int a,vector<int>u,vector<int>v,vector<int>c) {
	n=_n;
	REP(i,0,a)g[u[i]].pb({v[i],c[i]}),g[v[i]].pb({u[i],c[i]});
	fill(d+1,d+n,inf);
	pq.push({d[0],0});
}

void ReceiveA(bool x){
	if(t==1||t==10)r=0;
	(r<<=1)|=x;
	if(t==9||t==20)proc();
	++t;
	if(t==21&&fin<n)proc();
}

vector<int>Answer(){
	vector<int>ret;
	REP(i,0,n)ret.pb(d[i]);
	return ret;
}
#include "Baijan.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define REP(i,j,k) for(int i=(j);i<(k);++i)
#define RREP(i,j,k) for(int i=int(j)-1;i>=(k);--i)
#define ALL(a) a.begin(),a.end()
#define pb push_back
#define f first
#define s second
#define de(...) cerr<<__VA_ARGS__
#define ar(a,s,t) {REP(__i,s,t)de(a[__i]<<' ');de(endl);}

namespace{
	const int maxn=2009,inf=1e9;
	int n,ls=0,t=0,fin=0,r,tmp,d[maxn];
	bitset<maxn>c;
	vector<pii>g[maxn];
	priority_queue<pii,vector<pii>,greater<pii>>pq;
	
	void send(int x,int l){RREP(i,l,0)SendB((x>>i)&1);}
	void rlx(int u,int x){
		d[u]=x;
		c[u]=1;
		++fin;
		ls=d[u];
		REP(i,0,g[u].size()){
			pii&ee=g[u][i];
			if(d[u]+ee.s>d[ee.f]){
				d[ee.f]=d[u]+ee.s;
				pq.push({d[ee.f],ee.f});
			}
		}
	}
	void proc(){
		if(t==0||t==21){
			while(pq.size()&&c[pq.top().s])pq.pop();
			send(pq.size()?pq.top().f-ls:511,9);
			t=1;
		}else if(t==9){
			r+=ls;
			if(pq.empty()||r<pq.top().f)tmp=r;
			else{
				pii tt=pq.top();pq.pop();
				send(tt.s,11);
				t+=11;
				rlx(tt.s,tt.f);
			}
		}else rlx(r,tmp);
	}
}

void InitB(int _n,int a,vector<int>u,vector<int>v,vector<int>c) {
	n=_n;
	REP(i,0,a)g[u[i]].pb({v[i],c[i]}),g[v[i]].pb({u[i],c[i]});
	fill(d+1,d+n,inf);
	pq.push({d[0],0});
}

void ReceiveB(bool x){
	if(t==1||t==10)r=0;
	(r<<=1)|=x;
	if(t==9||t==20)proc();
	++t;
	if(t==21&&fin<n)proc();
}

Compilation message

Azer.cpp: In function 'void {anonymous}::rlx(int, int)':
Azer.cpp:5:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(int i=(j);i<(k);++i)
                                   ^
Azer.cpp:27:3: note: in expansion of macro 'REP'
   REP(i,0,g[u].size()){
   ^~~

Baijan.cpp: In function 'void {anonymous}::rlx(int, int)':
Baijan.cpp:5:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(int i=(j);i<(k);++i)
                                   ^
Baijan.cpp:27:3: note: in expansion of macro 'REP'
   REP(i,0,g[u].size()){
   ^~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1760 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1216 KB Output is correct
2 Incorrect 10 ms 2088 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 1832 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1496 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1496 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1496 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1760 KB Output isn't correct
2 Halted 0 ms 0 KB -