Submission #1316394

#TimeUsernameProblemLanguageResultExecution timeMemory
1316394djsksbrbfPilot (NOI19_pilot)C++20
28 / 100
91 ms2844 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 = 3e5 + 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, q; cin >> n >> q; int a[n + 5]; for(int i = 1 ; i <= n ; i++)cin >> a[i]; int pref[n + 5];pref[0] = 0; for(int i = 1 ; i <= n ; i++)pref[i] = max(pref[i - 1], a[i]); while(q--){ int x; cin >> x; int l = 1, r = n; int ans = 0; while(l <= r){ int mid = (l + r) >> 1; if(pref[mid] <= x){ ans = mid; l = mid + 1; } else r = mid - 1; } cout << ans*(ans - 1) / 2 + 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...