Submission #1226584

#	Time	Username	Problem	Language	Result	Execution time	Memory
1226584		kokoxuya	Magic Tree (CEOI19_magictree)	C++20	0 / 100	57 ms	2236 KiB

magictree

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x  << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x  << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x  << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
	cerr << #x << " : ";\
	for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
	cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
	cerr << "outputting" << #j<< ":\n";\
	for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
	cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}


signed main()
{
    int t1,t2,t3,t4;
    mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
    //ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

	int n,m,k;cin>>n>>m>>k;
	
	vector<int>myliz;
	for(int a=1;a<n;a++){cin>>t1;}
	vector<bool>iexist(n+1,false);
	vector<int>nummys(n+1);
	
	vector<int>thelist;
	for(int a=1;a<=m;a++)
	{
		cin>>t1>>t2>>t3;
		iexist[t1]=true;
		nummys[t1]=t2;
	}
	
	//increasing sequence
	for(int a=n;a>=2;a--)
	{
		int curr=nummys[a];
		if(myliz.empty()||myliz[myliz.size()-1]<=curr)
		{
			myliz.pb(curr);
		}
		else
		{
			myliz[upper_bound(myliz.begin(),myliz.end(),curr)-myliz.begin()]=curr;
		}
	}
	
	cout<<myliz.size();
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17