# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
869918 | 2023-11-06T10:33:22 Z | Matjaz | Languages (IOI10_languages) | C++14 | 10000 ms | 31516 KB |
#include <stdlib.h> #include <stdio.h> #include <set> #include <vector> #include <algorithm> using namespace std; #include "grader.h" #include "lang.h" #define SZ 100 set<int> S[56]; int L = 56; void excerpt(int *E) { vector<int> sample; long long a = 719; long long b = 479001599; int l = 4; for (int l=1;l<=4;l++){ for (int i=0;i<100 - l + 1;i++){ int hash = 0; for (int j=0;j<l;j++){ hash = (hash * a + E[i + j]) % b; } sample.push_back(hash); } } int best_score = 0; int best_guess = 0; for (int i=0;i<L;i++){ int score = 0; for (int j=0;j<sample.size();j++) score += S[i].count(sample[j]); if (best_score < score){ best_score = score; best_guess = i; } } int target = language(best_guess); S[target].insert(sample.begin(), sample.end()); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 10007 ms | 31308 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 10011 ms | 31516 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |