oj.uz

답안 #18092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18092 2016-01-20T05:58:31 Z comet 컬러볼 (KOI15_ball) C++
0 / 25
 175 ms 131072 KB 
#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++){
		if(a[i].empty())continue;
		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 ",query(s,sum,in2[i])-query(a[in[i]],a_sum[in[i]],in2[i]));
	}
	return 0;
}

Subtask #1
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 4800 KB SIGSEGV Segmentation fault
2 Runtime error 1 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 3 ms 3368 KB SIGSEGV Segmentation fault
9 Runtime error 0 ms 3368 KB SIGSEGV Segmentation fault
10 Memory limit exceeded 3 ms 131072 KB Memory limit exceeded
11 Incorrect 175 ms 6512 KB Output isn't correct - wrong output format : File not found: "/var/www/temp/18092/outputx241_1"
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