Submission #4051092


Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
 
using namespace std;
 
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define pb push_back
#define pf push_front
 
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
typedef vector<ll> vll;
 
ll gcd(ll x, ll y) {
	ll r;
	while ((r = x % y) != 0) {
		x = y;
		y = r;
	}
	return y;
	}
ll lcm(ll x, ll y) {
	x /= gcd(x, y);
	y /= gcd(x, y);
	return (x*y);
}

int main()
{
	int n,ans=0;
    cin >> n;
    int ab[n][2],sum[1000001];
    rep(i,1000001) sum[i]=0;
    rep(i,n){
        rep(j,2) cin >> ab[i][j];
        sum[ab[i][0]]++;
        sum[ab[i][1]+1]--;
    }
    rep(i,1000001){
        sum[i]=(i==0?sum[i]:sum[i-1]+sum[i]);
        ans=(ans>sum[i]?ans:sum[i]);
    }
    cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User mitsui321
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1016 Byte
Status AC
Exec Time 93 ms
Memory 4992 KB

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 5 ms 4096 KB
subtask0_sample02.txt AC 5 ms 4096 KB
subtask1_01.txt AC 5 ms 4096 KB
subtask1_02.txt AC 5 ms 4096 KB
subtask1_03.txt AC 7 ms 4224 KB
subtask1_04.txt AC 7 ms 4224 KB
subtask1_05.txt AC 6 ms 4224 KB
subtask1_06.txt AC 7 ms 4224 KB
subtask1_07.txt AC 7 ms 4224 KB
subtask1_08.txt AC 7 ms 4224 KB
subtask1_09.txt AC 7 ms 4224 KB
subtask1_10.txt AC 7 ms 4224 KB
subtask1_11.txt AC 7 ms 4224 KB
subtask1_12.txt AC 7 ms 4224 KB
subtask1_13.txt AC 7 ms 4224 KB
subtask1_14.txt AC 7 ms 4224 KB
subtask1_15.txt AC 7 ms 4224 KB
subtask2_01.txt AC 67 ms 4992 KB
subtask2_02.txt AC 85 ms 4864 KB
subtask2_03.txt AC 62 ms 4992 KB
subtask2_04.txt AC 81 ms 4992 KB
subtask2_05.txt AC 75 ms 4992 KB
subtask2_06.txt AC 86 ms 4992 KB
subtask2_07.txt AC 87 ms 4864 KB
subtask2_08.txt AC 85 ms 4992 KB
subtask2_09.txt AC 83 ms 4864 KB
subtask2_10.txt AC 85 ms 4864 KB
subtask2_11.txt AC 86 ms 4992 KB
subtask2_12.txt AC 86 ms 4992 KB
subtask2_13.txt AC 85 ms 4864 KB
subtask2_14.txt AC 88 ms 4992 KB
subtask2_15.txt AC 93 ms 4864 KB
subtask2_16.txt AC 89 ms 4864 KB
subtask2_17.txt AC 85 ms 4864 KB
subtask2_18.txt AC 89 ms 4864 KB
subtask2_19.txt AC 89 ms 4992 KB
subtask2_20.txt AC 88 ms 4864 KB
subtask2_21.txt AC 84 ms 4864 KB
subtask2_22.txt AC 85 ms 4992 KB
subtask2_23.txt AC 84 ms 4864 KB
subtask2_24.txt AC 84 ms 4864 KB
subtask2_25.txt AC 85 ms 4992 KB