| Task: | Säähavainnot |
| Sender: | Niilo |
| Submission time: | 2023-10-31 15:03:55 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 0 |
| test | verdict | time | score | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | 0 | details |
| #2 | ACCEPTED | 0.02 s | 0 | details |
| #3 | ACCEPTED | 0.02 s | 0 | details |
| #4 | ACCEPTED | 0.02 s | 0 | details |
| #5 | ACCEPTED | 0.02 s | 0 | details |
| #6 | ACCEPTED | 0.02 s | 0 | details |
| #7 | ACCEPTED | 0.02 s | 0 | details |
| #8 | ACCEPTED | 0.02 s | 0 | details |
Code
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define TEST_MODE 0
float ar[36];
void guess() {
for (int i=0; i < 12; i++) {
float cur = ar[i];
float pre = ar[i+23];
if (abs(cur-pre) > 0.1F) {
ar[i+24] = pre + (cur < pre ? -0.1F : 0.1F);
} else {
ar[i+24] = cur;
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#if TEST_MODE
freopen("data.txt", "r", stdin);
int a = 0, b = 0;
#endif
int n;
cin >> n;
for (int i=0; i < n; i++) {
for (int j=0; j < 24; j++) {
cin >> ar[j];
}
guess();
for (int j=0; j < 12; j++) {
#if TEST_MODE
float ans;
cin >> ans;
if (j > 5);
else if (abs(ar[j+24] - ans) < 0.75F) a++;
else if (abs(ar[j+24] - ans) > 2.05F) b++;
#else
cout << (j <= 5 ? ar[j+24] : '?') << ' ';
#endif
}
}
#if TEST_MODE
cout << a << ' ' << b << ' ' << 25*(a-b)/n << '\n';
#endif
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 1000 -0.4 -0.1 -0.2 -0.3 -0.4 -0.5 ... |
| correct output |
|---|
| 0.4 0.4 0.5 0.8 0.9 1.1 1.3 1.... |
| user output |
|---|
| 0.1 0 -0.1 -0.2 -0.3 -0.4 63 6... Truncated |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 1000 2.9 2.9 2.9 2.1 2.6 2 2 2.2 2.... |
| correct output |
|---|
| 2.3 1.6 1.5 1.1 1 0.7 0.6 0.8 ... |
| user output |
|---|
| 2.7 2.8 2.9 2.8 2.7 2.6 63 63 ... Truncated |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 1000 6.6 6 6.4 6 4.6 4.6 4.2 4.3 4.... |
| correct output |
|---|
| 10 10.9 10.3 10.1 9.1 7.3 5.7 ... |
| user output |
|---|
| 10 9.9 9.8 9.7 9.6 9.5 63 63 6... Truncated |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 1000 19.4 20.2 19.1 18.9 18.3 17.3 ... |
| correct output |
|---|
| 18 18.2 17 17.5 17.2 16.2 12 8... |
| user output |
|---|
| 17.3 17.4 17.5 17.6 17.7 17.6 ... Truncated |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 1000 -5.7 -5.8 -5.8 -5.9 -7.1 -6.9 ... |
| correct output |
|---|
| -4.2 -4.1 -4 -3.8 -3.5 -3.2 -3... |
| user output |
|---|
| -4.6 -4.7 -4.8 -4.9 -5 -5.1 63... Truncated |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 1000 14.8 14.8 15.4 12.9 11.8 9.7 9... |
| correct output |
|---|
| 11.8 11 11.6 10.8 10.4 10.4 10... |
| user output |
|---|
| 12.7 12.8 12.9 12.9 12.8 12.7 ... Truncated |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 1000 0.7 1 2 1.4 0.6 -0.4 -0.9 -0.7... |
| correct output |
|---|
| -1.3 -0.5 -0.6 -1 -3.2 -7.2 -6... |
| user output |
|---|
| -1.7 -1.6 -1.5 -1.4 -1.3 -1.2 ... Truncated |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 1000 15.1 15.3 14.9 14.4 14.4 13.7 ... |
| correct output |
|---|
| 15.6 15.9 16 15.2 14.6 14.4 13... |
| user output |
|---|
| 15.1 15.2 15.1 15 14.9 14.8 63... Truncated |