| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 270858 | TMJN | Languages (IOI10_languages) | C++17 | 71 ms | 5880 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
map<int,int>mp[55];
int C[55];
void excerpt(int *E) {
pair<double,int>mx={0,0};
for(int i=0;i<55;i++){
if(!C[i])continue;
int c=0;
for(int j=0;j<100;j++){
c+=mp[i][E[j]];
}
mx=max(mx,{c/(double)C[i],i});
}
int l=language(mx.second);
C[l]++;
for(int i=0;i<100;i++){
mp[l][E[i]]++;
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
