# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
165492 | 2019-11-27T11:33:11 Z | Atill83 | Vudu (COCI15_vudu) | C++14 | 354 ms | 31608 KB |
#include <bits/stdc++.h> #define ff first #define ss second #define endl '\n' using namespace std; const long long INF = (long long) 1e18; const int mod = (int) 1e9+7; const int MAXN = (int) 1e6+5; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; ll n; int a[MAXN]; ll pre[MAXN]; pair<ll, int> s[MAXN]; int t[MAXN]; void upd(int pos){ pos += 2; for(;pos < MAXN; pos += (pos & -pos)){ t[pos]++; } } int get(int pos){ pos += 2; ll res = 0; for(; pos > 0; pos -= (pos &-pos)) res += t[pos]; return res; } int main(){ #ifdef Local freopen("../IO/int.txt","r",stdin); freopen("../IO/out.txt","w",stdout); #endif scanf("%lld", &n); for(ll i = 1; i <= n; i++){ scanf("%lld", a + i); pre[i] = pre[i - 1] + a[i]; } ll P; scanf("%lld", &P); s[0] = {0, -1}; for(ll i = 1; i <= n; i++){ s[i] = {pre[i] - i*P, i}; } sort(s, s + n + 1); ll ans = 0; int pos = 0; for(ll i = 0; i <= n; i++){ while(pos < i && s[i].ff >= s[pos].ff) upd(s[pos++].ss); ans += get(s[i].ss); } printf("%lld", ans); #ifdef Local cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds "; #endif }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 632 KB | Output is correct |
2 | Correct | 3 ms | 504 KB | Output is correct |
3 | Correct | 3 ms | 504 KB | Output is correct |
4 | Correct | 350 ms | 30728 KB | Output is correct |
5 | Correct | 189 ms | 17400 KB | Output is correct |
6 | Correct | 301 ms | 27192 KB | Output is correct |
7 | Correct | 313 ms | 28280 KB | Output is correct |
8 | Correct | 269 ms | 24468 KB | Output is correct |
9 | Correct | 354 ms | 31608 KB | Output is correct |
10 | Correct | 303 ms | 27512 KB | Output is correct |