Submission #1123831

#TimeUsernameProblemLanguageResultExecution timeMemory
1123831a_martianPilot (NOI19_pilot)C++20
55 / 100
1095 ms2496 KiB
#include <iostream>
#include <bits/stdc++.h>
#include <unordered_map>
#include <string>
#include <set>
#include <vector>
using namespace std;

#define int long long
#define INF 1e15
#define MOD (int)998244353
int t,n,q,m,ans;
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    t = 1;
    while(t--){
        cin >> n >> m;
        vector<int> h,mh;
        int val;
        for(int i = 0; i < n; i++){
            cin >> val;
            h.push_back(val);
        }
        for(int i = 0; i < m; i++){
            cin >> val;
            mh.push_back(val);
        }
        int curr = 0;
        ans = 0;
        for(int plane : mh){
            curr = 0;
            ans = 0;
            for(int mount : h){
                if(mount > plane){
                    ans += curr*(curr+1)/2;
                    curr = 0;
                }
                else{
                    curr++;
                }
            }
            ans += curr*(curr+1)/2;
            cout << ans << '\n';
        }
        
            
    }
    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...