# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159850 | geon040702 | 컬러볼 (KOI15_ball) | C++14 | 130 ms | 8440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define N 200010
int n, s[N], total;
int size[N], color[N], cnt;
struct A {
int size, color, index;
int sum;
} ;
A a[N];
bool comp(A x, A y) { return x.size < y.size; }
bool comp2(A x, A y) { return x.index < y.index; }
int main() {
int i, j;
scanf("%d", &n);
for(i=1;i<=n;i++) {
scanf("%d %d", &a[i].color, &a[i].size);
a[i].index = i;
}
sort(a+1, a+n+1, comp);
for(i=1;i<=n;i++) {
if(a[i].size != a[i-1].size) {
for(j=1;j<=cnt;j++) {
s[color[j]] += size[j];
total += size[j];
}
cnt = 0;
}
cnt++;
size[cnt] = a[i].size;
color[cnt] = a[i].color;
a[i].sum = total - s[a[i].color];
}
sort(a + 1, a + n + 1, comp2);
for(i=1;i<=n;i++) {
printf("%d\n", a[i].sum);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |