| Task: | Säähavainnot |
| Sender: | a256 |
| Submission time: | 2023-10-30 13:14:53 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| test | verdict | time | score | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.01 s | 0 | details |
| #2 | WRONG ANSWER | 0.01 s | 0 | details |
| #3 | WRONG ANSWER | 0.01 s | 0 | details |
| #4 | WRONG ANSWER | 0.01 s | 0 | details |
| #5 | WRONG ANSWER | 0.01 s | 0 | details |
| #6 | WRONG ANSWER | 0.01 s | 0 | details |
| #7 | WRONG ANSWER | 0.01 s | 0 | details |
| #8 | WRONG ANSWER | 0.01 s | 0 | details |
Code
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 10123
#define EI (-1e5)
int n;
double T[N][24],dt[N][24],E[N][12],med[12],M[12],m[12],R[12];
double mittaus[8000][24],oikea[8000][24];
void luedata(){
ifstream in;
in.open("sample_data.txt");
int Nn;
in>>Nn;
for(int i=0;i<8000;++i){
for(int h=0;h<24;++h) in>>mittaus[i][h];
for(int h=0;h<12;++h) in>>oikea[i][h];
}
in.close();
}
double mediaani(int h){
vector<double> v;
for(int i=0;i<n;++i){
v.push_back(E[i][h]);
}
if(n&1) return v[n/2];
return (v[n/2]+v[n/2-1])/2;
}
void solve(){
for(int i=0;i<n;++i){
for(int h=0;h<12;++h){
dt[i][h]=T[i][h+1]-T[i][h];
}
double ts=T[i][23];
for(int h=0;h<12;++h){
ts+=dt[i][h];
E[i][h]=ts;
}
}
for(int i=0;i<n;++i){
for(int h=0;h<12;++h){
M[h]=max(M[h],E[i][h]);
m[h]=min(m[h],E[i][h]);
}
}
for(int h=0;h<12;++h){
med[h]=mediaani(h);
int a=0,b=0;
for(int i=0;i<n;++i){
double ero=abs(med[h]-E[i][h]);
if(ero<0.75) ++a;
else if(ero>2.05) ++b;
}
if(a-b>0) R[h]=med[h];
else R[h]=EI;
}
}
void simulaatio(){
luedata();
srand(time(NULL));
vector<int> v;
n=10;
for(int i=0;i<n;++i) v.push_back(rand()%8000);
for(int i=0;i<n;++i){
for(int h=0;h<24;++h) T[i][h]=mittaus[v[i]][h];
}
solve();
for(int h=0;h<12;++h){
if(R[h]!=EI) printf("%.1f ",R[h]);
else printf("? ");
}
puts("");
puts("");
for(int i=0;i<n;++i){
for(int h=0;h<12;++h){
printf("%.1f ",oikea[v[i]][h]);
}
puts("");
}
for(int i=0;i<n;++i){
int a=0,b=0;
for(int h=0;h<12;++h){
if(R[h]==EI) continue;
double ero=abs(R[h]-oikea[v[i]][h]);
if(ero<=0.75) ++a;
else if(ero>=2.05) ++b;
}
int p=25*(a-b);
cout<<p<<'\n';
}
}
void ratkaisu(){
cin>>n;
for(int i=0;i<n;++i){
for(int h=0;h<24;++h) cin>>T[i][h];
}
solve();
for(int h=0;h<12;++h){
if(R[h]!=EI) printf("%.1f ",R[h]);
else printf("? ");
}
puts("");
}
int main(){
//srand(time(NULL));
cin.tie(0)->sync_with_stdio(0);
ratkaisu();
//simulaatio();
}
Test details
Test 1
Verdict: WRONG ANSWER
| 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 |
|---|
| ? ? ? ? ? ? ? ? ? ? ? ? |
Test 2
Verdict: WRONG ANSWER
| 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 |
|---|
| ? ? ? ? ? ? ? ? ? ? ? ? |
Test 3
Verdict: WRONG ANSWER
| 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 |
|---|
| ? ? ? ? ? ? ? ? ? ? ? ? |
Test 4
Verdict: WRONG ANSWER
| 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 |
|---|
| ? ? ? ? ? ? ? ? ? ? ? ? |
Test 5
Verdict: WRONG ANSWER
| 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 |
|---|
| ? ? ? ? ? ? ? ? ? ? ? ? |
Test 6
Verdict: WRONG ANSWER
| 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 |
|---|
| ? ? ? ? ? ? ? ? ? ? ? ? |
Test 7
Verdict: WRONG ANSWER
| 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 |
|---|
| ? ? ? ? ? ? ? ? ? ? ? ? |
Test 8
Verdict: WRONG ANSWER
| 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 |
|---|
| ? ? ? ? ? ? ? ? ? ? ? ? |
