Submission #18091

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
18091	2016-01-20T05:55:13 Z	comet	컬러볼 (KOI15_ball)	C++	0 / 25	3 ms	131072 KB

ball

#include <cstdio>
#include <algorithm>
#include <vector>
#define pb push_back
using namespace std;
typedef vector<int> vec;

int N;
vec a[2010],a_sum[2010];
vec s,sum;

int in[200010],in2[200010];

int query(vec& A,vec& B,int c){
	int id = upper_bound(A.begin(),A.end(),c-1)-A.begin();
	if(id==0)return 0;
	return B[id-1];
}

int main(){
	scanf("%d",&N);
	int x,y;
	s.resize(N);
	sum.resize(N);
	for(int i=0;i<N;i++){
		scanf("%d%d",&x,&y);
		a[x].pb(y);
		s[i]=y;
		in[i]=x,in2[i]=y;
	}

	sort(s.begin(),s.end());
	for(int i=0;i<N;i++){
		sum[i]=s[i];
		if(i)sum[i]+=sum[i-1];
	}
	for(int i=1;i<=2000;i++){
		sort(a[i].begin(),a[i].end());
		a_sum[i].resize(a[i].size());
		for(int j=0;j<a[i].size();j++){
			a_sum[i][j]=a[i][j];
			if(j)a_sum[i][j]+=a_sum[i][j-1];
		}
	}

	for(int i=0;i<N;i++){
		printf("%d\n",query(s,sum,in2[i])-query(a[in[i]],a_sum[in[i]],in2[i]));
	}
	return 0;
}

Subtask #1

0.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	0 ms	4800 KB	SIGSEGV Segmentation fault
2	Runtime error	0 ms	4800 KB	SIGSEGV Segmentation fault
3	Runtime error	0 ms	4800 KB	SIGSEGV Segmentation fault
4	Runtime error	0 ms	4800 KB	SIGSEGV Segmentation fault
5	Runtime error	0 ms	4800 KB	SIGSEGV Segmentation fault
6	Memory limit exceeded	3 ms	131072 KB	Memory limit exceeded
7	Runtime error	0 ms	3368 KB	SIGSEGV Segmentation fault
8	Runtime error	1 ms	3368 KB	SIGSEGV Segmentation fault
9	Runtime error	0 ms	3368 KB	SIGSEGV Segmentation fault
10	Halted	0 ms	0 KB
11	Halted	0 ms	0 KB
12	Halted	0 ms	0 KB
13	Halted	0 ms	0 KB
14	Halted	0 ms	0 KB
15	Halted	0 ms	0 KB
16	Halted	0 ms	0 KB
17	Halted	0 ms	0 KB
18	Halted	0 ms	0 KB
19	Halted	0 ms	0 KB
20	Halted	0 ms	0 KB