oj.uz

답안 #1080178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080178 2024-08-29T07:49:08 Z raphaelp Fire (BOI24_fire) C++14
0 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N, M;
    cin >> N >> M;
    vector<pair<int, int>> Intervals;
    for (int i = 0; i < N; i++)
    {
        int l, r;
        cin >> l >> r;
        if (r >= l)
        {
            Intervals.push_back({l, r});
            Intervals.push_back({l + M, r + M});
        }
        else
        {
            Intervals.push_back({l, r + M});
        }
    }
    sort(Intervals.begin(), Intervals.end());
    deque<pair<int, int>> DQ;
    int best = 1000000000;
    pair<int, int> next = {-1, -1};
    for (int i = 0; i < Intervals.size(); i++)
    {
        if (DQ.empty() || DQ.back().second < Intervals[i].first)
        {
            if (next.first == -1)
            {
                while (!DQ.empty())
                    DQ.pop_front();
            }
            else
            {
                DQ.push_back({next.second, next.first});
                while (DQ.back().second - DQ.front().first + 1 >= M)
                {
                    best = min(best, (int)DQ.size());
                    DQ.pop_front();
                }
            }
            next = {-1, -1};
        }
        next = max(next, {Intervals[i].second, Intervals[i].first});
    }
    cout << ((best == 1000000000) ? -1 : best);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:26:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for (int i = 0; i < Intervals.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -