# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
846748 |
2023-09-08T11:21:39 Z |
JordanTs |
Addk (eJOI21_addk) |
C++17 |
|
1004 ms |
10664 KB |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
const int MAXN=1e6+1;
int N, Q, K;
int A[MAXN];
int j[MAXN];
long long prefix[MAXN];
void fastIO()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
void read()
{
cin >> N >> K;
for(int i=1; i<=N; i++)
{
cin >> A[i];
prefix[i]=prefix[i-1]+A[i];
}
}
void change()
{
for(int i=1; i<K; i++)
{
swap(A[j[i]], A[j[i-1]]);
}
}
long long rsq(int& l, const int& r, int& m)
{
long long sum=0;
if(m>(r-l+1)/2)
{
m=(r-l+1)-m+1;
}
for(int i=0; i<m; i++)
{
sum+=(prefix[r-i]-prefix[l+i-1]);
}
return sum;
}
void solve()
{
cin >> Q;
while(Q--)
{
int t;
cin >> t;
if(t==2)
{
int l, r, m;
cin >> l >> r >> m;
cout << rsq(l, r, m) << '\n';
}
else
{
for(int i=0; i<K; i++)
{
cin >> j[i];
}
///change();
}
}
}
int main()
{
fastIO();
read();
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
Output is correct |
2 |
Correct |
1 ms |
4596 KB |
Output is correct |
3 |
Correct |
2 ms |
4444 KB |
Output is correct |
4 |
Correct |
3 ms |
4444 KB |
Output is correct |
5 |
Correct |
4 ms |
4696 KB |
Output is correct |
6 |
Correct |
5 ms |
4568 KB |
Output is correct |
7 |
Correct |
7 ms |
4696 KB |
Output is correct |
8 |
Correct |
9 ms |
4700 KB |
Output is correct |
9 |
Correct |
15 ms |
4948 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
52 ms |
5456 KB |
Output is correct |
2 |
Correct |
111 ms |
7868 KB |
Output is correct |
3 |
Correct |
196 ms |
8320 KB |
Output is correct |
4 |
Correct |
629 ms |
9448 KB |
Output is correct |
5 |
Correct |
1004 ms |
10664 KB |
Output is correct |
6 |
Correct |
918 ms |
10528 KB |
Output is correct |
7 |
Correct |
781 ms |
10496 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
144 ms |
9044 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |