답안 #375167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
375167	2021-03-09T03:55:27 Z	Kalashnikov	Po (COCI21_po)	C++17	70 / 70	27 ms	2024 KB

Main

#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

int a[N] , f[N];

int get(int x) {
	int res = 0;
	for(; x > 0; x &= x+1 , x--) {
		res += f[x];
	}
	return res;
}

void upd(int pos) {
	for(; pos < N; pos |= pos+1) {
		f[pos] ++;
	}
}

void solve() {
	int n;
	cin >> n;
	vector<pair<int,int>> v;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
		v.push_back({a[i] , -i});
	}
	sort(all(v));
	reverse(all(v));
	int ans = 0;
	for(int i = 0; i < n; i ++) {
		int last = -1 , cur = 0;
		while(i+1 < n && v[i].F == v[i+1].F) {
			v[i].S = -v[i].S;
			if(v[i].F == 0) {
				upd(v[i].S);
				i ++;
				continue;
			}
			cur ++;
			if(last == -1) last = v[i].S , upd(v[i].S);
			else {
				upd(v[i].S);
				if(get(v[i].S) - get(last) == v[i].S - last) cur --;
				last = v[i].S;
			}
			i ++;
		}
		v[i].S = -v[i].S;
		if(v[i].F == 0) {
			upd(v[i].S);
			continue;
		}
		cur ++;
		if(last == -1) last = v[i].S , upd(v[i].S);
		else {
			upd(v[i].S);
			if(get(v[i].S) - get(last) == v[i].S - last) cur --;
			last = v[i].S;
		}
		ans += cur;
	}
	cout << ans;
}
/*
*/
main() {
    ios;
    int tt = 1;
    //cin >> tt;
    while(tt --) {
        solve();
    }
    return 0;
}

Compilation message

Main.cpp:78:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   78 | main() {
      |      ^

Subtask #1

70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	12 ms	1260 KB	Output is correct
5	Correct	18 ms	1772 KB	Output is correct
6	Correct	27 ms	2024 KB	Output is correct
7	Correct	17 ms	2024 KB	Output is correct