제출 #146329

#제출 시각아이디문제언어결과실행 시간메모리
146329popovicirobertLanguages (IOI10_languages)C++14
0 / 100
4888 ms227020 KiB
#include <bits/stdc++.h> #define ll long long #define ull unsigned long long using namespace std; #include "grader.h" #include "lang.h" #define SZ 100 const int B = (int) 1e9 + 7; unordered_map <ull, bool> mp[60]; bool vis[60]; inline ll myrand() { return (1LL * rand() << 15) + rand(); } void excerpt(int *E) { int i, j; int id = -1; for(int len = 5; len >= 1 && id == -1; len--) { ull cur = 0, pw = 1; for(i = 1; i < len; i++) { pw *= B; } for(i = 0; i + len <= 100 && id == -1; i++) { cur = cur * B + E[i]; if(i >= len - 1) { for(int j = 0; j < 56; j++) { if(mp[j][cur]) { id = j; break; } } cur -= pw * E[i - len + 1]; } } } if(id == -1) { vector <int> ids; for(i = 0; i < 56; i++) { if(vis[i] == 0) ids.push_back(i); } int sz = ids.size(); id = ids[myrand() % sz]; } id = language(id); for(i = 0; i < 100; i++) { ull cur = 0; for(j = i; j < i + 5 && j < 100; j++) { cur = cur * B + E[j]; mp[j - i + 1][cur] = 1; } } vis[id] = 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...