This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int nx=4e5+5;
int n, m, s[nx], e[nx], p[nx], cur=1, res=1, st;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>m;
for (int i=1; i<=n; i++)
{
cin>>s[i]>>e[i];
if (s[i]>e[i]) e[i]+=m;
s[i+n]=s[i]+m;
e[i+n]=e[i]+m;
}
for (int i=1; i<=n; i++)
{
pair<int, int> mx={e[i], i};
for (int j=1; j<=2*n; j++) if (s[j]<=e[i]) mx=max(mx, {e[j], (j>n)?(j-n):j});
p[i]=mx.second;
}
//for (int i=1; i<=n; i++) cout<<i<<' '<<p[i]<<'\n';
for (int i=1; i<=n; i++) cur=p[cur];
st=cur;
if (p[cur]==st) return cout<<-1, 0;
while (p[cur]!=st) res++, cur=p[cur];
cout<<res;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |