# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
126518 | 2019-07-08T02:55:32 Z | EntityIT | Coin Collecting (JOI19_ho_t4) | C++14 | 2 ms | 504 KB |
#include<bits/stdc++.h> using namespace std; const int N = (int)1e5 + 5; int n, cntX[N], curCoin[3], cntY[3]; long long ans; int main () { scanf("%d", &n); for (int i = 1; i <= (n << 1); ++i) { int x, y; scanf("%d %d", &x, &y); if (x < 1) ans += 1 - x, x = 1; if (n < x) ans += x - n, x = n; if (y < 1) ans += 1 - y, y = 1; if (2 < y) ans += y - 2, y = 2; ++cntX[x]; ++cntY[y]; } ans += abs(cntY[1] - cntY[2]) / 2; for (int i = 1, cur = 0; i < n; ++i) { cur += cntX[i] - 2; ans += abs(cur); } printf("%lld", ans); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Incorrect | 2 ms | 256 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Incorrect | 2 ms | 256 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Incorrect | 2 ms | 256 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |