oj.uz

Submission #1111408

# Submission time Handle Problem Language Result Execution time Memory
1111408 2024-11-12T08:13:40 Z gelastropod Fire (BOI24_fire) C++14
0 / 100
 2000 ms 504 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long

int M;
vector<pair<int, int>> tree;

void upd(int n, int x, int i)
{
    while (n <= M)
    {
        if (tree[n].first < x)
            tree[n] = {x, i};
        n += n & (-n);
    }
}

pair<int, int> qry(int a)
{
    pair<int, int> ans = {-1, -1};
    while (a > 0)
    {
        if (ans.first < tree[a].first)
            ans = tree[a];
        a -= a & (-a);
    }
    return ans;
}

signed main()
{
    int N, a, b;
    cin >> N >> M;
    tree = vector<pair<int, int>>(M + 1, {-1, -1});
    set<pair<int, int>> pairss;
    vector<pair<int, int>> pairs;
    vector<bool> works(N, true);
    for (int i = 0; i < N; i++)
    {
        cin >> a >> b;
        if (a > b) b += M;
        pairss.insert({a, b});
    }
    int counter = 0;
    while (!pairss.empty())
    {
        pairs.push_back(*pairss.begin());
        upd(pairss.begin()->first, pairss.begin()->second, counter);
        counter++;
        pairss.erase(pairss.begin());
    }
    int anss = LLONG_MAX;
    for (int i = 0; i < N; i++)
    {
        if (!works[i]) continue;
        works[i] = false;
        int num = 1;
        int ca = pairs[i].first, cb = pairs[i].second;
        while (cb - ca < M)
        {
            auto z = qry(cb);
            if (z.first != -1 && works[z.second])
            {
                cb = max(cb, z.first);
                works[z.second] = false;
                num++;
            }
            else
                break;
        }
        if (cb - ca >= M)
            anss = min(num, anss);
    }
    if (anss == LLONG_MAX)
        cout << "-1\n";
    else
        cout << anss << '\n';
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 17.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Execution timed out 2077 ms 336 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

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

Subtask #6
0 / 26.0

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