Säähavainnot

#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 > 20) {
            b.emplace_back(i, a[i]);
        }
    }
 
 
    //mt19937 mersenne(static_cast<unsigned int>(time(0)));
    //uniform_real_distribution<> rng(-0.2, 0.2);
 
    pair<double, double> predict = best_fitting_line(b);
 
    for (int i = 0; i < 12; ++i) { 
        double res = (predict.first * (n + i) + predict.second); 
        if (abs(a[i] - res) < abs(a[23 - i] - res)) {
            res += a[i];
        } else {
            res += a[23 - i];
        }
        res /= 2;
        if (i > 3) {
            cout << '?' << ' ';     
        } else {
            cout << res << ' ';
        }
    }
}
 
signed main() {
  init_code();
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED