제출 #1134046

#제출 시각아이디문제언어결과실행 시간메모리
1134046alexdd새로운 문제 (POI13_kon)C++20
70 / 100
4091 ms3272 KiB
#include<bits/stdc++.h> using namespace std; int a[300005]; void inicjuj(int n, int k, int *D) { for(int i=0;i<n;i++) { a[i] = max(0, k - D[i]); } } void podlej(int le, int ri) { for(int i=le;i<=ri;i++) a[i]--; } int dojrzale(int le, int ri) { int cnt=0; for(int i=le;i<=ri;i++) if(a[i]<=0) cnt++; return cnt; }
#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...