-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q10800.java
86 lines (73 loc) · 2.14 KB
/
Q10800.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
package olympiad;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Q10800 {
private static final int MAXSIZE = 2000;
private static class Ball implements Comparable<Ball>{
int sequence;
int color;
int size;
public Ball(int sequence, int color, int size) {
this.sequence = sequence;
this.color = color;
this.size = size;
}
@Override
public int compareTo(Ball ball){
if(this.size == ball.size)
return this.color - ball.color;
return this.size - ball.size;
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int N = Integer.parseInt(br.readLine());
Ball[] balls = new Ball[N];
int rs[] = new int[N];
int sumByColor[] = new int[N + 1];
int sum = 0;
int beforeSize = 0;
int beforeColor = 0;
int sameColors = 0;
int sameSizes = 0;
for (int i = 0; i < N; i++) {
StringTokenizer st = new StringTokenizer(br.readLine());
int color = Integer.parseInt(st.nextToken());
int size = Integer.parseInt(st.nextToken());
balls[i] = new Ball(i, color, size);
}
Arrays.sort(balls);
for (int i = 0; i < N; i++) {
int sequence = balls[i].sequence;
int color = balls[i].color;
int size = balls[i].size;
sum += size;
sumByColor[color] += size;
if(beforeSize == size){
sameSizes++;
if(beforeColor == color){
rs[sequence] = sum - sumByColor[color] - sameSizes * size + ++sameColors * size;
} else {
rs[sequence] = sum - sumByColor[color] - sameSizes * size;
sameColors = 0;
}
} else {
rs[sequence] = sum - sumByColor[color];
sameSizes = 0;
sameColors = 0;
}
beforeSize = size;
beforeColor = color;
}
for (int i = 0; i < N; i++)
bw.write(rs[i] + "\n");
br.close();
bw.close();
}
}