제출 #1186546

#제출 시각아이디문제언어결과실행 시간메모리
1186546oguzhan09Pilot (NOI19_pilot)C++20
55 / 100
1095 ms2044 KiB
#include<bits/stdc++.h> using namespace std; int main(){ long long n,m; cin>>n>>m; long long l[n]; for(int i=0;i<n;i++) cin>>l[i]; long long cvb=0; long long say=0; long long tests[m]; for(int i=0;i<m;i++) cin>>tests[i]; for(int i=0;i<m;i++){ say=0; for(int j=0;j<n;j++){ if(l[j]<=tests[i]) say++; else{ cvb+=say*(say+1)/2; say=0; } } cvb+=say*(say+1)/2; cout<<cvb<<endl; cvb=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...