제출 #1186879

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186879		darkdevilvaqif	Pilot (NOI19_pilot)	C++20	55 / 100	1096 ms	2052 KiB

pilot

#pragma optimization("03")
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;  

int main() 
{  
    ll n, q, i, maxx, cnt, size;  
    cin >> n >> q;  
    vector <ll> a(n);  
    for (i = 0; i < n; i++) 
    {  
        cin >> a[i];  
    }  
    vector <ll> b(q);  
    for (i = 0; i < q; i++) 
    {  
        cin >> b[i];  
    }  
    for (i = 0; i < q; i++)
    {  
        maxx = b[i], cnt = 0, size = 0;  
        for (auto x : a) 
        {  
            if (x <= maxx)
            {  
                size++;  
            } 
            else
            {  
                cnt += (size * (size + 1)) / 2;  
                size = 0;   
            }  
        }  
        cnt += (size * (size + 1)) / 2;  
        cout << cnt << endl; 
    }  
    return 0;  
}  

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