Submission #1972134


Source Code Expand

#include "bits/stdc++.h"

using namespace std;
using ll = long long;
using IP = pair<int, int>;

const ll linf = 1LL << 62;
const int inf = 99999999;
const int dx[4] = { 1,0,-1,0 };
const int sy[4] = { 0,1,0,-1 };
const ll atcoder = 1e9 + 7;

#define Endl endl
#define mp make_pair
#define all(v) v.begin(),v.end()
#define pb push_back
#define pr(x) cout << x << endl
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
#define rep(i,n) for(int i= 0;i<n;i++)

ll gcd(ll a, ll b) {//最大公約数
	if (a%b == 0)return b;
	else gcd(b, a%b);
}

ll lcm(ll a, ll b) {//最小公倍数
	return (a / gcd(a, b))*b;
}

int c[1000001] = { 0 };

int main(){

	int n;
	cin >> n;

	for (int i = 0; i<n; i++) {
		ll a, b;
		cin >> a >> b;
		c[a] ++;
		c[b + 1] --;
	}

	for (int i = 1; i <= 1000001; i++) {
		c[i] += c[i - 1];
	}

	int ans = -inf;
	for (int i = 0; i <= 1000001; i++) {
		chmax(ans, c[i]);
	}

	pr(ans);

	//system("pause");
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User tkkt0001
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1010 Byte
Status AC
Exec Time 70 ms
Memory 4096 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:46:19: warning: iteration 1000000u invokes undefined behavior [-Waggressive-loop-optimizations]
   c[i] += c[i - 1];
                   ^
./Main.cpp:45:20: note: containing loop
  for (int i = 1; i <= 1000001; i++) {
                    ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 17
AC × 42
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask0_sample01.txt, subtask0_sample02.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 6 ms 4096 KB
subtask0_sample02.txt AC 6 ms 4096 KB
subtask1_01.txt AC 6 ms 4096 KB
subtask1_02.txt AC 6 ms 4096 KB
subtask1_03.txt AC 7 ms 4096 KB
subtask1_04.txt AC 8 ms 4096 KB
subtask1_05.txt AC 7 ms 4096 KB
subtask1_06.txt AC 7 ms 4096 KB
subtask1_07.txt AC 7 ms 4096 KB
subtask1_08.txt AC 8 ms 4096 KB
subtask1_09.txt AC 8 ms 4096 KB
subtask1_10.txt AC 8 ms 4096 KB
subtask1_11.txt AC 7 ms 4096 KB
subtask1_12.txt AC 8 ms 4096 KB
subtask1_13.txt AC 8 ms 4096 KB
subtask1_14.txt AC 8 ms 4096 KB
subtask1_15.txt AC 8 ms 4096 KB
subtask2_01.txt AC 56 ms 4096 KB
subtask2_02.txt AC 66 ms 4096 KB
subtask2_03.txt AC 53 ms 4096 KB
subtask2_04.txt AC 63 ms 4096 KB
subtask2_05.txt AC 61 ms 4096 KB
subtask2_06.txt AC 69 ms 4096 KB
subtask2_07.txt AC 67 ms 4096 KB
subtask2_08.txt AC 70 ms 4096 KB
subtask2_09.txt AC 69 ms 4096 KB
subtask2_10.txt AC 67 ms 4096 KB
subtask2_11.txt AC 69 ms 4096 KB
subtask2_12.txt AC 70 ms 4096 KB
subtask2_13.txt AC 67 ms 4096 KB
subtask2_14.txt AC 67 ms 4096 KB
subtask2_15.txt AC 67 ms 4096 KB
subtask2_16.txt AC 68 ms 4096 KB
subtask2_17.txt AC 67 ms 4096 KB
subtask2_18.txt AC 68 ms 4096 KB
subtask2_19.txt AC 67 ms 4096 KB
subtask2_20.txt AC 67 ms 4096 KB
subtask2_21.txt AC 67 ms 4096 KB
subtask2_22.txt AC 68 ms 4096 KB
subtask2_23.txt AC 67 ms 4096 KB
subtask2_24.txt AC 67 ms 4096 KB
subtask2_25.txt AC 69 ms 4096 KB