# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1244821 | CrabCNH | Unija (COCI17_unija) | C++20 | 210 ms | 6976 KiB |
#include <bits/stdc++.h>
#define pii pair <int, int>
#define fi first
#define se second
using namespace std;
const int N = 1e7 + 5;
const int inf = 1e18 + 7;
int mp[N];
signed main () {
ios_base :: sync_with_stdio (0);
cin.tie (0);
cout.tie (0);
#define task "crab"
if (fopen (task".inp", "r")) {
freopen (task".inp", "r", stdin);
freopen (task".out", "w", stdout);
}
int n;
cin >> n;
for (int i = 1; i <= n; i ++) {
int x, y;
cin >> x >> y;
mp[x / 2] = max (mp[x / 2], y / 2);
}
int cur = 0;
long long ans = 0;
for (int i = 1e7; i >= 1; i --) {
cur = max (cur, mp[i]);
ans += cur;
}
cout << ans * 4;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |