제출 #519696

#제출 시각아이디문제언어결과실행 시간메모리
519696Killer2501Vudu (COCI15_vudu)C++14
140 / 140
382 ms47348 KiB
#include <bits/stdc++.h> #define ll long long #define ld double #define ull unsigned long long #define pb push_back #define pll pair<ll, ll> #define pii pair<int, int> #define fi first #define se second using namespace std; const int N = 1e6+5; const int M = 1e2+2; const ll base = 1e4; const ll mod = 998244353; const int inf = 1e9; const double ex = 1e-9; int k, t, n; int a[N], b[N], tong, m, fe[N]; ll ans, sum[N]; pii mx[N]; vector<ll> vi, adj[N]; mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count()); void add(int id, int x) { for(; id <= n+1; id += id & -id)fe[id] += x; } int get(int id) { int res = 0; for(; id; id -= id & -id)res += fe[id]; return res; } int lwr(ll x) { return lower_bound(vi.begin(), vi.end(), x) - vi.begin() + 1; } void sol(int icase) { cin >> n; for(int i = 1; i <= n; i ++)cin >> a[i]; cin >> k; for(int i = 1; i <= n; i ++) { sum[i] = sum[i-1] + a[i] - k; vi.pb(sum[i]); } vi.pb(sum[0]); sort(vi.begin(), vi.end()); vi.erase(unique(vi.begin(), vi.end()), vi.end()); add(lwr(0), 1); for(int i = 1; i <= n; i ++) { ans = ans + get(lwr(sum[i])); add(lwr(sum[i]), 1); } cout << ans; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); #define task "test" if(fopen(task".inp", "r")) { freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); } int test = 1; //cin >> test; for(int i = 1; i <= test; i ++)sol(i); return 0; }

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

vudu.cpp: In function 'int main()':
vudu.cpp:66:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |   freopen(task".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
vudu.cpp:67:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |   freopen(task".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...