oj.uz

Submission #619566

# Submission time Handle Problem Language Result Execution time Memory
619566 2022-08-02T12:59:18 Z ArsBud Addk (eJOI21_addk) C++14
0 / 100
 2000 ms 2668 KB 
#include <iostream>

using namespace std;

int N, K, Q, z, n, nuo, iki, sek, ats = 0, sum = 0;
int m[1000005];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> N >> K;
    for(int a = 0; a < N; a++)
    {
        cin >> m[a];
    }
    cin >> Q;
    for(int a = 0; a < Q; a++)
    {
        cin >> z;
        if(z == 1)
        {
            cin >> n;
            n--;
            int buv = n, p = m[n];
            for(int b = 1; b < K; b++)
            {
                cin >> n;
                n--;
                m[buv] = m[n];
                buv = n;
            }
            m[buv] = p;
        }
        if(z == 2)
        {
            cin >> nuo >> iki >> sek;
            nuo--;
            iki--;
            int pr = 0;
            sum = 0;
            for(int b = nuo; b <= iki; b++)
            {
                sum+= m[b];
                if(nuo == 0 && b + 1 >= sek)
                {
                    ats += sum - pr;
                    pr += m[b - sek + nuo + 1];
                }
                else if((b - min(nuo, iki) + 1 >= sek) || (sek == 1 && nuo == iki))
                {
                    ats += sum - pr;
                    pr += m[b - sek + nuo];
                }
            }
            cout << ats << endl;
            ats = 0;
        }
    }
    return 0;
}

Subtask #1
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 461 ms 1040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2015 ms 2668 KB Time limit exceeded
2 Halted 0 ms 0 KB -