oj.uz

Submission #1079151

# Submission time Handle Problem Language Result Execution time Memory
1079151 2024-08-28T11:20:23 Z boris_mihov JOIRIS (JOI16_joiris) C++17
0 / 100
 567 ms 262144 KB 
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <ctime>
#include <map>

typedef long long llong;
const int MAXN = 100000 + 10;
const int INF = 1e9;

int n, k;
int a[MAXN];
int cnt[MAXN];
std::vector <std::pair <int,int>> ops;

double begTime;
void solve()
{
    while ((clock() - begTime) / CLOCKS_PER_SEC < 0.5)
    {
        int min = INF, max = 0;
        for (int i = 1 ; i <= n ; ++i)
        {
            min = std::min(min, a[i]);
        }

        for (int i = 1 ; i <= n ; ++i)
        {
            a[i] -= min;
            max = std::max(max, a[i]);
        }
        
        if (max == 0)
        {
            break;
        }

        for (int i = n ; i >= 1 ; --i)
        {
            if (a[i] > 0)
            {
                cnt[i] = 0;
            } else
            {
                cnt[i] = 1 + cnt[i + 1];
            }
        }

        bool done = false;
        for (int i = 1 ; i <= n ; ++i)
        {
            if (cnt[i] >= k)
            {
                for (int j = i ; j < i + k ; ++j)
                {
                    a[j]++;
                }

                ops.push_back({2, i});
                done = true;
                break;
            }
        }

        if (done)
        {
            continue;
        }

        for (int i = 1 ; i <= n ; ++i)
        {
            if (a[i] == 0)
            {
                ops.push_back({1, i});
                a[i] += k;
            }
        }
    }
}

void input()
{
    std::cin >> n >> k;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> a[i];
    }
}

void print()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        if (a[i] > 0)
        {
            std::cout << -1 << '\n';
            return;
        }
    }

    std::cout << ops.size() << '\n';
    for (const auto &[x, y] : ops)
    {
        std::cout << x << ' ' << y << '\n';
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    begTime = clock();
    fastIOI();
    input();
    solve();
    print();

    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 501 ms 16984 KB Output is correct
2 Correct 501 ms 16824 KB Output is correct
3 Correct 501 ms 16984 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 507 ms 131892 KB Output is correct
6 Runtime error 567 ms 262144 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 501 ms 16984 KB Output is correct
2 Correct 501 ms 16824 KB Output is correct
3 Correct 501 ms 16984 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 507 ms 131892 KB Output is correct
6 Runtime error 567 ms 262144 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 501 ms 16984 KB Output is correct
2 Correct 501 ms 16824 KB Output is correct
3 Correct 501 ms 16984 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 507 ms 131892 KB Output is correct
6 Runtime error 567 ms 262144 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -