Submission #535635

#	Time	Username	Problem	Language	Result	Execution time	Memory
535635		crystaalroo	Financial Report (JOI21_financial)	C++17	28 / 100	4067 ms	1048576 KiB

Main

#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
using namespace std;

long long gcd(long long a, long long b){ return b? gcd(b, a%b) : a; }
long long lcm(long long a, long long b){ return (!a or !b)? 0 : a * b / gcd(a,b); } 
long long  poww(long long  a, long long b){
	long long res = 1;
	while(b){ 
		if(b%2) res = res * a ; 
		a = a * a;  b>>=1;
	} return res;
}

// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// int rnd(int n){return uniform_int_distribution<int>(0, n-1)(rng);}

template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
template<class t,class u>bool mmax(t&a,u b){if(a<b)a=b;return a<b;}
template<class t,class u>bool mmin(t&a,u b){if(b<a)a=b;return b<a;}
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
using li = long long;
using vi = vc<int>;
using ii = pair<int,int>;
//  ('-')7

vi dx = {-1,0,1,0}, dy = {0,1,0,-1};

int main(){_

	auto solve=[&](){
		int n,m; cin>>n>>m;
		map<int,int>x;
		vi v(n);
		fore(i,0,n){
			cin>>v[i];
			x[v[i]];
		}
		int cur = 0;
		for(auto &[a,b]:x)b = cur++;
		vv(int,dp,n,cur,-inf<int>);
		fore(i,0,n){
			int a = x[v[i]];
			dp[i][a]=max(dp[i][a],1);
			fore(j,1,m+1){
				if(i-j<0)break;
				fore(k,0,cur){
					if(dp[i-j][k]==-inf<int>)continue;
					if(a>k)dp[i][a]=max(dp[i][a],dp[i-j][k]+1);
					else dp[i][k]=max(dp[i][k],dp[i-j][k]);
				}
			}
		}
		//fore(i,0,n){fore(j,0,cur)cout<<dp[i][j]<<" ";cout<<ENDL;}
		int mx = 1;
		fore(i,0,cur)mx = max(dp[n-1][i],mx);
		cout<<mx<<ENDL;
	};
	//int t; cin>>t; while(t--)
	solve();
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35