제출 #1186288

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186288		ibrahimfataliyev	Pilot (NOI19_pilot)	C++20	5 / 100	1093 ms	2276 KiB

pilot

#include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <tuple>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <cstring>
#include <array>
#include <string>
#include <stack>
#include <bitset>

#define int long long

using namespace std;

const int oo = 1e18 + 9;
const int MOD = 200;
const int MAX = 1e5 + 100;


void solve(){
    int n,q;
    cin >> n >> q;
    vector<int> h(n);
    vector<int> planes(q);
    for(int i = 0;i<n;i++){
        cin >> h[i];
    }
    for(int i = 0;i<q;i++){
        cin >> planes[i];
    }
    for(auto x : planes){
        int cnt = 0,sum = 0;
        for(int i = 0;i<n;i++){
            if(x>=h[i]){
                cnt++;
            }else{
              break;
            }
        }
        sum+=cnt*(cnt+1)/2;
        cout << sum << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 5 / 5
• Subtask 6: 0 / 9
• Subtask 7: 0 / 14
• Subtask 8: 0 / 10
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11