Submission #1304894

#	Time	Username	Problem	Language	Result	Execution time	Memory
1304894		trinm01	Financial Report (JOI21_financial)	C++20	100 / 100	676 ms	53472 KiB

Main

// #pragma GCC optimize("O3")
// #pragma GCC optimization("Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define ll long long
#define FOR(i, l, r) for (int i = (l); i <= (r); i++)
#define FOD(i, r, l) for (int i = (r); i >= (l); i--)
#define fi first
#define se second
#define pii pair<int, int>

const ll mod = 1e9 + 7;
const int MAXN = 1e6 + 5;
const ll oo = 1e18 + 7;  
const int base = 10;

int n, d, a[MAXN], b[MAXN];

int st[4*MAXN];
void update(int id, int l, int r, int i, int val){
	if(l>i || r<i){
		return;
	}
	if(l>=r){
		st[id]=val;
		return;
	}
	int mid=(l+r)/2;
	update(id*2, l, mid, i, val);
	update(id*2+1, mid+1, r, i, val);
	st[id]=max(st[id*2], st[id*2+1]);
}
int get(int id, int l, int r, int i, int j){
	if(l>j || r<i){
		return 0;
	}
	if(l>=i && r<=j){
		return st[id];
	}
	int mid=(l+r)/2;
	return max(get(id*2, l, mid, i, j), get(id*2+1, mid+1, r, i, j));
}

vector<int> nen;
vector<int> vec[MAXN];
int f[MAXN];

int par[MAXN];
int find(int u){
	if(par[u]==u){
		return u;
	}
	return par[u]=find(par[u]);
}
int mx[MAXN];
void join(int u, int v){
	u=find(u);
	v=find(v);
	if(u==v) return;
	mx[u]=max(mx[u], mx[v]);
	par[v]=u;
}

int dd[MAXN];
set<int> s;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    
    // freopen("test.txt", "r", stdin);
    // freopen("o2.out", "w", stdout);

    if(fopen(".inp", "r")){
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }

    cin >> n >> d;
    FOR(i, 1, n){
    	cin >> a[i];
    }
    
    FOR(i, 1, n){
    	nen.push_back(a[i]);
    }
    sort(nen.begin(), nen.end());
    nen.erase(unique(nen.begin(), nen.end()), nen.end());
    FOR(i, 1, n){
    	a[i]=lower_bound(nen.begin(), nen.end(), a[i])-nen.begin()+1;
    }
    
    FOR(i, 1, n){
    	par[i]=i;
    	mx[i]=i;
    }
    FOR(i, 1, n){
    	vec[a[i]].push_back(i);
    }
    
    FOR(u, 1, n){
    	for(auto id:vec[u]){
    		s.insert(id);
    	}
    	for(auto id:vec[u]){
    		int id2=mx[find(id)];
    		auto it=s.upper_bound(id2);
    		while(it!=s.end()){
    			if(id2+d<*it){
    				break;
    			}
    			join(id, id2+1);
    			id2=mx[find(id)];
    			it=s.upper_bound(id2);
    		}
    		dd[id]=mx[find(id)]+d;
    	}
    }
    
    int ans=0;
    FOD(u, n, 1){
    	for(auto id:vec[u]){
    		f[id]=get(1, 1, n, id, dd[id])+1;
    		ans=max(ans, f[id]);
    	}
    	for(auto id:vec[u]){
    		update(1, 1, n, id, f[id]);
    	}
    }
    
    cout << ans;
    
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:80:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |         freopen(".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

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