# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
51378 | 2018-06-17T18:41:56 Z | adamczh1 | Sure Bet (CEOI17_sure) | C++17 | 77 ms | 744 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; int n; double a[MAXN], b[MAXN]; int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%lf %lf", &a[i], &b[i]); } double res = 0; for (int mask = 0; mask < (1 << (2 * n)); mask++) { double x = 0, y = 0; for (int i = 0; i < n; i++) { if ((mask >> (2 * i)) & 1) { x += a[i] - 1; y--; } if ((mask >> (2 * i + 1)) & 1) { x--; y += b[i] - 1; } } res = max(res, min(x, y)); } printf("%.4lf", res); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 360 KB | Output is correct |
3 | Correct | 76 ms | 472 KB | Output is correct |
4 | Correct | 76 ms | 584 KB | Output is correct |
5 | Correct | 77 ms | 604 KB | Output is correct |
6 | Correct | 77 ms | 616 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 360 KB | Output is correct |
3 | Correct | 76 ms | 472 KB | Output is correct |
4 | Correct | 76 ms | 584 KB | Output is correct |
5 | Correct | 77 ms | 604 KB | Output is correct |
6 | Correct | 77 ms | 616 KB | Output is correct |
7 | Incorrect | 3 ms | 744 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 360 KB | Output is correct |
3 | Correct | 76 ms | 472 KB | Output is correct |
4 | Correct | 76 ms | 584 KB | Output is correct |
5 | Correct | 77 ms | 604 KB | Output is correct |
6 | Correct | 77 ms | 616 KB | Output is correct |
7 | Incorrect | 3 ms | 744 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |