제출 #165484

#제출 시각아이디문제언어결과실행 시간메모리
165484egekabasVudu (COCI15_vudu)C++14
0 / 140
819 ms65540 KiB
#include <bits/stdc++.h> #define ff first #define ss second #define pb push_back #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> pll; typedef pair<ull, ull> pull; typedef pair<ll, ll> pii; typedef pair<ld, ld> pld; ll n, p; ll a[1000009]; set<ll> s; map<ll, ll> mpp; ll cur = 1; ll bit[1000009]; void upd(ll idx){ while(idx > 0){ bit[idx]++; idx -= idx&(-idx); } } ll get(ll idx){ ll ret = 0; while(idx <= cur+2){ ret += bit[idx]; idx += idx&(-idx); } return ret; } int main() { // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); scanf("%lld", &n); for(ll i = 0; i < n; ++i){ scanf("%lld", &a[i]); } scanf("%lld", &p); for(ll i = 0; i < n; ++i){ a[i] -= p; } ll add = 0; for(ll i = 0; i < n; ++i){ s.insert(-a[i]+add); add -= a[i]; s.insert(a[i]+add); } for(auto u : s){ mpp[u] = cur++; } s.clear(); ll ans = 0; add = 0; for(ll i = 0; i < n; ++i){ if(a[i] >= 0){ ++ans; } ans += get(mpp[-a[i]+add]); add -= a[i]; upd(mpp[a[i]+add]); } cout << cur << "\n"; printf("%lld", ans); }

컴파일 시 표준 에러 (stderr) 메시지

vudu.cpp: In function 'int main()':
vudu.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &n);
     ~~~~~^~~~~~~~~~~~
vudu.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &a[i]);
         ~~~~~^~~~~~~~~~~~~~~
vudu.cpp:42:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &p);
     ~~~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...