| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1294657 | herominhsteve | Money (IZhO17_money) | C++20 | 333 ms | 12188 KiB |
#include <bits/stdc++.h>
#define el '\n'
#define FNAME "money"
#define allof(x) x.begin(),x.end()
#define allof1(x) x.begin()+1,x.end()
#define mset(x,n) memset(x,(n),sizeof(x))
using namespace std;
const long long MOD = (long long) 1e9 + 7;
template<class X,class Y> bool minimize(X &a,Y b){ if (a>b) {a=b; return true;} return false;}
template<class X,class Y> bool maximize(X &a,Y b){ if (a<b) {a=b; return true;} return false;}
void setup(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
if (fopen(FNAME".inp","r")){
freopen(FNAME".inp","r",stdin);
freopen(FNAME".out","w",stdout);
}
}
template<typename T>
struct HaviTree{
int n;
vector<T> havi;
HaviTree(int N=0){
n=N;
if (n>0){
havi.resize(n+1,0);
}
}
void update(int node,T val){
while (node<=n){
havi[node]+=val;
node += (node & -node);
}
}
T getVal(int node){
T res=0;
while (node>0){
res+=havi[node];
node -= (node & -node);
}
return res;
}
inline T range(int l,int r){
return getVal(r) - getVal(l-1);
}
};
int n,m;
vector<int> a;
void init(){
cin>>n;
a.assign(n+1,0);
vector<int> org(n);
for (int &x : org) cin>>x;
vector<int> compress(allof(org));
sort(allof(compress));
compress.resize(unique(allof(compress))-compress.begin());
for (int i=1;i<=n;i++)
a[i] = lower_bound(allof(compress),org[i-1]) - compress.begin() + 1;
m = compress.size();
}
void sol(){
// ? dp[i]: minimum block needed to partition a[1...i]
vector<int> dp(n+1,0);
HaviTree<int> havi(m);
int l = 1;
for (int r = 1; r <= n; r++){
while (havi.range(a[l]+1,a[r]-1) > 0){
havi.update(a[l++],1);
}
dp[r] = dp[l-1] + 1;
if (r < n and a[r+1] < a[r]){
for (int k=l;k<=r;k++) havi.update(a[k],1);
l = r + 1;
}
}
cout<<dp[n];
}
int main(){
setup();
init();
sol();
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
