Submission #115005

# Submission time Handle Problem Language Result Execution time Memory
115005 2019-06-04T11:05:23 Z tinjyu Highway Tolls (IOI18_highway) C++14
5 / 100
188 ms 9564 KB
#include "highway.h"
#include <iostream>
using namespace std;
 
long long int ta[130005],m,p[1300005],amoney,bmoney,t,cnt,n,tag[1300005],road[1300005],map[2600005][2],sumlength,length,point,startans=-1,endans=-1,tree[1300005],trueroad,start=-1,a[1000005],father[1000005][2];
int check()
{
	vector<int> w(m);
	for(int i=0;i<m;i++)w[i]=p[i];
	for(int i=0;i<m;i++)p[i]=0;
	return ask(w);
}
int find(int s,int e)
{
	if(s==e)
	{
		start=s;
		return 0;
	}
	int mid=(s+e)/2;
	for(int i=s;i<=mid;i++)p[i]=1;
	t=check();
	if(t>cnt)find(s,mid);
	else find(mid+1,e);
}
int buildtree(int xx)
{
	int pt=1,ppt=1;
	ta[pt]=xx;
	while(pt<=ppt)
	{
		int x=ta[pt];
	int p=road[x];
	int c=0;
	while(p!=-1)
	{
		if(tag[map[p][0]]==0)
		{
			c=1;
			ppt++;
			tag[map[p][0]]=1;
			father[map[p][0]][0]=x;
			father[map[p][0]][1]=p/2;
			//buildtree(map[p][0]);
			ta[ppt]=map[p][0];
		}
		p=map[p][1];
	}
	if(c==0)
	{
		a[0]++;
		a[a[0]]=x;
	}
	pt++;
	}
	return 0;
}
int findroad(int xx)
{
	int tp=xx;
	while(tp!=point && p[father[tp][1]]==0)
	{
	    p[father[tp][1]]=1;
	    tp=father[tp][0];
	}
	return 0;
}
int findtwo(int s,int e)
{
	//cout<<"二分"<<s<<" "<<e<<endl;
	//for(int i=s;i<=e;i++)cout<<a[i]<<" ";
	//cout<<endl;
	if(s==e)
	{
		trueroad=a[s];
		findroad(a[s]);
		t=check();
		//cout<<"總花費"<<t<<" "<<cnt<<endl;
		length=(t-cnt)/(bmoney-amoney);
		return 0;
	}
	for(int i=s;i<=(s+e)/2;i++)
	{
		findroad(a[i]);
	}
	int l=check();
	if(l==cnt)findtwo((s+e)/2+1,e);
	for(int i=(s+e)/2+1;i<=e;i++)findroad(a[i]);
	int r=check();
	if(l>r)findtwo(s,(s+e)/2);
	else findtwo((s+e)/2+1,e);
	return 0;
}
int findlength(int x)
{
    int tp=x;
    while(tp!=point)
    {
        sumlength++;
        tp=father[tp][0];
    }
    return 0;
}
int findans(int x)
{
    int tp=x;
    while(length!=sumlength)
    {
        sumlength--;
        tp=father[tp][0];
    }
    if(startans==-1)startans=tp;
    else endans=tp;
    return 0;
}
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
	m = U.size();
	amoney=A;
	bmoney=B;
	n=N;
	for(int i=0;i<n;i++)road[i]=-1;
	for(int i=0;i<m;i++)
	{
		map[i*2][0]=V[i];
		map[i*2][1]=road[U[i]];
		road[U[i]]=i*2;
		map[i*2+1][0]=U[i];
		map[i*2+1][1]=road[V[i]];
		road[V[i]]=i*2+1;
	}
	
	for(int i=0;i<m;i++)p[i]=0;
	cnt=check();
	
	find(0,m-1);
	tag[V[start]]=1;
	tag[U[start]]=1;
	point=U[start];
 
	buildtree(point);
 
	//cout<<endl;
	//cout<<point<<endl;
	//for(int i=1;i<=a[0];i++)cout<<a[i]<<" ";
	//cout<<endl;
	findtwo(1,a[0]);
	findlength(trueroad);
	//cout<<sumlength<<" "<<length<<" "<<trueroad<<endl;
 
	findans(trueroad);
	
	
	
	point=V[start];
	a[0]=0;
	tag[point]=1;
	sumlength=0;
	buildtree(point);
	//cout<<endl;
	//cout<<point<<endl;
	//for(int i=1;i<=a[0];i++)cout<<a[i]<<" ";
	//cout<<endl;
	findtwo(1,a[0]);
	findlength(trueroad);
	//cout<<sumlength<<" "<<length<<" "<<trueroad<<endl;
 
	findans(trueroad);
	//cout<<startans<<" "<<endans<<endl;
	answer(startans,endans);
}

Compilation message

highway.cpp: In function 'int find(int, int)':
highway.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 368 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 444 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 360 KB Output is correct
9 Correct 2 ms 448 KB Output is correct
10 Correct 2 ms 448 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 30 ms 1392 KB Output is correct
3 Correct 154 ms 9564 KB Output is correct
4 Incorrect 188 ms 9540 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 10 ms 1292 KB Output is correct
2 Correct 36 ms 2308 KB Output is correct
3 Correct 59 ms 3192 KB Output is correct
4 Correct 113 ms 8912 KB Output is correct
5 Correct 155 ms 8920 KB Output is correct
6 Correct 155 ms 9012 KB Output is correct
7 Correct 149 ms 9120 KB Output is correct
8 Correct 149 ms 8912 KB Output is correct
9 Incorrect 150 ms 8912 KB Output is incorrect: {s, t} is wrong.
# Verdict Execution time Memory Grader output
1 Correct 3 ms 420 KB Output is correct
2 Incorrect 19 ms 1296 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 1456 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 1460 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -