제출 #1142766

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1142766		bestbest	Pilot (NOI19_pilot)	C++20	0 / 100	1 ms	328 KiB

pilot

#include <bits/stdc++.h>
using namespace std;
#define  en '\n'
#define  sp ' '
typedef long long ll;
#define Linux ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pii pair<int,int>

const int N=1e3+10;
int n,Q;
int h[N],y,qs[N];

int main(){Linux
    cin >> n >> Q;
    for(int i=1;i<=n;i++)
    {
        qs[i]=qs[i-1]+i;
        cin >> h[i];
        cout << qs[i] << sp;
    }
    h[n+1]=2e9;
    cout << en;
    int cnt,sum;
    while(Q--){
        cnt=0,sum=0;
        cin >> y;
        for(int i=1;i<=n+1;i++){
            if(h[i]>y){
                sum+=qs[cnt];
                cnt=0;
            }
            else {
                cnt++;
            }
            //cout << qs[cnt] << sp;
        }
        cout << sum << en;
    }

    return 0;
}

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