oj.uz

Submission #404018

# Submission time Handle Problem Language Result Execution time Memory
404018 2021-05-13T17:02:25 Z SamAnd Comparing Plants (IOI20_plants) C++17
0 / 100
 4000 ms 525812 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define m_p make_pair
#define fi first
#define se second
const int N = 200005;

int n, k;
vector<int> r;

pair<int, int> t[N * 4];
int laz[N * 4];
void shi(int pos)
{
    t[pos * 2].fi += laz[pos];
    t[pos * 2 + 1].fi += laz[pos];
    laz[pos] = 0;
}
void bil(int tl, int tr, int pos)
{
    if (tl == tr)
    {
        t[pos] = m_p(r[tl], tl);
        return;
    }
    int m = (tl + tr) / 2;
    bil(tl, m, pos * 2);
    bil(m + 1, tr, pos * 2 + 1);
    t[pos] = min(t[pos * 2], t[pos * 2 + 1]);
}

void ubd(int tl, int tr, int l, int r, int y, int pos)
{
    if (l > r)
        return;
    if (tl == l && tr == r)
    {
        t[pos].fi += y;
        laz[pos] += y;
        return;
    }
    shi(pos);
    int m = (tl + tr) / 2;
    ubd(tl, m, l, min(m, r), y, pos * 2);
    ubd(m + 1, tr, max(m + 1, l), r, y, pos * 2 + 1);
    t[pos] = min(t[pos * 2], t[pos * 2 + 1]);
}

pair<int, int> qry(int tl, int tr, int l, int r, int pos)
{
    if (l > r)
        return m_p(N, 0);
    if (tl == l && tr == r)
        return t[pos];
    shi(pos);
    int m = (tl + tr) / 2;
    return min(qry(tl, m, l, min(m, r), pos * 2),
               qry(m + 1, tr, max(m + 1, l), r, pos * 2 + 1));
}

vector<int> ans;
void rec(int i)
{
    while (1)
    {
        pair<int, int> u = m_p(N, 0);
        if (i - k + 1 >= 0)
        {
            u = min(u, qry(0, n - 1, i - k + 1, i - 1, 1));
        }
        else
        {
            u = min(u, qry(0, n - 1, 0, i - 1, 1));
            u = min(u, qry(0, n - 1, n + (i - k + 1), n - 1, 1));
        }
        if (u.fi)
            break;
        rec(u.se);
    }
    ans.push_back(i);
}

void init(int k, vector<int> r)
{
    n = sz(r);
    ::k = k;
    ::r = r;

    bil(0, n - 1, 1);
    rec(t[1].fi);
}

int compare_plants(int x, int y)
{
    if (lower_bound(all(ans), x) - ans.begin() < lower_bound(all(ans), y) - ans.begin())
        return 1;
    return -1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Execution timed out 4061 ms 263068 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Execution timed out 4108 ms 525812 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -