oj.uz

Submission #1047468

# Submission time Handle Problem Language Result Execution time Memory
1047468 2024-08-07T13:23:43 Z sofijavelkovska Event Hopping (BOI22_events) C++17
0 / 100
 172 ms 4948 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=1e5;

int n;
int l[MAXN], r[MAXN];

bool rcompare(int x, int y)
{
    if (r[x]==r[y])
        return l[x]<l[y];

    return r[x]<r[y];
}

int main()
{
    int q;
    cin >> n >> q;
    for (int i=0; i<n; i++)
        cin >> l[i] >> r[i];
    int sorted[n];
    for (int i=0; i<n; i++)
        sorted[i]=i;
    sort(sorted, sorted+n, rcompare);
    int group[n];
    int current=0;
    int ranked[n];
    for (int i=0; i<n; i++)
    {
        ranked[sorted[i]]=i;
        if (i==0 || l[sorted[i]]<=r[sorted[i-1]])
            group[sorted[i]]=current;
        else
        {
            current=current+1;
            group[sorted[i]]=current;
        }
    }
    while (q--)
    {
        int x, y;
        cin >> x >> y;
        x=x-1;
        y=y-1;
        if (group[x]!=group[y])
        {
            cout << "impossible" << '\n';
            continue;
        }
        if (x==y)
        {
            cout << 0 << '\n';
            continue;
        }
        if (r[x]==r[y])
        {
            cout << 1 << '\n';
            continue;
        }
        if (ranked[x]>ranked[y])
        {
            cout << "impossible" << '\n';
            continue;
        }
        cout << ranked[y]-ranked[x] << '\n';
    }

    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 2900 KB Output is correct
2 Correct 165 ms 2900 KB Output is correct
3 Correct 170 ms 2900 KB Output is correct
4 Correct 160 ms 3300 KB Output is correct
5 Correct 166 ms 3152 KB Output is correct
6 Incorrect 172 ms 4948 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

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