oj.uz

Submission #1090660

# Submission time Handle Problem Language Result Execution time Memory
1090660 2024-09-18T15:07:02 Z BigBadBully Fire (BOI24_fire) C++17
13 / 100
 77 ms 14476 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
const int inf = 1e17;
const int mod = 998244353;
 
 
void solve()
{
    int n,m;
    cin >> n >> m;
    vector<pii> v(n);
    for (int i = 0; i< n; i++)
    {
        cin >> v[i].ff >> v[i].ss;
        while(v[i].ff>v[i].ss)
            v[i].ss+=m;
    }
    sort(v.begin(),v.end());
    {
    vector<bool> del(n);
    int maxi = 0;
    for (int i = 0; i < n;i ++)
    {
        if (v[i].ss <= maxi)
            del[i] = 1;
        maxi = max(maxi,v[i].ss);
    }
    vector<pii> neu;
    for (int i = 0; i < n; i++)
        if (!del[i])
            neu.push_back(v[i]);
    n = neu.size();
    v = neu;
    }
    {
    vector<bool> del(n);
    int mini = v[n-1].ss;
    for (int i = n-1; i >= 0;i--)
    {
        if (v[i].ff >= mini)
            del[i] = 1;
        mini = min(mini,v[i].ff);
    }
    vector<pii> neu;
    for (int i = 0; i < n; i++)
        if (!del[i])
            neu.push_back(v[i]);
    n = neu.size();
    v = neu;
    }
    for (int i = 0; i< n;i++)
        v[i].ss%=m;
    /*for (int i = 0; i < n; i++)
        cout << v[i].ff << ' ' << v[i].ss << '\n';*/
    int prev = v[0].ss;
    int used = 1;
    if (v[0].ff != 0)
    {
        cout << -1 << '\n';
        return;
    }
    for (int i = 1; i < n; i++)
    {
        if (v[i].ff > prev)
        {
            used++;
            prev = v[i-1].ss;
            if (v[i].ff > prev)
            {
                cout << -1 << '\n';
                return;
            }
        }
        if (prev != 0 && v[i].ss == 0)
        {
            used++;
            prev = inf;
            break;
        }
    }
    if(prev == inf)
    cout << used << '\n';
    else
    cout << -1 << endl;
}
 
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    solve();
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 17.0

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

Subtask #3
0 / 9.0

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

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 780 KB Output is correct
16 Correct 2 ms 776 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 2 ms 780 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 20 ms 4348 KB Output is correct
21 Correct 48 ms 8268 KB Output is correct
22 Correct 66 ms 8120 KB Output is correct
23 Correct 52 ms 13712 KB Output is correct
24 Correct 54 ms 13904 KB Output is correct
25 Correct 55 ms 7972 KB Output is correct
26 Correct 49 ms 10868 KB Output is correct
27 Correct 77 ms 14476 KB Output is correct
28 Correct 44 ms 7924 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

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