# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65840 | jaehun630 | Languages (IOI10_languages) | C++14 | 296 ms | 2112 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 <stdlib.h>
#include <stdio.h>
#include <vector>
#include "grader.h"
#include "lang.h"
#define SZ 100
int prev[1100000];
std::vector<std::pair<int, int>> v[65536];
void excerpt(int *E) {
int lang[56];
for (int i = 0; i < 56; i++) lang[i] = 0;
for (int i = 0; i < 100; i++)
if (v[E[i]].size() > 0)
for (int j = 0; j < v[E[i]].size(); j++)
lang[v[E[i]].at(j).first] += v[E[i]].at(j).second;
int idx = 0, cnt = 0;
for (int i = 0; i < 56; i++)
if (cnt < lang[i])
cnt = lang[i], idx = i;
int ans = language(idx);
for (int i = 0; i < 100; i++){
int inserted = 0;
if (v[E[i]].size() > 0)
for (std::vector<std::pair<int, int>>::iterator iter = v[E[i]].begin(); iter != v[E[i]].end(); ++iter)
if ((*iter).first == ans) {
(*iter).second++;
inserted =1;
break;
}
if(!inserted)
v[E[i]].push_back(std::make_pair(ans, 1));
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |