Submission #8275912


Source Code Expand

#include <cstdio>
#include <algorithm>
using namespace std;
#define N 100000 + 5
#define INF 0x3f3f3f3f

int n, mnr = INF, ans, L[N], R[N], OrdL[N], Pmnr[N], Smnr[N];

int main()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++)
	{
		scanf("%d%d", L + i, R + i);
		OrdL[i] = i;
		mnr = min(mnr, R[i]);
	}
	sort(OrdL + 1, OrdL + n + 1, [](int u, int v) {
		return L[u] < L[v];
	});
	Pmnr[0] = Smnr[n + 1] = INF;
	for (int i = 1; i <= n; i ++)
		Pmnr[i] = min(Pmnr[i - 1], R[OrdL[i]]);
	for (int i = n; i; i --)
		Smnr[i] = min(Smnr[i + 1], R[OrdL[i]]);
	for (int i = 1; i <= n; i ++)
	{
		int tmp = R[OrdL[i]] - L[OrdL[i]] + 1;
		int mxl = i == n ? L[OrdL[n - 1]] : L[OrdL[n]];
		int mnr = min(Pmnr[i - 1], Smnr[i + 1]);
		tmp += max(0, mnr - mxl + 1);
		ans = max(ans, tmp);
	}
	for (int i = 1; i < n && L[OrdL[i]] <= mnr; i ++)
	{
		int l = L[OrdL[n]], r = Smnr[i + 1];
		int tmp = (mnr - L[OrdL[i]] + 1) + max(0, r - l + 1);
		ans = max(ans, tmp);
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Submission Time
Task B - Two Contests
User Gromah
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1029 Byte
Status AC
Exec Time 31 ms
Memory 2176 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:14:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", L + i, R + i);
                              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status AC
AC × 34
Set Name Test Cases
Sample
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 128 KiB
00-sample-02.txt AC 0 ms 128 KiB
00-sample-03.txt AC 1 ms 128 KiB
01-01.txt AC 1 ms 128 KiB
01-02.txt AC 13 ms 1024 KiB
01-03.txt AC 15 ms 1152 KiB
01-04.txt AC 16 ms 1152 KiB
01-05.txt AC 17 ms 1280 KiB
01-06.txt AC 11 ms 896 KiB
01-07.txt AC 1 ms 256 KiB
01-08.txt AC 26 ms 1792 KiB
01-09.txt AC 3 ms 384 KiB
01-10.txt AC 28 ms 1920 KiB
01-11.txt AC 30 ms 2048 KiB
01-12.txt AC 2 ms 256 KiB
01-13.txt AC 26 ms 1792 KiB
01-14.txt AC 23 ms 1664 KiB
01-15.txt AC 5 ms 512 KiB
01-16.txt AC 10 ms 768 KiB
01-17.txt AC 31 ms 2048 KiB
01-18.txt AC 30 ms 2048 KiB
01-19.txt AC 31 ms 2176 KiB
01-20.txt AC 31 ms 2176 KiB
01-21.txt AC 31 ms 2048 KiB
01-22.txt AC 30 ms 2048 KiB
01-23.txt AC 31 ms 2048 KiB
01-24.txt AC 31 ms 2048 KiB
01-25.txt AC 31 ms 2176 KiB
01-26.txt AC 31 ms 2048 KiB
01-27.txt AC 31 ms 2176 KiB
01-28.txt AC 31 ms 2176 KiB
01-29.txt AC 31 ms 2048 KiB
01-30.txt AC 31 ms 2048 KiB
01-31.txt AC 31 ms 2048 KiB