# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168564 | trufanov.p | Mate (COCI18_mate) | C++20 | 188 ms | 38684 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <string>
#include <queue>
#include <unordered_set>
#include <deque>
#include <numeric>
using namespace std;
#pragma GCC optimize("O3")
//#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
const ll Mod = 1e9 + 7;
inline ll add(ll a, ll b, ll Mod) {
return (a + b < Mod ? a + b : a + b - Mod);
}
inline ll mul(ll a, ll b, ll Mod) {
return (a * b) % Mod;
}
const int SIZE = 2005;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |