CSES - Datatähti 2024 alku - Results
Submission details
Task:Säähavainnot
Sender:stpn129
Submission time:2023-11-12 16:24:00 +0200
Language:C++11
Status:READY
Result:60
Feedback
groupverdictscore
#1ACCEPTED60.13
Test results
testverdicttimescore
#1ACCEPTED0.02 s7.88details
#2ACCEPTED0.02 s8.13details
#3ACCEPTED0.02 s7.63details
#4ACCEPTED0.02 s7.5details
#5ACCEPTED0.02 s7.5details
#6ACCEPTED0.02 s7.25details
#7ACCEPTED0.02 s7details
#8ACCEPTED0.02 s7.25details

Code

#include <bits/stdc++.h>
 
using namespace std;
 
void init_code() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
 
pair<double, double> best_fitting_line(vector<pair<double, double>>& v) {
    int n = v.size();
    
    double sum_x = 0, sum_x2 = 0, sum_y = 0, sum_xy = 0, a, b;
    for (int i = 0; i < n; ++i) {
        sum_x = sum_x + v[i].first;
        sum_x2 = sum_x2 + v[i].first * v[i].first;
        sum_y = sum_y + v[i].second;
        sum_xy = sum_xy + v[i].first * v[i].second;
    }
 
    a = (n * sum_xy - sum_x * sum_y) / (n * sum_x2 -sum_x * sum_x);
    b = (sum_y - a * sum_x) / n;
 
    return {a, b};
}
 
void solve() {
    int n = 24;
    vector<double> a(n);
    vector<pair<double, double>> b;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        if (i > 19) {
            b.emplace_back(i, a[i]);
        }
    }
 
 
    mt19937 mersenne(static_cast<unsigned int>(time(0)));
    uniform_real_distribution<double> rng(-1.0, 0.8);

    pair<double, double> predict = best_fitting_line(b);
 
    for (int i = 0; i < 12; ++i) { 
        if (i < 8) {
            double res = (predict.first * (n + i) + predict.second); 
            res +=  a[n - 1 - i];
            res /= 2;
            if (i > 5) {
                b.erase(b.begin());
            }
            b.emplace_back(n + i, res);
            predict = best_fitting_line(b);

            int k = mersenne() % 101;
            if (k >= (100 - 5 * i)) {
                cout << '?' << ' ';
            } else {
                cout << res << ' ';   
            }
        } else {
            cout << '?' << ' ';
        }
    }
 
    cout << '\n';
}
 
signed main() {
  init_code();
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

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.3 0.325 0.288333 0.130595 -0...
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.65 2.59 2.58167 2.47119 2.33...
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.625 10.345 9.99083 9.15345 ...
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.6 17.785 17.5117 17.0073 16...
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.375 -4.415 -4.4625 -4.68179...
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
13.075 13.345 12.4258 12.3063 ...
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.745 -1.795 -1.96536 -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.475 15.24 15.3675 14.2671 1...
Truncated