oj.uz

Submission #987445

# Submission time Handle Problem Language Result Execution time Memory
987445 2024-05-22T19:00:37 Z Pyqe Longest Trip (IOI23_longesttrip) C++17
15 / 100
 789 ms 4688 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"

using namespace std;

long long n,nn[2],dh[100069],pr[100069],ex[2][100069],tmp[100069],sq[100069],zs;
bitset<1069> am[1069];
bitset<100069> vtd;

inline bool qr(vector<long long> v,vector<long long> v2)
{
	long long i,j,sz,sz2;
	
	sz=v.size();
	sz2=v2.size();
	for(i=0;i<sz;i++)
	{
		for(j=0;j<sz2;j++)
		{
			if(am[v[i]][v2[j]])
			{
				return 1;
			}
		}
	}
	return 0;
}

void dfs(long long x)
{
	long long i;
	
	vtd[x]=1;
	for(i=1;i<=n;i++)
	{
		if(!vtd[i]&&!qr({x},{i}))
		{
			dh[i]=dh[x]+1;
			pr[i]=x;
			dfs(i);
		}
	}
}

bool cmdh(long long x,long long y)
{
	return dh[x]<dh[y];
}

vector<int> longest_trip(int on,int d)
{
	long long i,j,ii,jj,k,l,sz,e,lh,rh,md,zz;
	vector<long long> cv,cv2;
	vector<int> ret;
	
	n=on;
	for(i=1;i<=n;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			k=are_connected({(int)i-1},{(int)j-1});
			am[i][j]=k;
			am[j][i]=k;
		}
	}
	vtd.reset();
	for(ii=0;ii<2;ii++)
	{
		nn[ii]=0;
	}
	for(i=1;i<=n;i++)
	{
		if(!vtd[i])
		{
			dh[i]=0;
			dfs(i);
		}
		e=dh[i]%2;
		nn[e]++;
		ex[e][nn[e]]=i;
	}
	for(ii=0;ii<2;ii++)
	{
		sort(ex[ii]+1,ex[ii]+nn[ii]+1,cmdh);
		sz=0;
		l=-1;
		vtd.reset();
		for(i=nn[ii];i;i--)
		{
			k=ex[ii][i];
			if(l==-1)
			{
				l=k;
			}
			else if(dh[k]!=dh[l])
			{
				l=pr[pr[l]];
				sz++;
				tmp[sz]=l;
				vtd[l]=1;
			}
			if(!vtd[k])
			{
				sz++;
				tmp[sz]=k;
				l=k;
			}
		}
		for(i=1;i<=sz;i++)
		{
			ex[ii][i]=tmp[i];
		}
	}
	zs=0;
	for(i=1;i<=nn[0];i++)
	{
		cv.push_back(ex[0][i]);
	}
	for(i=1;i<=nn[1];i++)
	{
		cv2.push_back(ex[1][i]);
	}
	if(!nn[1]||!qr(cv,cv2))
	{
		e=nn[1]>nn[0];
		for(i=1;i<=nn[e];i++)
		{
			zs++;
			sq[zs]=ex[e][i];
		}
	}
	else
	{
		for(ii=0;ii<2;ii++)
		{
			k=ex[0][1];
			for(jj=0;jj<2;jj++)
			{
				l=ex[1][1];
				if(!zs&&qr({k},{l}))
				{
					for(i=nn[0];i;i--)
					{
						zs++;
						sq[zs]=ex[0][i];
					}
					for(i=1;i<=nn[1];i++)
					{
						zs++;
						sq[zs]=ex[1][i];
					}
				}
				reverse(ex[1]+1,ex[1]+nn[1]+1);
			}
			reverse(ex[0]+1,ex[0]+nn[0]+1);
		}
		if(!zs)
		{
			for(ii=0;ii<2;ii++)
			{
				cv2.clear();
				for(i=1;i<=nn[!ii];i++)
				{
					cv2.push_back(ex[!ii][i]);
				}
				for(lh=1,rh=nn[ii];lh<=rh;)
				{
					md=(lh+rh)/2;
					cv.clear();
					for(i=1;i<=md;i++)
					{
						cv.push_back(ex[ii][i]);
					}
					if(qr(cv,cv2))
					{
						zz=md;
						rh=md-1;
					}
					else
					{
						lh=md+1;
					}
				}
				k=zz;
				swap(k,l);
			}
			for(i=k+1;i<=nn[0];i++)
			{
				zs++;
				sq[zs]=ex[0][i];
			}
			for(i=1;i<=k;i++)
			{
				zs++;
				sq[zs]=ex[0][i];
			}
			for(i=l;i<=nn[1];i++)
			{
				zs++;
				sq[zs]=ex[1][i];
			}
			for(i=1;i<l;i++)
			{
				zs++;
				sq[zs]=ex[1][i];
			}
		}
	}
	for(i=1;i<=zs;i++)
	{
		ret.push_back(sq[i]-1);
	}
	return ret;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:205:11: warning: 'zz' may be used uninitialized in this function [-Wmaybe-uninitialized]
  205 |     sq[zs]=ex[1][i];
      |     ~~~~~~^~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 198 ms 476 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Correct 115 ms 600 KB Output is correct
4 Correct 365 ms 2500 KB Output is correct
5 Correct 734 ms 452 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Correct 122 ms 2648 KB Output is correct
4 Correct 390 ms 600 KB Output is correct
5 Correct 745 ms 2504 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 25 ms 344 KB Output is correct
8 Correct 113 ms 600 KB Output is correct
9 Correct 276 ms 592 KB Output is correct
10 Correct 762 ms 460 KB Output is correct
11 Correct 789 ms 2500 KB Output is correct
12 Correct 718 ms 600 KB Output is correct
13 Correct 733 ms 4688 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 340 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Correct 104 ms 600 KB Output is correct
4 Correct 359 ms 2488 KB Output is correct
5 Correct 776 ms 852 KB Output is correct
6 Correct 7 ms 600 KB Output is correct
7 Correct 21 ms 344 KB Output is correct
8 Correct 109 ms 600 KB Output is correct
9 Correct 292 ms 592 KB Output is correct
10 Correct 755 ms 600 KB Output is correct
11 Correct 692 ms 456 KB Output is correct
12 Correct 728 ms 856 KB Output is correct
13 Correct 742 ms 856 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 12 ms 344 KB Output is correct
16 Incorrect 3 ms 4440 KB Incorrect
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 29 ms 344 KB Output is correct
3 Partially correct 126 ms 600 KB Output is partially correct
4 Partially correct 358 ms 444 KB Output is partially correct
5 Partially correct 735 ms 452 KB Output is partially correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Partially correct 114 ms 856 KB Output is partially correct
9 Partially correct 259 ms 448 KB Output is partially correct
10 Partially correct 715 ms 456 KB Output is partially correct
11 Partially correct 784 ms 592 KB Output is partially correct
12 Partially correct 766 ms 596 KB Output is partially correct
13 Partially correct 759 ms 456 KB Output is partially correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Incorrect 2 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -