Submission #75953877

Source Code Expand

#include<bits/stdc++.h>
#define lowbit(x) (-x)&(x)
using namespace std;
typedef long long ll;
const int N=2e5+7;
const ll inf=1e18;
int n,m,h[N],head[N],cnt=1,ans=1,k=1;
bool p[N];
struct node{
	int v,nxt;
}e[N];
void add(int x,int y){
	e[cnt].v=y;e[cnt].nxt=head[x];head[x]=cnt++;
}
void bfs(int x){
	p[x]=1;
	for(int i=head[x];i;i=e[i].nxt){
		int v=e[i].v;
		if(h[x]<h[v]){
			if(!p[v]){
				k++;p[v]=1;ans=max(k,ans);
				bfs(v);
				k--;p[v]=0;
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>h[i];
	for(int i=0;i<m;i++){
		int x,y;
		cin>>x>>y;
		add(x,y);
	}
	bfs(1);
	cout<<ans;
	
	return 0;
}

Submission Info

Submission Time
Task D - Mountain Traverse
User sanxi
Language C++23 (GCC 15.2.0)
Score 0
Code Size 696 Byte
Status TLE
Exec Time > 2000 ms
Memory 16372 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 5
AC × 67
TLE × 12
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3532 KiB
in02.txt AC 1 ms 3532 KiB
in03.txt AC 1 ms 3560 KiB
in04.txt AC 1 ms 3592 KiB
in05.txt AC 1 ms 3464 KiB
in06.txt AC 1 ms 3564 KiB
in07.txt AC 1 ms 3508 KiB
in08.txt AC 23 ms 6668 KiB
in09.txt AC 12 ms 5088 KiB
in10.txt AC 24 ms 16268 KiB
in11.txt TLE > 2000 ms 7140 KiB
in12.txt AC 8 ms 4332 KiB
in13.txt AC 19 ms 5992 KiB
in14.txt AC 23 ms 6732 KiB
in15.txt AC 22 ms 6684 KiB
in16.txt TLE > 2000 ms 4868 KiB
in17.txt AC 19 ms 5992 KiB
in18.txt AC 25 ms 16268 KiB
in19.txt AC 19 ms 6504 KiB
in20.txt AC 22 ms 6888 KiB
in21.txt AC 1 ms 3464 KiB
in22.txt AC 1 ms 3464 KiB
in23.txt AC 1 ms 3468 KiB
in24.txt AC 1 ms 3568 KiB
in25.txt AC 1 ms 3660 KiB
in26.txt AC 25 ms 16360 KiB
in27.txt AC 1 ms 3624 KiB
in28.txt AC 1 ms 3508 KiB
in29.txt AC 1 ms 3436 KiB
in30.txt AC 1 ms 3564 KiB
in31.txt AC 1 ms 3456 KiB
in32.txt AC 1 ms 3720 KiB
in33.txt AC 1 ms 3576 KiB
in34.txt AC 1 ms 3592 KiB
in35.txt TLE > 2000 ms 7004 KiB
in36.txt TLE > 2000 ms 6660 KiB
in37.txt AC 1 ms 3468 KiB
in38.txt AC 1 ms 3464 KiB
in39.txt AC 1 ms 3468 KiB
in40.txt AC 1 ms 3468 KiB
in41.txt TLE > 2000 ms 3288 KiB
in42.txt TLE > 2000 ms 3312 KiB
in43.txt TLE > 2000 ms 3292 KiB
in44.txt TLE > 2000 ms 3432 KiB
in45.txt AC 22 ms 6660 KiB
in46.txt AC 23 ms 6824 KiB
in47.txt AC 39 ms 16372 KiB
in48.txt AC 19 ms 6284 KiB
in49.txt AC 21 ms 6664 KiB
in50.txt AC 33 ms 16320 KiB
in51.txt TLE > 2000 ms 5992 KiB
in52.txt AC 19 ms 6220 KiB
in53.txt TLE > 2000 ms 6928 KiB
in54.txt TLE > 2000 ms 6888 KiB
in55.txt AC 544 ms 3552 KiB
in56.txt TLE > 2000 ms 3596 KiB
in57.txt AC 1 ms 3468 KiB
in58.txt AC 1 ms 3592 KiB
in59.txt AC 1 ms 3436 KiB
in60.txt AC 1 ms 3500 KiB
in61.txt AC 1 ms 3464 KiB
in62.txt AC 1 ms 3720 KiB
in63.txt AC 1 ms 3432 KiB
in64.txt AC 1 ms 3532 KiB
in65.txt AC 1 ms 3468 KiB
in66.txt AC 1 ms 3564 KiB
in67.txt AC 1 ms 3696 KiB
in68.txt AC 1 ms 3496 KiB
in69.txt AC 1 ms 3496 KiB
in70.txt AC 1 ms 3556 KiB
in71.txt AC 1 ms 3672 KiB
in72.txt AC 1 ms 3496 KiB
in73.txt AC 1 ms 3456 KiB
in74.txt AC 1 ms 3468 KiB
sample01.txt AC 1 ms 3464 KiB
sample02.txt AC 1 ms 3624 KiB
sample03.txt AC 1 ms 3468 KiB
sample04.txt AC 1 ms 3624 KiB
sample05.txt AC 1 ms 3468 KiB