# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363375 | 2021-02-05T18:28:36 Z | cig32 | Languages (IOI10_languages) | C++17 | 267 ms | 5868 KB |
#include "bits/stdc++.h" #include "lang.h" #include "grader.h" using namespace std; int word[65536][56]; int totcnt[65536]; int query_no=0; void excerpt(int *a){ query_no++; double s[56]; double m=0; for(int j=0;j<56;j++)s[j]=0; for(int j=0;j<100;j++){ for(int k=0;k<56;k++){ if(totcnt[a[j]])s[k]+=word[a[j]][k]*1.0/(query_no*100); m=max(m,s[k]); } } for(int j=0;j<100;j++){ totcnt[a[j]]++; } int ans; for(int j=0;j<56;j++){ if(s[j]==m){ ans=language(j); break; } } for(int j=0;j<100;j++){ word[a[j]][ans]++; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 266 ms | 5868 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 267 ms | 5868 KB | Output isn't correct - 26.38% |