# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2950 | 2013-08-18T06:41:14 Z | gs13068 | Languages (IOI10_languages) | C++ | 10000 ms | 14844 KB |
#include"grader.h" #include"lang.h" int lang[56][65536]; int count[65536]; void excerpt(int *str) { double max=987654321,maxlang; double now; int i,j,n,sum; for(i=0;i<65536;i++)count[i]=0; for(i=0;i<100;i++)count[str[i]]++; for(i=0;i<56;i++) { sum=65536; for(j=0;j<65536;j++)sum+=lang[i][j]; now=0; for(j=0;j<65536;j++)now+=((lang[i][j]+1.)/sum-count[j])*((lang[i][j]+1.)/sum-count[j]); if(now<max) { max=now; maxlang=i; } } n=language(maxlang); for(i=0;i<65536;i++)lang[n][i]+=count[i]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 10058 ms | 14844 KB | Time limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 10042 ms | 14840 KB | Time limit exceeded |