# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
573817 | InternetPerson10 | Misspelling (JOI22_misspelling) | C++17 | 342 ms | 27748 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>
typedef long long ll;
using namespace std;
const int MOD = 1e9 + 7;
struct s {
int ans[26] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
};
struct pairhash {
size_t operator()(pair<int, int> const& p) const noexcept {
if(max(p.first, p.second) == -1) return 0;
if(min(p.first, p.second) == -1) return max(p.first, p.second) * -1;
return p.first ^ p.second;
}
};
vector<vector<pair<int, int>>> ops;
map<pair<int, int>, s> ma, ma2;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
pair<int, int> pee = {-1, -1};
for(int i = 0; i < 26; i++) {
ma[pee].ans[i] = 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |