# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
2536 |
2013-07-23T06:59:10 Z |
tncks0121 |
지우개 (GA4_eraser) |
C++ |
|
14 ms |
3228 KB |
#include <cstdio>
using namespace std;
const int divider = 1000000007;
int N;
long long int a[100001];
long long int b[100001];
long long int c[100001];
int main() {
int i, j, max = -1;
int sum = 0;
long long int s;
scanf("%d", &N);
for (i=0; i<N; ++i) {
int tmp;
scanf("%d", &tmp);
++a[tmp];
if (max < tmp) {
max = tmp;
}
}
for (i=1; i<=max; ++i) {
b[i] = b[i-1] + (a[i] * i) % divider;
b[i] %= divider;
}
for (j=1; j<=max; ++j) {
c[j] = c[j-1] + (a[j] * j) % divider * (b[max] - b[j]);
c[j] %= divider;
}
for (i=1; i<=max; ++i) {
s = a[i] * i * (c[max] - c[i]);
sum += s % divider;
sum %= divider;
}
printf("%d\n", sum);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3228 KB |
Output is correct |
2 |
Correct |
0 ms |
3228 KB |
Output is correct |
3 |
Correct |
0 ms |
3228 KB |
Output is correct |
4 |
Correct |
0 ms |
3228 KB |
Output is correct |
5 |
Correct |
0 ms |
3228 KB |
Output is correct |
6 |
Correct |
0 ms |
3228 KB |
Output is correct |
7 |
Correct |
0 ms |
3228 KB |
Output is correct |
8 |
Correct |
0 ms |
3228 KB |
Output is correct |
9 |
Correct |
0 ms |
3228 KB |
Output is correct |
10 |
Correct |
0 ms |
3228 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3228 KB |
Output is correct |
2 |
Correct |
0 ms |
3228 KB |
Output is correct |
3 |
Correct |
0 ms |
3228 KB |
Output is correct |
4 |
Correct |
0 ms |
3228 KB |
Output is correct |
5 |
Correct |
0 ms |
3228 KB |
Output is correct |
6 |
Correct |
0 ms |
3228 KB |
Output is correct |
7 |
Correct |
0 ms |
3228 KB |
Output is correct |
8 |
Correct |
0 ms |
3228 KB |
Output is correct |
9 |
Correct |
0 ms |
3228 KB |
Output is correct |
10 |
Correct |
0 ms |
3228 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3228 KB |
Output is correct |
2 |
Correct |
0 ms |
3228 KB |
Output is correct |
3 |
Correct |
0 ms |
3228 KB |
Output is correct |
4 |
Correct |
0 ms |
3228 KB |
Output is correct |
5 |
Correct |
0 ms |
3228 KB |
Output is correct |
6 |
Correct |
0 ms |
3228 KB |
Output is correct |
7 |
Correct |
0 ms |
3228 KB |
Output is correct |
8 |
Correct |
0 ms |
3228 KB |
Output is correct |
9 |
Correct |
0 ms |
3228 KB |
Output is correct |
10 |
Correct |
0 ms |
3228 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3228 KB |
Output is correct |
2 |
Correct |
0 ms |
3228 KB |
Output is correct |
3 |
Correct |
0 ms |
3228 KB |
Output is correct |
4 |
Correct |
0 ms |
3228 KB |
Output is correct |
5 |
Correct |
0 ms |
3228 KB |
Output is correct |
6 |
Correct |
0 ms |
3228 KB |
Output is correct |
7 |
Correct |
0 ms |
3228 KB |
Output is correct |
8 |
Correct |
0 ms |
3228 KB |
Output is correct |
9 |
Correct |
0 ms |
3228 KB |
Output is correct |
10 |
Correct |
0 ms |
3228 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
3228 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
3228 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |