Submission #12621030


Source Code Expand

#include "bits/stdc++.h"
using namespace std;

const int N=2e5+20;

int n,a[N],u,v,ans[N];
vector <int> adj[N];
multiset <int> s;

void dfs(int node,int parent=0)
{
	s.insert(a[node]);
	int del=-1;
	auto it=s.lower_bound(a[node]);
	if(++it!=s.end()) del=*it,s.erase(it);
	ans[node]=s.size();
	
	for(auto child:adj[node])
		if(child!=parent) dfs(child,node);
	
	if(del!=-1) s.insert(del);
	s.erase(s.find(a[node]));
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=0;i<n-1;i++)
	{
		scanf("%d%d",&u,&v);
		adj[u].push_back(v);
		adj[v].push_back(u);
	}

	dfs(1);
	for(int i=1;i<=n;i++) printf("%d\n",ans[i]);
}

Submission Info

Submission Time
Task F - LIS on Tree
User dush1729
Language C++ (GCC 9.2.1)
Score 600
Code Size 683 Byte
Status AC
Exec Time 173 ms
Memory 33520 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   27 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
./Main.cpp:28:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   28 |  for(int i=1;i<=n;i++) scanf("%d",&a[i]);
      |                        ~~~~~^~~~~~~~~~~~
./Main.cpp:31:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   31 |   scanf("%d%d",&u,&v);
      |   ~~~~~^~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 1
AC × 17
Set Name Test Cases
Sample Sample_01.txt
All Sample_01.txt, caterpillar_01.txt, ni_01.txt, ni_02.txt, ni_03.txt, path_02.txt, path_04.txt, path_07.txt, path_08.txt, rand_01.txt, rand_02.txt, rand_03.txt, rand_04.txt, rand_05.txt, rand_large_01.txt, same_01.txt, star_01.txt
Case Name Status Exec Time Memory
Sample_01.txt AC 9 ms 8528 KiB
caterpillar_01.txt AC 139 ms 22960 KiB
ni_01.txt AC 13 ms 8324 KiB
ni_02.txt AC 5 ms 8528 KiB
ni_03.txt AC 10 ms 8332 KiB
path_02.txt AC 160 ms 29128 KiB
path_04.txt AC 144 ms 19152 KiB
path_07.txt AC 142 ms 22396 KiB
path_08.txt AC 157 ms 31756 KiB
rand_01.txt AC 8 ms 8380 KiB
rand_02.txt AC 7 ms 8420 KiB
rand_03.txt AC 6 ms 8516 KiB
rand_04.txt AC 7 ms 8512 KiB
rand_05.txt AC 7 ms 8456 KiB
rand_large_01.txt AC 163 ms 16180 KiB
same_01.txt AC 173 ms 33520 KiB
star_01.txt AC 112 ms 16392 KiB