제출 #1316368

#제출 시각아이디문제언어결과실행 시간메모리
1316368djsksbrbfMountains (NOI20_mountains)C++20
49 / 100
2096 ms22104 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair <ll, ll> pii; #define fi first #define se second #define pb push_back const int MOD = 1e9; const int MAX = 2e5 + 5; const int dx[4] = {0, 0, 1, -1}; const int dy[4] = {1, -1, 0, 0}; #define int ll signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int a[n + 5]; for(int i = 1 ; i <= n ; i++)cin >> a[i]; map <int, int> tot; for(int i = 1 ; i <= n ; i++)tot[a[i]]++; map <int, int> mp; ll ans = 0; for(int i = 1 ; i <= n ; i++){ int le = 0, ri = 0; for(auto it : tot){ if(it.fi >= a[i])break; ri += it.se; le += mp[it.fi]; } ans += le*ri; mp[a[i]]++; tot[a[i]]--; } cout << ans << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...