제출 #1142717

#제출 시각아이디문제언어결과실행 시간메모리
1142717tte0Inspections (NOI23_inspections)C++20
0 / 100
316 ms33760 KiB
// Author: Teoman Ata Korkmaz #include <bits/stdc++.h> #define int int_fast64_t using namespace std; constexpr int N=2e5+5; /////////////////////////////////////////////////////////// int n,m,q,x,y,last[N],t,cnt[40000006]; signed main(void){ memset(last,-1,sizeof(last)); cin>>n>>m>>q; while(m--){ cin>>x>>y; for(int i=x;i<=y;i++,t++){ if(last[i]!=-1)cnt[t-last[i]]++; last[i]=t; } } int sum=0; for(int i=4000005;i--;)cnt[i]+=cnt[i+1]; while(q--){ cin>>x; cout<<cnt[x+1]<<" "; } }
#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...