# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
632041 | 2022-08-19T10:40:33 Z | Jovan26 | Addk (eJOI21_addk) | C++14 | 2000 ms | 6732 KB |
#include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin>>n; long long k; cin>>k; long long a[n]; for(long i=0;i<n;i++) cin>>a[i]; long long q; cin>>q; bool p = false; vector<long long> v; long long pref[n]; pref[0] = a[0]; for(int i=1;i<n;i++){ pref[i] = pref[i-1]+a[i]; } for(long long j=0;j<q;j++){ int x; cin>>x; if(x==1){ int y; cin>>y; continue; } long long l,r,m; p = true; cin>>l>>r>>m; long long ma = min(m,(r-l+1-m+1)); long long rez = 0; for(long long i=l-1;i<l+ma-2;i++){ rez+=(i-l+2)*a[i]; } for(long long i=r-1;i>r-ma;i--){ rez+=(r-i)*a[i]; } long long s = pref[r-ma]-pref[l+ma-3]; rez+=s*ma; v.push_back(rez); } if(p){ for(long long i=0;i<v.size()-1;i++) cout<<v[i]<<endl; cout<<v[v.size()-1]; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 2 ms | 340 KB | Output is correct |
3 | Correct | 6 ms | 340 KB | Output is correct |
4 | Correct | 6 ms | 364 KB | Output is correct |
5 | Correct | 10 ms | 468 KB | Output is correct |
6 | Correct | 13 ms | 556 KB | Output is correct |
7 | Correct | 27 ms | 600 KB | Output is correct |
8 | Correct | 33 ms | 608 KB | Output is correct |
9 | Correct | 36 ms | 696 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 118 ms | 1120 KB | Output is correct |
2 | Correct | 241 ms | 1488 KB | Output is correct |
3 | Correct | 430 ms | 1948 KB | Output is correct |
4 | Correct | 1371 ms | 3092 KB | Output is correct |
5 | Execution timed out | 2051 ms | 6732 KB | Time limit exceeded |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 177 ms | 2216 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |