oj.uz

답안 #888249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888249 2023-12-16T16:06:19 Z pcc Money (IZhO17_money) C++14
0 / 100
 1 ms 4696 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
#define tiii tuple<int,int,int>


const int mxn = 1e6+10;

int arr[mxn];
int n;
int bit[mxn];
vector<pii> all;

void modify(int p,int val){
	for(;p<mxn;p+=p&-p)bit[p] += val;
	return;
}
int getval(int p){
	int re = 0;
	for(;p>0;p-= p&-p)re += bit[p];
	return re;
}


int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i = 1;i<=n;i++){
		cin>>arr[i];
		all.push_back(make_pair(arr[i],i));
	}
	sort(all.begin(),all.end());
	for(int i = 1;i<=n;i++){
		arr[i] = lower_bound(all.begin(),all.end(),make_pair(arr[i],i))-all.begin()+1;
	}
	int ans = 0;
	for(int i = n;i>=1;){
		int now = arr[i]-getval(arr[i]);
		int pt = i;
		for(;arr[pt]-getval(arr[pt]) == now&&pt>0;pt--,now--)modify(arr[pt],1);
		ans++;
		//cout<<pt<<' '<<i<<endl;
		i = pt;
	}
	cout<<ans;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Incorrect 1 ms 4444 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Incorrect 1 ms 4444 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Incorrect 1 ms 4444 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Incorrect 1 ms 4444 KB Output isn't correct
5 Halted 0 ms 0 KB -