| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1328144 | Zone_zonee | Pilot (NOI19_pilot) | C++20 | 1092 ms | 824 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6+10;
int a[N];
ll calc(int l, int r){
int len = (r-l+1);
return 1LL*len*(len+1)/2;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
cin >> n >> q;
for(int i = 1; i <= n; ++i) cin >> a[i];
while(q--){
int x; cin >> x;
if(x == 1e6){
cout << calc(1, n) << '\n';
continue;
}
int ans = 0;
int l = 1, r = 1;
while(l <= n){
r = upper_bound(a+l, a+n+1, x) - a;
// cerr << "dbg : " << l << ' ' << r << '\n';
ans += calc(l, r-1);
l = r+1;
}
cout << ans << '\n';
}
}
/*
5 4
1 2 3 4 5
1
2
3
6
*/| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
