# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
27054 | 2017-07-09T06:21:23 Z | RayaBurong25_1 | Bulldozer (JOI17_bulldozer) | C++14 | 61 ms | 384 KB |
#include <stdio.h> #include <vector> #include <map> #include <math.h> double X[2005], Y[2005]; long long V[2005]; std::map<long long, long long> M; double dist(int i, int j) { return sqrt((X[i]-X[j])*(X[i]-X[j]) + (Y[i]-Y[j])*(Y[i]-Y[j])); } long long min(long long a, long long b) { return (a < b)?a:b; } long long max(long long a, long long b) { return (a > b)?a:b; } int main() { // freopen("test.in", "r", stdin); // freopen("test.out", "w", stdout); int N; scanf("%d", &N); int i, j, k; for (i = 0; i < N; i++) scanf("%lf %lf %lld", &X[i], &Y[i], &V[i]); double a; long long r; std::map<long long, long long>::iterator it; long long sum, summin, ans = 0; for (i = 0; i < N; i++) { for (j = i + 1; j < N; j++) { M.clear(); a = acos((Y[j] - Y[i])/dist(i, j)); for (k = 0; k < N; k++) { r = (-sin(a)*X[k]-cos(a)*Y[k])*1000000LL; // printf("%lld\n", r); M[r] += V[k]; } sum = 0; summin = 0; for (it = M.begin(); it != M.end(); it++) { sum += it->second; summin = min(summin, sum); ans = max(ans, sum - summin); } } } printf("%lld", ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 384 KB | Output is correct |
2 | Correct | 30 ms | 360 KB | Output is correct |
3 | Correct | 31 ms | 364 KB | Output is correct |
4 | Correct | 30 ms | 360 KB | Output is correct |
5 | Correct | 34 ms | 376 KB | Output is correct |
6 | Correct | 32 ms | 256 KB | Output is correct |
7 | Correct | 31 ms | 256 KB | Output is correct |
8 | Correct | 29 ms | 256 KB | Output is correct |
9 | Correct | 30 ms | 256 KB | Output is correct |
10 | Correct | 30 ms | 256 KB | Output is correct |
11 | Correct | 1 ms | 256 KB | Output is correct |
12 | Incorrect | 1 ms | 384 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 57 ms | 360 KB | Output is correct |
2 | Correct | 59 ms | 256 KB | Output is correct |
3 | Correct | 57 ms | 256 KB | Output is correct |
4 | Correct | 57 ms | 256 KB | Output is correct |
5 | Correct | 58 ms | 356 KB | Output is correct |
6 | Correct | 57 ms | 360 KB | Output is correct |
7 | Correct | 61 ms | 256 KB | Output is correct |
8 | Correct | 57 ms | 256 KB | Output is correct |
9 | Correct | 57 ms | 256 KB | Output is correct |
10 | Correct | 60 ms | 384 KB | Output is correct |
11 | Correct | 2 ms | 304 KB | Output is correct |
12 | Incorrect | 3 ms | 256 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 57 ms | 360 KB | Output is correct |
2 | Correct | 59 ms | 256 KB | Output is correct |
3 | Correct | 57 ms | 256 KB | Output is correct |
4 | Correct | 57 ms | 256 KB | Output is correct |
5 | Correct | 58 ms | 356 KB | Output is correct |
6 | Correct | 57 ms | 360 KB | Output is correct |
7 | Correct | 61 ms | 256 KB | Output is correct |
8 | Correct | 57 ms | 256 KB | Output is correct |
9 | Correct | 57 ms | 256 KB | Output is correct |
10 | Correct | 60 ms | 384 KB | Output is correct |
11 | Correct | 2 ms | 304 KB | Output is correct |
12 | Incorrect | 3 ms | 256 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 57 ms | 360 KB | Output is correct |
2 | Correct | 59 ms | 256 KB | Output is correct |
3 | Correct | 57 ms | 256 KB | Output is correct |
4 | Correct | 57 ms | 256 KB | Output is correct |
5 | Correct | 58 ms | 356 KB | Output is correct |
6 | Correct | 57 ms | 360 KB | Output is correct |
7 | Correct | 61 ms | 256 KB | Output is correct |
8 | Correct | 57 ms | 256 KB | Output is correct |
9 | Correct | 57 ms | 256 KB | Output is correct |
10 | Correct | 60 ms | 384 KB | Output is correct |
11 | Correct | 2 ms | 304 KB | Output is correct |
12 | Incorrect | 3 ms | 256 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 384 KB | Output is correct |
2 | Correct | 30 ms | 360 KB | Output is correct |
3 | Correct | 31 ms | 364 KB | Output is correct |
4 | Correct | 30 ms | 360 KB | Output is correct |
5 | Correct | 34 ms | 376 KB | Output is correct |
6 | Correct | 32 ms | 256 KB | Output is correct |
7 | Correct | 31 ms | 256 KB | Output is correct |
8 | Correct | 29 ms | 256 KB | Output is correct |
9 | Correct | 30 ms | 256 KB | Output is correct |
10 | Correct | 30 ms | 256 KB | Output is correct |
11 | Correct | 1 ms | 256 KB | Output is correct |
12 | Incorrect | 1 ms | 384 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |