Submission #62822026
Source Code Expand
#include<bits/stdc++.h>
#define fr(i,l,r) for(int i(l),_##i(r);i<=_##i;i++)
template<class T>inline T rd(T&a){
T x=0;bool f=1;char c=getchar_unlocked();
for(;c<48|c>57;c=getchar_unlocked())f&=c!=45;
for(;c>47&c<58;c=getchar_unlocked())x=10*x+c-48;
return a=f?x:-x;
}template<class T,class...V>inline void rd(T&x,V&...v){rd(x),rd(v...);}
using namespace std;
const int N=1e5+3;
int n,ans;
struct seg {
int l,r;
operator int(){return max(0,r-l+1);}
inline seg operator+(const seg&y)const{return(seg){max(l,y.l),min(r,y.r)};}
}a[N],pre[N],suf[N];
int main(){
fr(i,1,rd(n))rd(a[i].l,a[i].r);
sort(a+1,a+n+1,[](seg a,seg b){return a.l^b.l?a.l<b.l:a.r<b.r;});
pre[1]=a[1],suf[n]=a[n];
fr(i,2,n)pre[i]=pre[i-1]+a[i];
for(int i=n-1;i;i--)suf[i]=suf[i+1]+a[i];
fr(i,2,n-1)ans=max(ans,int(a[i])+int(pre[i-1]+suf[i+1]));
fr(i,1,n-1)ans=max(ans,int(pre[i])+int(suf[i+1]));
return cout<<ans,0;
}
Submission Info
Submission Time
2025-02-15 23:36:10+0900
Task
B - Two Contests
User
AZN_0975
Language
C++ 20 (gcc 12.2)
Score
600
Code Size
924 Byte
Status
AC
Exec Time
13 ms
Memory
5960 KiB
Compile Error
Main.cpp: In instantiation of ‘T rd(T&) [with T = int]’:
Main.cpp:19:2: required from here
Main.cpp:5:15: warning: suggest parentheses around comparison in operand of ‘|’ [-Wparentheses]
5 | for(;c<48|c>57;c=getchar_unlocked())f&=c!=45;
| ~^~~
Main.cpp:6:15: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
6 | for(;c>47&c<58;c=getchar_unlocked())x=10*x+c-48;
| ~^~~
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
600 / 600
Status
Set Name
Test Cases
Sample
00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All
00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt
Case Name
Status
Exec Time
Memory
00-sample-01.txt
AC
1 ms
3540 KiB
00-sample-02.txt
AC
1 ms
3416 KiB
00-sample-03.txt
AC
1 ms
3596 KiB
01-01.txt
AC
1 ms
3496 KiB
01-02.txt
AC
6 ms
4740 KiB
01-03.txt
AC
7 ms
4736 KiB
01-04.txt
AC
7 ms
4828 KiB
01-05.txt
AC
7 ms
4780 KiB
01-06.txt
AC
5 ms
4388 KiB
01-07.txt
AC
1 ms
3536 KiB
01-08.txt
AC
11 ms
5508 KiB
01-09.txt
AC
2 ms
3724 KiB
01-10.txt
AC
12 ms
5692 KiB
01-11.txt
AC
12 ms
5772 KiB
01-12.txt
AC
1 ms
3784 KiB
01-13.txt
AC
11 ms
5568 KiB
01-14.txt
AC
10 ms
5256 KiB
01-15.txt
AC
2 ms
3936 KiB
01-16.txt
AC
4 ms
4248 KiB
01-17.txt
AC
13 ms
5816 KiB
01-18.txt
AC
13 ms
5824 KiB
01-19.txt
AC
13 ms
5752 KiB
01-20.txt
AC
13 ms
5816 KiB
01-21.txt
AC
13 ms
5960 KiB
01-22.txt
AC
13 ms
5820 KiB
01-23.txt
AC
13 ms
5856 KiB
01-24.txt
AC
12 ms
5744 KiB
01-25.txt
AC
12 ms
5860 KiB
01-26.txt
AC
13 ms
5756 KiB
01-27.txt
AC
12 ms
5824 KiB
01-28.txt
AC
13 ms
5820 KiB
01-29.txt
AC
13 ms
5820 KiB
01-30.txt
AC
12 ms
5816 KiB
01-31.txt
AC
12 ms
5876 KiB