Submission #229765


Source Code Expand

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdlib>

using namespace std;

#define ALL(c) c.begin(),c.end()
#define RALL(c) c.rbegin(),c.rend()
#define SORT(x) sort((x).begin(),(x).end())
#define REP(i,x,y) for(int i=(x);i<(y);++i)
#define MP(a,b) make_pair((a),(b))
#define F_ first
#define S_ second

typedef long long int lli;
typedef pair<int,int> P;

const int INF=1<<30;
const long long int INF_=1<<60;

void CumSum(int tiles[],int s[]){
	s[0]=tiles[0];
	for(int x=1; x<1000002; ++x) s[x]=s[x-1]+tiles[x];
}

int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	int cnt[1000002];
	memset(cnt,0,sizeof(cnt));
	int N;
	cin >> N;
	REP(i,0,N){
		int A,B;
		cin >> A >> B;
		++cnt[A];
		--cnt[B+1];
	}
	int s[000002];
	memset(s,0,sizeof(s));
	CumSum(cnt,s);
	int ans=0;
	REP(i,0,1000002){
		ans=max(ans,s[i]);
		//cout << s[i] << ' ';
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User walkre
Language C++ (G++ 4.6.4)
Score 0
Code Size 1127 Byte
Status RE
Exec Time 310 ms
Memory 4772 KB

Compile Error

./Main.cpp:29:29: warning: left shift count >= width of type [enabled by default]

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
RE × 2
RE × 17
RE × 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 RE 310 ms 4644 KB
subtask0_sample02.txt RE 269 ms 4636 KB
subtask1_01.txt RE 263 ms 4640 KB
subtask1_02.txt RE 263 ms 4652 KB
subtask1_03.txt RE 263 ms 4652 KB
subtask1_04.txt RE 264 ms 4720 KB
subtask1_05.txt RE 266 ms 4644 KB
subtask1_06.txt RE 266 ms 4772 KB
subtask1_07.txt RE 266 ms 4648 KB
subtask1_08.txt RE 271 ms 4632 KB
subtask1_09.txt RE 265 ms 4764 KB
subtask1_10.txt RE 271 ms 4652 KB
subtask1_11.txt RE 266 ms 4648 KB
subtask1_12.txt RE 268 ms 4652 KB
subtask1_13.txt RE 267 ms 4768 KB
subtask1_14.txt RE 268 ms 4644 KB
subtask1_15.txt RE 262 ms 4632 KB
subtask2_01.txt RE 293 ms 4652 KB
subtask2_02.txt RE 304 ms 4700 KB
subtask2_03.txt RE 294 ms 4640 KB
subtask2_04.txt RE 290 ms 4768 KB
subtask2_05.txt RE 286 ms 4652 KB
subtask2_06.txt RE 306 ms 4640 KB
subtask2_07.txt RE 303 ms 4764 KB
subtask2_08.txt RE 299 ms 4636 KB
subtask2_09.txt RE 296 ms 4644 KB
subtask2_10.txt RE 295 ms 4772 KB
subtask2_11.txt RE 305 ms 4648 KB
subtask2_12.txt RE 298 ms 4764 KB
subtask2_13.txt RE 303 ms 4640 KB
subtask2_14.txt RE 301 ms 4648 KB
subtask2_15.txt RE 298 ms 4764 KB
subtask2_16.txt RE 308 ms 4772 KB
subtask2_17.txt RE 301 ms 4644 KB
subtask2_18.txt RE 294 ms 4768 KB
subtask2_19.txt RE 298 ms 4644 KB
subtask2_20.txt RE 297 ms 4636 KB
subtask2_21.txt RE 291 ms 4644 KB
subtask2_22.txt RE 302 ms 4768 KB
subtask2_23.txt RE 296 ms 4648 KB
subtask2_24.txt RE 305 ms 4648 KB
subtask2_25.txt RE 297 ms 4772 KB